Side-Channel Analysis on Blinded Regular Scalar Multiplications
- 25 October 2014
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
We present a new side-channel attack path threatening state-of-the-art protected implementations of elliptic curves embedded scalar multiplications. Regular algorithms such as the double-and-add-always and the Montgomery ladder are commonly used to protect the scalar multiplication from simple side-channel analysis. Combining such algorithms with scalar and/or point blinding countermeasures lead to scalar multiplications protected from all known attacks. Scalar randomization, which consists in adding a random multiple of the group order to the scalar value, is a popular countermeasure due to its efficiency. Amongst the several curves defined for usage in elliptic curves products, the most used are those standardized by the NIST. As observed in several previous publications, the modulus, hence the orders, of these curves are sparse, primarily for efficiency reasons. In this paper, we take advantage of this specificity to present new attack paths which combine vertical and horizontal side-channel attacks to recover the entire secret scalar in state-of-the-art protected elliptic curve implementations.Keywords
This publication has 33 references indexed in Scilit:
- Correlation Analysis against Protected SFM Implementations of RSALecture Notes in Computer Science, 2013
- Scalar multiplication on Weierstraß elliptic curves from Co-Z arithmeticJournal of Cryptographic Engineering, 2011
- Randomised representationsIET Information Security, 2008
- Faster Addition and Doubling on Elliptic CurvesPublished by Springer Science and Business Media LLC ,2007
- Low-cost solutions for preventing simple side-channel analysis: side-channel atomicityIEEE Transactions on Computers, 2004
- Correlation Power Analysis with a Leakage ModelLecture Notes in Computer Science, 2004
- Speeding the Pollard and elliptic curve methods of factorizationMathematics of Computation, 1987
- Elliptic curve cryptosystemsMathematics of Computation, 1987
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978
- New directions in cryptographyIEEE Transactions on Information Theory, 1976