Diffie-Hellman Field Size Selection for Security
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current Diffie-Hellman key exchange systems face vulnerabilities due to the choice of field size p, including susceptibility to the special number field sieve, weak discrete logarithm problem, and inefficiencies in arithmetic operations, which existing methods fail to address comprehensively.
Innovation Solution
Selecting a field size p in the form p=hq + 1, where q is a prime of the form (b! + 1) and h is a cofactor, ensuring p=hq + 1 is prime, and choosing a generator integer g whose order modulo p is divisible by q, to enhance security and efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a random prime field size is used, then the discrete logarithm problem remains hard, but the system becomes vulnerable to the special number field sieve and other targeted attacks
Solution Approach 1:
The patent changes the parameter of field size selection from using random primes to using primes of a specific form: p = h*q + 1 where q is a prime of the form b! + 1. This parameter change provides resistance to the special number field sieve while maintaining security through the hardness of the discrete logarithm problem in this structured group.
Solution Approach 2:
The patent creates a composite security approach by combining multiple protective features in the field size structure: the form p = h*q + 1 with q = b! + 1 integrates properties that resist both the special number field sieve and small subgroup attacks, while maintaining the difficulty of the discrete logarithm problem.
2Reliability
If special primes are used to resist the special number field sieve, then security against this attack improves, but hidden vulnerabilities may be introduced that allow attackers to find secret keys
Solution Approach 1:
The patent converts the potential harm of using structured primes (which could introduce hidden vulnerabilities) into a benefit by carefully selecting the structure p = h*q + 1 where q = b! + 1. This specific structure provides resistance to the special number field sieve while the use of factorials and controlled cofactors prevents hidden vulnerabilities that would otherwise allow attackers to compromise secret keys.
3Reliability
If the field size is chosen to prevent small subgroup attacks, then security improves, but arithmetic efficiency among Diffie-Hellman moduli may become non-optimal
Solution Approach 1:
The patent optimizes the parameters by selecting q as a prime of the form b! + 1, which ensures that q has specific divisibility properties. This parameter choice provides resistance to small subgroup attacks while maintaining arithmetic efficiency through the structured nature of the prime form, allowing for optimized modular arithmetic operations.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
A method of effecting secure electronic communication with a correspondent for a Diffie Hellman key exchange, the method including selecting a field size p in the form p=hq + 1, where q is a prime number that is one plus a factorial number b, such that q = (b! + 1), and h is a cofactor, such that p=hq + 1 is prime; selecting a generator integer g whose order modulo p is the prime q or is divisible by q; choosing a private key x; computing a public key gX mod p by raising said generator g to the power of said private key x, using arithmetic modulo said prime field size p; sending said public key gX mod p to a correspondent; receiving, from the correspondent, a second public key B comprising g raised to a second private key y selected by the correspondent, in the form gy; creating a key Bx from the received second public key B, by raising said second public key B to the power of said private key x, using arithmetic modulo said prime field size p and using the key Bx for secure electronic communications with the correspondent.