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.
CITATION STYLE
Paillier, P. (1999). Low-cost double-size modular exponentiation or how to stretch your cryptoprocessor. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1560, pp. 223–234). Springer Verlag. https://doi.org/10.1007/3-540-49162-7_18
Mendeley helps you to discover research relevant for your work.