Enhanced Elliptic Curve Scalar Multiplication Secure Against Side Channel Attacks and Safe Errors

9Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Elliptic curve cryptography (ECC) is involved in many secure schemes. Such schemes involve the elliptic curve scalar operation which is particularly security sensitive. Many algorithms of this operation have been proposed including security countermeasures. This paper discusses the security issues of such algorithms when running on a device that can be physically accessed. Leveraging these issues, new simple attack schemes to recover scalar bit information are presented and a new detailed attack based on C safe-error, probability and lattice is described against an Elliptic Curve Digital Signature Algorithm (ECDSA) using the Montgomery ladder algorithm. This new attack shows that Montgomery ladder can be sensitive to C safe-errors under some conditions. Finally, new secure elliptic curve scalar operation algorithms are presented with solutions to the discussed issues and guidance for their secure implementations.

Cite

CITATION STYLE

APA

Dubeuf, J., Hely, D., & Beroulle, V. (2017). Enhanced Elliptic Curve Scalar Multiplication Secure Against Side Channel Attacks and Safe Errors. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10348 LNCS, pp. 65–82). Springer Verlag. https://doi.org/10.1007/978-3-319-64647-3_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free