Low-Cost Double-Size Modular Exponentiation or How to Stretch Your Cryptoprocessor
Public-key implementers often face strong hardware-related constraints. In particular, modular operations required in most cryptosystems generally constitute a computational bottleneck in smart-card applications. This paper addresses the size limitation of arithmetic coprocessors and introduces new techniques that virtually increase their computational capacities. We suspect our algorithm to be nearly optimal and challenge the cryptographic community for better results.
KeywordsModular Multiplication Residue Number System Modular Representation Modular Reduction Modular Exponentiation
Unable to display preview. Download preview PDF.
- 1.P. Montgomery, Modular Multiplication without Trial Division, Mathematics of Computation 44(170), pp 519–521, July 1997.Google Scholar
- 2.E. Brickell, A Survey of Hardware Implementations for RSA, Advances in Cryptology, Proceedings of Crypto’89, 1990.Google Scholar
- 3.C. Ding, D. Pei and A. Salomaa, Chinese Remainder Theorem-Applications in Computing, Coding, Cryptography, World Scientific Publishing, 1996.Google Scholar
- 4.J. C. Bajard, L. S. Didier and P. Kornerup, An RNS Montgomery Modular Multiplication Algorithm, Proceedings of ARITH13, IEEE Computer Society, pp 234–239, July 1997.Google Scholar
- 5.H. Handschuh and P. Paillier, CryptoBytes Vol. 4, Num. 1, Sum. 1998Google Scholar
- 6.B. Arazi and D. Naccache, Binary to Decimal Conversion Based on the Divisibility of 255 by 5, Electronic Letters, Vol. 28, Num. 23, 1992.Google Scholar
- 7.J. F. Dhem, Design of an Efficient Public-Key Cryptographic Librairy for RISC-based Smart Cards, PhD Thesis, UCL, 1998Google Scholar