Cryptography – Particular algorithmic function encoding – Public key
Patent
1997-04-07
1999-11-16
Swann, Tod R.
Cryptography
Particular algorithmic function encoding
Public key
380 23, H04K 100, H04L 930
Patent
active
059871385
ABSTRACT:
According to the invention, the secret key of the claimant is constituted by k numbers s.sub.1, s.sub.2, . . . , s.sub.k with a low public exponent. The verifier draws k numbers a.sub.1, a.sub.2, . . . , a.sub.k in which the number of non-zero a.sub.i is below a given number p. The claimant or signatory calculates an answer involving an exponential product of form s.sub.i.sup.a.sbsp.1 with i between 1 and k. The verifier calculates another exponential product of form v.sub.i.sup.a.sbsp.1, where the v.sub.i are numbers corresponding to the public key of the claimant or signatory. The verifier then verifies that the result obtained is correct. The choice of the public exponent and the limitation on p make it possible to reduce the number of secrets for equal security and an approximately equal number of multiplications.
REFERENCES:
patent: 5140634 (1992-08-01), Guillou
patent: 5218637 (1993-06-01), Angebaud
patent: 5600725 (1997-02-01), Rueppel
Cherbonnier Frederic
Gilbert Henri
France Telecom
Jack Todd
Swann Tod R.
LandOfFree
Identification and/or signature process does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Identification and/or signature process, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Identification and/or signature process will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-1334420