Title :
Fast decryption algorithms for the RSA cryptosystem
Author_Institution :
Dept. of Electr., Electron., & Comput. Eng., Pretoria Univ.
Abstract :
We present four methods to increase the decryption speed of the RSA cryptosystem. The decryption exponent d is obtained by means of special constructions, and the two secret primes p and q are chosen such that the difference between them has low Hamming weight. The suggested methods do not shorten the length of the secret decryption exponent. By applying the Chinese remainder theorem to the special decryption exponent, the decryption speed of the RSA algorithm is significantly increased
Keywords :
public key cryptography; Chinese remainder theorem; Hamming weight; RSA cryptosystem; cryptographic attacks; decryption exponent length; decryption speed increase; fast decryption algorithms; secret primes; Africa; Application software; Cathode ray tubes; Digital signatures; Hamming weight; Polynomials; Public key cryptography; Security; Smart cards;
Conference_Titel :
AFRICON, 2004. 7th AFRICON Conference in Africa
Conference_Location :
Gaborone
Print_ISBN :
0-7803-8605-1
DOI :
10.1109/AFRICON.2004.1406693
