Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
P. Montgomery, Modular Multiplication without Trial Division, Mathematics of Computation 44(170), pp 519–521, July 1997.
E. Brickell, A Survey of Hardware Implementations for RSA, Advances in Cryptology, Proceedings of Crypto’89, 1990.
C. Ding, D. Pei and A. Salomaa, Chinese Remainder Theorem-Applications in Computing, Coding, Cryptography, World Scientific Publishing, 1996.
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.
H. Handschuh and P. Paillier, CryptoBytes Vol. 4, Num. 1, Sum. 1998
B. Arazi and D. Naccache, Binary to Decimal Conversion Based on the Divisibility of 255 by 5, Electronic Letters, Vol. 28, Num. 23, 1992.
J. F. Dhem, Design of an Efficient Public-Key Cryptographic Librairy for RISC-based Smart Cards, PhD Thesis, UCL, 1998
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Paillier, P. (1999). Low-Cost Double-Size Modular Exponentiation or How to Stretch Your Cryptoprocessor. In: Public Key Cryptography. PKC 1999. Lecture Notes in Computer Science, vol 1560. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49162-7_18
Download citation
DOI: https://doi.org/10.1007/3-540-49162-7_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65644-9
Online ISBN: 978-3-540-49162-0
eBook Packages: Springer Book Archive