Method and system for determining sequence parameters to limit cycle attacks in timed release cryptography
View Patent ↗A method and system for determining sequence parameters to limit cycle attack in time-line sequences associated with digital signature technologies is disclosed. The method comprises the steps of determining a pair of values associated with a modulus value for generating said sequence, wherein said values are non-equal prime numbers of a known size, selecting a root value of said sequence and selecting a third value for determining the order of said sequence. In one aspect of the invention, each of the pair of values used to determine the modulus is a safe prime number.
1. A method for conducting a timed cryptography procedure, comprising:
generating a succession of sequence values by successive exponentiations according to sequence parameters, of a root value, with a modulus value, over a number of said exponentiations equal to an order value, wherein the succession of sequence values have a sequence period;
wherein the modulus value of the sequence values is a product of a pair of values that are non-equal prime numbers of a known size, whereby the sequence period is elongated; and,
transmitting the sequence values over the number of exponentiations equal to the order value, thereby completing the timed cryptography procedure.
2. The method as recited in claim 1 , wherein each of said pair of values is a safe prime number.
3. The method as recited in claim 1 , wherein each of said pair of values is generated from a Sophie Germain prime number.
4. The method as recited in claim 1 , further comprising providing a random number less than the modulus value, and selecting said root value to equal the random number.
5. The method as recited in claim 1 , further comprising selecting said root value and said modulus value such that a cube of the root value, less the root value, is co-prime to said modulus value.
6. The method as recited in claim 2 , wherein said each of said pair of values is a layered safe number.
7. The method as recited in claim 1 , wherein each of said pair of values is congruent to 3, modulo 4.
8. The method as recited in claim 1 , wherein said order value is selected to be at least 80.
9. A system for conducting a timed cryptography procedure, comprising:
a programmed processor coupled to a memory, said processor operable to generate a succession of sequence values by successive exponentiations according to sequence parameters, of a root value, with a modulus value, over a number of said exponentiations equal to an order value, wherein the succession of sequence values have a sequence period;
wherein the modulus value of the sequence values is a product of a pair of values that are non-equal prime numbers of a known size, whereby the sequence period is elongated; and,
transmitting the sequence values over the number of exponentiations equal to the order value, thereby completing the timed cryptography procedure.