A faster modular multiplication based on key size partitioning for RSA public-key cryptosystem

IEICE Transactions on Information and Systems

Volumn E85-D, Issue 4, 2002, Pages 789-791

  Lee, Seok Yong ^a   Jeong, Yong Jin ^a   Kwon, Oh Jun ^b  

^a Kwangwoon University   (South Korea)

^b SunMoon University   (South Korea)

Author keywords

Cryptography; Key size partitioning; Modular multiplication; RSA

Indexed keywords

ADDERS; ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; COMPUTER ARCHITECTURE; COMPUTER HARDWARE; THEOREM PROVING;

KEY SIZE PARTITIONING; MODULAR MULTIPLICATION; RIVEST SHAMIR ADLEMAN PUBLIC KEY CRYPTOSYSTEM;

PUBLIC KEY CRYPTOGRAPHY;

EID: 0036538298     PISSN: 09168532     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Letter

References (7)

1. A method for obtaining digital signatures and public-key cryptosystems
2. Hardware implementation of Montgomery's modular multiplication algorithm
3. Fast implementations of RSA cryptography
4. VLSI array algorithms and architectures for RSA modular multiplication
5. Modular multiplication without trial division
6. Fast decipherment algorithm for RSA public-key cryptosystem