Low-cost double-size modular exponentiation or how to stretch your cryptoprocessor

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1560, Issue , 1999, Pages 223-234

  Paillier, Pascal ^a,b  

^a GEMPLUS   (France)

^b TELECOM PARISTECH   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CHROMIUM COMPOUNDS; COMPUTATION THEORY; COSTS; HARDWARE SECURITY; SMART CARDS; VIRTUAL ADDRESSES;

COMPUTATIONAL BOTTLENECKS; COMPUTATIONAL CAPACITY; CRYPTO-PROCESSOR; CRYPTOGRAPHIC COMMUNITY; MODULAR EXPONENTIATION; MODULAR OPERATIONS; PUBLIC KEYS; SMART-CARD APPLICATION;

PUBLIC KEY CRYPTOGRAPHY;

EID: 84956859107     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49162-7_18     Document Type: Conference Paper

References (7)

1. P. Montgomery, Modular Multiplication without Trial Division, Mathematics of Computation 44(170), pp 519-521, July 1997.
2. E. Brickell, A Survey of Hardware Implementations for RSA, Advances in Cryptology, Proceedings of Crypto’89, 1990.
3. C. Ding, D. Pei and A. Salomaa, Chinese Remainder Theorem, - Applications in Computing, Coding, Cryptography, World Scientific Publishing, 1996.
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.
5. H. Handschuh and P. Paillier, Smart-Card CryptoCoProcessors for Public- Key Cryptography, CryptoBytes Vol. 4, Num. 1, Sum. 1998
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.
7. J. F. Dhem, Design of an Efficient Public-Key Cryptographic Librairy for RISC-based Smart Cards, PhD Thesis, UCL, 1998