loading...
Implementing 1,024-Bit RSA Exponentiation on a 32-Bit Processor Core
Boston, Massachusetts July 10-July 12
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ASAP.2000.86238412th IEEE International Conference on ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
B.J. Phillips, University of Adelaide
N. Burgess, Cardiff University
This paper describes how long-wordlength (1024-bit) modular exponentiation may be implemented on a standard 32-bit microprocessor core with a total execution time of under 1 second. The design does not use a long-wordlength arithmetic co-processor. Instead, all arithmetic operations are reduced to 32-bit additions, subtractions and binary shifts, and the processor is augmented with a small hardware enhancement to significantly accelerate accumulation of shifted multi-precision numbers. Target performance is achieved by trading fast arithmetic hardware for extra RAM, to facilitate pre-computation of digit multiples and powers. Signed sliding window algorithms are introduced for exponentiation, multiplication and reduction operations, and attention is paid to the integration of enhanced security features such as blinding and verification.
Index Terms:
Smart Card, Modular Exponentiation, Sliding Windows, RSA, Public Key Cryptography
Citation:
B.J. Phillips, N. Burgess, "Implementing 1,024-Bit RSA Exponentiation on a 32-Bit Processor Core," asap, pp.127, 12th IEEE International Conference on Application-Specific Systems, Architectures and Processors (ASAP'00), 2000
Usage of this product signifies your acceptance of the Terms of Use.