Sciweavers

Share
PKC
1999
Springer

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

11 years 5 months ago
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 adresses 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.
Pascal Paillier
Added 04 Aug 2010
Updated 04 Aug 2010
Type Conference
Year 1999
Where PKC
Authors Pascal Paillier
Comments (0)
books