N-State Switching Circuits Using FLT for Quantum-Resistant Cryptography
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current cryptographic methods are inadequate in resisting quantum computer attacks and providing sufficient security for data exchange, particularly due to the potential vulnerabilities in existing n-state switching operations used in cryptography.
Innovation Solution
The implementation of a modified n-state switching operation based on the Finite Lab Transform (FLT), which transforms input data using a first n-state reversible inverter and outputs using a second n-state reversible inverter, establishing an n-state identity inverter, and applying this modification to public data in computer cryptography to enhance security.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional n-state switching operations are used in cryptographic methods, then the cryptographic operations can be performed with standard algorithms and implementations, but the security resistance against quantum computer attacks is insufficient
Solution Approach 1:
The patent transforms standard binary switching operations (n=2) into multi-state switching operations (n>2) by changing the fundamental parameter of state representation. This is achieved through the Finite Lab Transform (FLT) which maps multiple binary states into a single n-state value, thereby increasing security entropy while maintaining computational feasibility through systematic transformation rules
Solution Approach 2:
The Finite Lab Transform (FLT) acts as an intermediary mechanism between conventional binary cryptography and quantum-resistant cryptography. The FLT and its inverse serve as transformation layers that convert standard cryptographic operations into quantum-resistant operations without requiring complete redesign of underlying cryptographic protocols
2Reliability
If standard cryptographic switching operations are used, then implementation is straightforward with existing algorithms, but the security of data exchange is vulnerable to quantum attacks
Solution Approach 1:
The patent applies the Finite Lab Transform (FLT) as a preliminary transformation step before standard cryptographic operations are performed. By pre-transforming data into the n-state domain using FLT, subsequent cryptographic operations gain quantum resistance while still using familiar algorithms, thus maintaining ease of implementation while improving security
Solution Approach 2:
The patent employs inverse Finite Lab Transform (FLT^-1) as a post-processing step to convert cryptographic results back from the n-state domain to the binary domain. This inversion approach allows standard cryptographic algorithms to operate in the enhanced n-state space and then return to conventional formats, preserving implementation simplicity
Data Source
AI summary
Operational n-state digital circuits and n-state switching operations with n and integer greater than 2 execute Finite Lab-transformed (FLT) n-state switching functions to process n-state signals provided on at least 2 inputs to generate an n-state signal on an output. The FLT is an enhancement of a computer architecture. Cryptographic apparatus and methods apply circuits that are characterized by FLT-ed addition and/or multiplication over finite field GF(n) or by addition and/or multiplication modulo-n that are modified in accordance with reversible n-state inverters, and are no longer known operations. Cryptographic methods processed on FLT modified machine instructions include encryption/decryption, public key generation, and digital signature methods including Post-Quantum methods. They include modification of isogeny based, NTRU based and McEliece based cryptographic machines.