Sciweavers

Share
CHES
2000
Springer

Montgomery Exponentiation with no Final Subtractions: Improved Results

10 years 7 months ago
Montgomery Exponentiation with no Final Subtractions: Improved Results
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). Keywords. Montgomery multiplication, modular exponentiation, smart cards, timing attacks, power attacks
Gaël Hachez, Jean-Jacques Quisquater
Added 02 Aug 2010
Updated 02 Aug 2010
Type Conference
Year 2000
Where CHES
Authors Gaël Hachez, Jean-Jacques Quisquater
Comments (0)
books