Syndrome Decoding Cryptography for Low-Cost Devices
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing cryptographic methods for secure communication on low-cost devices like smart cards and RFID chips face challenges due to high computational costs and resource constraints, particularly with RSA and Diffie-Hellman protocols, while quantum cryptography requires impractical quantum tunnels.
Innovation Solution
A cryptographic method involving a distribution and reconciliation process using syndromes and error-correcting codes, where entities A and B calculate and exchange syndromes and intermediate values to securely transmit and decode confidential information, leveraging a ring-based structure and error-correcting codes to ensure security and efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If RSA algorithm is used for cryptographic communication, then security is provided through mathematical difficulty of factoring large integers, but calculations on large public keys become slow on low-cost cryptographic devices with limited computing capabilities
Solution Approach 1:
The patent changes the fundamental parameters of the cryptographic approach by switching from integer factorization (RSA) to syndrome decoding of error-correcting codes. This parameter change enables secure cryptographic operations on low-cost devices with limited computing capabilities while maintaining security through the hardness of decoding random linear codes.
Solution Approach 2:
The patent employs cheap, easily implementable cryptographic operations based on error-correcting codes that can be executed on low-cost devices. The syndrome decoding approach uses simple matrix operations and bitwise computations that are computationally inexpensive compared to traditional public key cryptography, enabling deployment on resource-constrained devices.
2Reliability
If error correcting code decoding from a large random public matrix is used for cryptographic authentication, then security is provided through NP-complete mathematical problems, but storage constraints of low-cost cryptographic devices do not allow implementation
Solution Approach 1:
The patent segments the cryptographic protocol into multiple phases: key generation, syndrome computation, and decoding. By dividing the problem into smaller manageable components, the system achieves NP-complete security through syndrome decoding while keeping individual computational and storage requirements within the capabilities of low-cost cryptographic devices.
Solution Approach 2:
The patent optimizes the parameters of the error-correcting code system to balance security and storage requirements. By carefully selecting the dimensions of the public matrix and the error-correcting code parameters, the system achieves adequate security through NP-complete hardness while maintaining storage constraints compatible with smart cards and RFID tags.
3Reliability
If Diffie-Hellman protocol is used for sharing confidential information, then secure key exchange is achieved, but the resolution of exponential problems becomes one of the most complex arithmetic functions with significant computational cost
Solution Approach 1:
The patent substitutes the complex exponential arithmetic of Diffie-Hellman with simpler linear algebra operations based on error-correcting codes. The syndrome decoding approach replaces expensive modular exponentiation with matrix-vector multiplications and bitwise operations, significantly reducing computational complexity while maintaining secure key exchange capabilities on low-cost devices.
4Reliability
If quantum cryptography solutions are used for exchanging confidential keys, then confidential information can be exchanged with certainty that it will not be intercepted, but the requirement of a quantum tunnel between entities makes it extremely restrictive from a practical point of view
Solution Approach 1:
The patent replaces expensive, infrastructure-dependent quantum cryptography with affordable, device-based error-correcting code decoding. This approach achieves practical deployability on standard low-cost cryptographic devices while providing security based on NP-complete mathematical problems, eliminating the need for specialized quantum infrastructure.
Data Source
Figure 1~2
Figure 3
AI summary
The invention relates to a cryptographic method for communicating confidential information m between a first electronic entity (A) and a second electronic entity (B), comprising a distribution step and a reconciliation step, the distribution step comprising a plurality of steps, one of which consists of the first entity (A) and the second entity (B) calculating a first intermediate value PA and a second intermediate value PB, respectively, such that: PA = YA.SB = YA.XB + YA.f(YB), and PB = YB.SA = YB.XA + YB f(YA), such that, during the reconciliation step, the first entity (A) can retrieve the confidential information by a process of decrypting a noisy message composed by the second entity (B) in particular from the second intermediate value PB.