Improving the Big Mac Attack on Elliptic Curve Cryptography

DOI10.1007/978-3-662-49301-4_23zbMath1405.94056OpenAlexW2404669520MaRDI QIDQ2803645

Sylvain Guilley, Jean-Luc Danger, Philippe Hoogvorst, David Naccache, Cédric Murdica

Publication date: 2 May 2016

Published in: The New Codebreakers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-49301-4_23

zbMATH Keywords

elliptic curve cryptographyside-channel attackside-channel atomicityBig Mac attack

Mathematics Subject Classification ID

Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (1)

Speeding up regular elliptic curve scalar multiplication without precomputation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Formal techniques for distributed systems. Joint IFIP WG 6.1 international conference, FMOODS/FORTE 2013, held as part of the 8th international federated conference on distributed computing techniques, DisCo Tec 2013, Florence, Italy, June 3--5, 2013. Proceedings
• ROSETTA for Single Trace Analysis
• Horizontal Collision Correlation Attack on Elliptic Curves
• Horizontal Correlation Analysis on Exponentiation
• Modular Multiplication Without Trial Division
• Information and Communications Security
• Low-cost solutions for preventing simple side-channel analysis: side-channel atomicity
• Fast Point Multiplication on Elliptic Curves without Precomputation

This page was built for publication: Improving the Big Mac Attack on Elliptic Curve Cryptography