Cryptography – Communication system using cryptography – Symmetric key cryptography
Patent
1997-11-12
2000-05-16
Swann, Tod R.
Cryptography
Communication system using cryptography
Symmetric key cryptography
708 7, 708103, 708277, 708490, 708501, 380 44, 380 30, 380264, H04L 900
Patent
active
06064740&
ABSTRACT:
Circuitry which performs modular mathematics to solve the equation C=M.sup.k mod n and n is performed in a manner to mask the exponent k's signature from timing or power monitoring attacks. The modular exponentation function is performed in a normalized manner such that binary ones and zeros in the exponent are calculated by being modulo-squared and modulo-multiplied.
REFERENCES:
patent: 4424414 (1984-01-01), Hellman et al.
patent: 4532638 (1985-07-01), Lagger et al.
patent: 4658094 (1987-04-01), Clark
patent: 4891781 (1990-01-01), Omura
patent: 5261001 (1993-11-01), Dariel et al.
patent: 5274707 (1993-12-01), Schafly
patent: 5289397 (1994-02-01), Clark et al.
patent: 5299262 (1994-03-01), Brickell et al.
patent: 5414651 (1995-05-01), Kessels
patent: 5513133 (1996-04-01), Cressel et al.
patent: 5870478 (1999-02-01), Kawamura
patent: 5928315 (1999-07-01), Kobayashi et al.
Kocher, Paul C., Cryptanalysis of Diffie-Hellman, RSA, DSS, and Other Systems Using Timing Attacks, Dec. 7, 1995, pp. 1-6.
Curiger Andreas
Little Wendell
Callahan Paul E.
Swann Tod R.
LandOfFree
Method and apparatus for masking modulo exponentiation calculati 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 and apparatus for masking modulo exponentiation calculati, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for masking modulo exponentiation calculati will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-265609