Hachez, G
Quisquater, Jean-Jacques
[UCL]
The Montgomery multiplication is commonly used as the core algorithm for cryptosystems based on modular arithmetic. With the advent of new classes of attacks (timing attacks, power attacks), the implementation of the algorithm should be carefully studied to thwart those attacks. Recently, Colin D. Walter proposed a constant time implementation of this algorithm [17,18]. In this paper, we propose an improved (faster) version of this implementation. We also provide figures about the overhead of these versions relatively to a speed optimised version (theoretically and experimentally).
Bibliographic reference |
Hachez, G ; Quisquater, Jean-Jacques. Montgomery exponentiation with no final subtractions: Improved results.2nd International Workshop on Cryptographic Hardware and Embedded Systems (CHES 2000) (WORCESTER(Massachusetts), Aug 17-18, 2000). In: Lecture Notes in Computer Science, Vol. 1965, p. 293-301 (2001) |
Permanent URL |
http://hdl.handle.net/2078.1/61906 |