Cryptography – Particular algorithmic function encoding
Reexamination Certificate
2001-10-18
2008-11-25
Smithers, Matthew (Department: 2137)
Cryptography
Particular algorithmic function encoding
C380S030000
Reexamination Certificate
active
07457408
ABSTRACT:
A calculation unit in which the inverse of an integer modulo a large number is determined provides a series of binary numbers prime with the large number, divides those numbers into two groups at random, and effects the products of the numbers of each group.
REFERENCES:
patent: 5414772 (1995-05-01), Naccache et al.
patent: 2001/0010077 (2001-07-01), McGregor et al.
patent: 2002/0041681 (2002-04-01), Hoffstein et al.
patent: 2005/0175174 (2005-08-01), Kahl
patent: 2006/0126830 (2006-06-01), Shimizu
Takagi, Naofumi, “A Modular Inversion Hardware Algorithm with a Redundant Binary Representation”, Aug. 1993, IEICE Trans. Inf. & Syst., vol. E76-D, No. 8.
Hastad, J. 1988. Solving simultaneous modular equations of low degree. SIAM J. Comput. 17, 2 (Apr. 1988), 336-341. DOI=http://dx.doi.org/10.1137/0217019.
D.Naccache et al., “Can D.S.A. be improved ? -Complexity trade-offs with the digital signature standard”, In Pre-proceedings of Eurocrypt'94 (1994). http://citeseer.ist.psu.edu/article
accache95can.html.
Lenstra, A. K et al.. “On the Security of Lenstra's Variant of DSA without Long Inversions”, 2001, In Proceedings of the 4th international Workshop on Practice and theory in Public Key Cryptography: Public Key Cryptography (Feb. 13-15, 2001). K. Kim, Ed. Lecture Notes In Computer Science, vol. 1992. Springer-Verlag, London, 64-72.
Lenstra A K: “Generating standard DSA signatures without long inversion” Advances in Cryptology—Asiacrypt ' 9A6 International Conference on the Theory and Applications of Cryptology and Information Security, Proceedings, Advances in Cryptology—Asiacrypt' 96, International Conference on the Theory and Applications of Cryp, pp. 57-64,XP002173817.
Browdy and Neimark , P.L.L.C.
Oberthur Technologies
Smithers Matthew
Williams Jeffery
LandOfFree
Calculation unit for executing a cryptographic protocol does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Calculation unit for executing a cryptographic protocol, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Calculation unit for executing a cryptographic protocol will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4051240