Cryptography – Particular algorithmic function encoding
Reexamination Certificate
2008-06-03
2008-06-03
Barrón, Jr., Gilberto (Department: 2134)
Cryptography
Particular algorithmic function encoding
Reexamination Certificate
active
07382875
ABSTRACT:
The invention concerns a cryptographic method whereby a second entity (B) verifies by means of a public key, a proof provided by a first entity (A), which consists in the generation by the first entity (A) of a first random number r much higher than any first integer s included in a private key kept secret by the first entity (A). The first entity (A) generates a first element of proof resulting from a modulo n exponentiation of a first integer G included or not in said public key and whereof the exponent is the first random number r. In combination with the first element of proof, a so-called common number, is generated so that the second entity (B) and the first entity (A) should have knowledge of the common number. The first entity (A) generates an image y of said private key by linear combination of the first random number r and of at least a first private key integer s. At least a multiplicative coefficient of the linear combination is said common number. Any one entity generates a second element of proof Y equal to a power modulo n of a second integer G included or not in said public key and whereof the exponent is the image y of said common number, and sends the second element of proof Y to the first entity (B). The second entity (B) verifies whether the first element of proof is in conformity with a product modulo n of a power of the second element of proof Y whereof the exponent is a third integer e and of a power of a fourth integer v included in said public key whereof the exponent is said common number c.
REFERENCES:
patent: 6226383 (2001-05-01), Jablon
patent: 7139917 (2006-11-01), Jablon
patent: WO 00/69114 (2000-11-01), None
Bruce Schneier, Applied Cryptography Second Edition, 1996.
Matsumoto et al., “Speeding Up Secret Computations with Insecure Auxiliary Devices,” Advances in Cryptology, Santa Barbara, Aug. 21-25, 1988, Proceedings of the Conference on the Theory and Application of Cryptography (Crypto), Berlin, Springer, Germany, pp. 497-506 (1988).
Girault Marc
Quisquater Jean-Jacques
Barrón Jr. Gilberto
Drinker Biddle & Reath LLP
France Telecom
Math Riszk
Nalven Andrew L
LandOfFree
Cryptographic method for distributing load among several... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Cryptographic method for distributing load among several..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cryptographic method for distributing load among several... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2810093