Low-Cost Double-Size Modular Exponentiation or How to Stretch Your Cryptoprocessor

Authors:
Pascal Paillier
Affiliations:
-
Venue:
PKC '99 Proceedings of the Second International Workshop on Practice and Theory in Public Key Cryptography
Year:
1999

Citing 4
Cited 7

A survey of hardware implementations of RSA (abstract)

CRYPTO '89 Proceedings on Advances in cryptology
Chinese remainder theorem: applications in computing, coding, cryptography

Chinese remainder theorem: applications in computing, coding, cryptography
Smart Card Crypto-Coprocessors for Public-Key Cryptography

CARDIS '98 Proceedings of the The International Conference on Smart Card Research and Applications
An IWS Montgomery Modular Multiplication Algorithm

ARITH '97 Proceedings of the 13th Symposium on Computer Arithmetic (ARITH '97)

Note on Fast Computation of Secret RSA Exponents

ACISP '02 Proceedings of the 7th Australian Conference on Information Security and Privacy
Implementation of RSA Algorithm Based on RNS Montgomery Multiplication

CHES '01 Proceedings of the Third International Workshop on Cryptographic Hardware and Embedded Systems
Increasing the Bitlength of a Crypto-Coprocessor

CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
A Black Hen Lays White Eggs

CARDIS '08 Proceedings of the 8th IFIP WG 8.8/11.2 international conference on Smart Card Research and Advanced Applications
Recursive Double-Size Modular Multiplications without Extra Cost for Their Quotients

CT-RSA '09 Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology
Fast truncated multiplication for cryptographic applications

CHES'05 Proceedings of the 7th international conference on Cryptographic hardware and embedded systems
Using an RSA accelerator for modular inversion

CHES'05 Proceedings of the 7th international conference on Cryptographic hardware and embedded systems

Quantified Score

Hi-index	0.00

Visualization

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.