Cryptography – Particular algorithmic function encoding – Public key
Reexamination Certificate
2006-06-27
2006-06-27
Jung, David (Department: 2134)
Cryptography
Particular algorithmic function encoding
Public key
C380S268000, C380S028000
Reexamination Certificate
active
07068785
ABSTRACT:
A method for calculating the arithmetic inverse of a number V modulo U, where U is a prime number, that may be used in cryptography, uses a modified extended greatest common divisor (GCD) algorithm that includes a plurality of reduction steps and a plurality of inverse calculations. In this algorithm, the values U and V are assigned to respective temporary variables U3 and V3 and initial values are assigned to respective temporary variables U2 and V2. The algorithm then tests a condition and, if the condition tests true, combines multiple ones of the plurality of reduction steps and multiple ones of the inverse calculations into a single iteration of the GCD algorithm.
REFERENCES:
patent: 5497423 (1996-03-01), Miyaji
patent: 6345098 (2002-02-01), Matyas et al.
patent: 6570988 (2003-05-01), Venkatesan et al.
patent: 6609141 (2003-08-01), Montague
patent: 6763366 (2004-07-01), Hars et al.
patent: 6772184 (2004-08-01), Chang
patent: 6795553 (2004-09-01), Kobayashi et al.
patent: 6925479 (2005-08-01), Chen et al.
patent: 2001/0054052 (2001-12-01), Arazi
patent: 2002/0052906 (2002-05-01), Chang
patent: 2002/0055962 (2002-05-01), Schroeppel
J. Sorenson, “An Analysis of Lehmer's Euclidean Algorithm”; Department of Mathematics and Computer Science; Butler University, 1995.
Introduction to No. Theory, http://www.cs.adfa.oz.au/teaching/studinfo/csc/lectures/publickey.html, 1999.
37. R. P. Brent; “Analysis of the Binary Euclidean Algorithm”, in New Direction and Results in Algorithms and Complexity (edited by J.F. Traub), Academic Press, New York, 1976, 321-355.
J. Sorenson, “An Analysis of Lehmer's Euclidean GCD Algorithm”; Department of Mathematics and Computer Science; Butler University, 1995.
Introduction to Number Theory, http://www.cs.adfa.oz.au/teaching/studinfo/csc/lectures/publickey.html. 1999.
37. R. P. Brent; “Analysis of the binary Euclidean algorithm”, in New Direction and Results in Algorithms and Complexity (edited by J. F. Traub), Academic Press, New York, 1976, 321-355.
Jung David
RatnerPrestia
Szymanski Thomas
LandOfFree
Table driven method for calculating arithmetic inverse for... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Table driven method for calculating arithmetic inverse for..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Table driven method for calculating arithmetic inverse for... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3658387