Stochastic methods defeat regular RSA exponentiation algorithms with combined blinding methods

DOI10.1515/jmc-2020-0010zbMath1469.94093OpenAlexW3160234444MaRDI QIDQ2048183

Margaux Dugardin, Sylvain Guilley, Werner Schindler

Publication date: 5 August 2021

Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/jmc-2020-0010

zbMATH Keywords

RSAoptimizationmaximum likelihoodside-channel analysisMontgomery multiplicationregular exponentiationbase blindingextra-reductionmodulus blinding

Mathematics Subject Classification ID

Point estimation (62F10) Cryptography (94A60) Stochastic processes (60G99)

Related Items (1)

A third is all you need: extended partial key exposure attack on CRT-RSA with additive exponent blinding

Uses Software

• PolarSSL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Information security practice and experience. Third international conference, ISPEC 2007, Hong Kong, China, May 7--9, 2007. Proceedings
• Exclusive exponent blinding may not suffice to prevent timing attacks on RSA
• Correlated extra-reductions defeat blinded regular exponentiation
• Attacking Randomized Exponentiations Using Unsupervised Learning
• Modular Multiplication Without Trial Division
• Zero-Value Point Attacks on Elliptic Curve Cryptosystem
• Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
• A Refined Power-Analysis Attack on Elliptic Curve Cryptosystems
• Improving Divide and Conquer Attacks against Cryptosystems by Better Error Detection / Correction Strategies
• Timing Attack against Protected RSA-CRT Implementation Used in PolarSSL
• Cryptography and Coding
• A Vulnerability in RSA Implementations Due to Instruction Cache Analysis and Its Demonstration on OpenSSL

This page was built for publication: Stochastic methods defeat regular RSA exponentiation algorithms with combined blinding methods