Attacking randomized exponentiations using unsupervised learning

DOI10.1007/978-3-319-10175-0_11MaRDI QIDQ2794581zbMATH OpenOpenAlexFDO

Authors Guilherme Perin, Laurent Imbert, Lionel Torres, Philippe Maurine

Publication date 10 March 2016

Published in Constructive Side-Channel Analysis and Secure Design (Search for Journal in Brave)

Full work available at URL https://hal-lirmm.ccsd.cnrs.fr/lirmm-01096039/file/cosade2014_camera-ready.pdf

zbMATH Keywords

RSAunsupervised learningclustering algorithmselectromagnetic analysisrandomized exponentiationsingle-execution attacks

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Cryptography (94A60) Mathematical problems of computer architecture (68M07)

Recommendations

• ROSETTA for single trace analysis
• Attacking Exponent Blinding in RSA without CRT
• Public Key Perturbation of Randomized RSA Implementations
• Stochastic methods defeat regular RSA exponentiation algorithms with combined blinding methods
• Exponent blinding does not always lift (partial) spa resistance to higher-level security

Cited in

(7)

• Stochastic methods defeat regular RSA exponentiation algorithms with combined blinding methods
• Further Research on N-1 Attack against Exponentiation Algorithms
• Attacking embedded ECC implementations through CMOV side channels
• Key Bit-Dependent Attack on Protected PKC Using a Single Trace
• T_SM: Elliptic Curve Scalar Multiplication Algorithm Secure Against Single-Trace Attacks
• Memory address side-channel analysis on exponentiation
• Trade-off approaches for leak resistant modular arithmetic in RNS

This page was built for publication: Attacking randomized exponentiations using unsupervised learning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2794581)