High-radix montgomery modular exponentiation on reconfigurable hardware

IEEE Transactions on Computers

Volumn 50, Issue 7, 2001, Pages 759-764

  Blum, Thomas ^a,b   Paar, Christof ^a,c  

^a IEEE   (Switzerland)

^b ERGON INFORMATIK AG   (Switzerland)

^c Worcester Polytechnic Institute   (United States)

Author keywords

Exponentiation; FPGA; Modular arithmetic; Montgomery; RSA; Systolic array

Indexed keywords

HIGH-RADIX MONTGOMERY MODULAR EXPONENTIATION;

ALGORITHMS; CRYPTOGRAPHY; FIELD PROGRAMMABLE GATE ARRAYS; INTEGER PROGRAMMING; OPTIMIZATION; SYSTOLIC ARRAYS;

SECURITY SYSTEMS;

EID: 0035390239     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.936241     Document Type: Article

References (15)

1. Modular multiplication without trial division
2. Programmable active memories: Reconfigurable systems come of age
3. Fast implementations of RSA cryptography
4. Hardware implementation of montgomery's modular multiplication algorithm
5. Simplifying quotient determination in high-radix modular multiplication
6. A systolic, linear-array multiplier for a class of right-shift algorithms
7. Analyzing and comparing montgomery multiplication algorithms
8. Montgomery modular exponentiation on reconfigurable hardware
9. A method for obtaining digital signatures and public key cryptosystems
10. Fast decipherment algorithm for RSA public-key cryptosystem
11. On the performance of signature schemes based on elliptic curves