Cryptography – Particular algorithmic function encoding – Public key
Reexamination Certificate
2011-04-12
2011-04-12
LaForgia, Christian (Department: 2439)
Cryptography
Particular algorithmic function encoding
Public key
C380S028000, C380S044000, C380S045000, C380S277000, C709S228000, C713S100000
Reexamination Certificate
active
07925011
ABSTRACT:
The present disclosure provides a method for performing modular exponentiation. The method may include generating a first remainder (xp) based on an encrypted message (X) modulo a first prime number (p) and generating a second remainder (xq) based on the encrypted message (X) modulo a second prime number (q). The method may further include generating a third remainder (v1) based on the first remainder (xp) raised to a first private key number (d1) modulo the first prime number (p) and simultaneously generating a fourth remainder (v2) based on the second remainder (xq) raised to a second private key number (d2) modulo the second prime number (q). The method may also include subtracting the fourth remainder (v2) from the third remainder (v1) to yield a result (v1−v2) and multiplying the result (v1−v2) by a constant (c) to produce a second result. The method may additionally include generating a sixth remainder (h) by taking the second result modulo the first prime number (p) and multiplying the sixth remainder (h) by the second prime number (q) to produce a third result. The method may further include adding the third result and the fourth remainder (v2) to yield a final result (Y) and generating, at least in part, a public key based on the final result (Y). Of course, many alternatives, variations and modifications are possible without departing from this embodiment.
REFERENCES:
patent: 5274707 (1993-12-01), Schlafly
patent: 6185596 (2001-02-01), Hadad et al.
patent: 6396926 (2002-05-01), Takagi et al.
patent: 6666381 (2003-12-01), Kaminaga et al.
patent: 7027597 (2006-04-01), Stojancic et al.
patent: 7027598 (2006-04-01), Stojancic et al.
patent: 7187770 (2007-03-01), Maddury et al.
patent: 2002/0126838 (2002-09-01), Shimbo et al.
Park,H.,et al,‘Analysis of the Variable Length Nonzero Window Method for Exponentiation’,1999 Elsevier Science, Computers & Mathematics with Applications 37, pp. 21-29, http://www.sciencedirect.com/science?—ob=MImg&—imagekey=B6TYJ-3WKXRBK-3-2&—cdi=5620&—user=2502287&—pii=S089812219900084X&—orig=search&—coverDate=04%2F30%2F1999&—sk=999629992&view=c&wchp=dGLbVtb-zSkWA&md5=16b085d554dcc7dfa3896bc85821120a&ie=/sdarticle.pdf.
Gordon, D.M., ‘A survey of fast exponentiation methods’, Center for Communications Research, Dec. 30, 1997, entire document, http://www.ccrwest.org/gordon/jalg.pdf.
Feghali Wajdi
Gaubatz Gunnar
Gopal Vinodh
Ozturk Erdinc
Wolrich Gilbert M.
Baum Ronald
Grossman Tucker Perreault & Pfleger PLLC
Intel Corporation
LaForgia Christian
LandOfFree
Method for simultaneous modular exponentiations does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method for simultaneous modular exponentiations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for simultaneous modular exponentiations will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2634868