Device and method for calculating a result of a modular...

Details Device and method for calculating a result of a modular... Device and method for calculating a result of a modular...

2007-07-24

2007-07-24

Vu, Kim (Department: 2135)

Cryptography

Key management

Key distribution

C708S491000, C708S205000, C708S492000, C380S030000

Reexamination Certificate

active

10789373

ABSTRACT:
In a device for calculating a result of a modular exponentiation, the Chinese Residue Theorem (CRT) is used, wherein two auxiliary exponentiations are calculated using two auxiliary exponents and two sub-moduli. In order to improve the safety of the RSA CRT calculations against cryptographic attacks, a randomization of the auxiliary exponents and/or a change of the sub-moduli are performed. Thus, there is a safe RSA decryption and RSA encryption, respectively, by means of the calculating time efficient Chinese Residue Theorem.

REFERENCES:
patent: 5008668 (1991-04-01), Takayama et al.
patent: 5991415 (1999-11-01), Shamir
patent: 7016500 (2006-03-01), Von Der Heidt et al.
patent: 7023990 (2006-04-01), Arita
patent: 0 872 795 (1998-10-01), None
patent: 2 318 892 (1998-05-01), None
patent: WO-98/52319 (1998-11-01), None
patent: WO-99/35782 (1999-07-01), None
Claus P. Schnorr; “Efficient Identification and Signatures for Smart Cards”; Lecture Notes in Computer Science Bd. 434, Berlin, Springer, 1998, pp. 239-252.

Affiliated with

Also associated with

Rating

Device and method for calculating a result of a modular... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Device and method for calculating a result of a modular..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Device and method for calculating a result of a modular... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3742322