Defeating RSA multiply-always and message blinding countermeasures

DOI10.1007/978-3-642-19074-2_6MaRDI QIDQ3073697zbMATH OpenOpenAlexFDO

Authors Marc F. Witteman, Jasper G. J. van Woudenberg, Federico Menarini

Publication date 11 February 2011

Published in Topics in Cryptology – CT-RSA 2011 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-19074-2_6

zbMATH Keywords

correlationRSAside channel analysismessage blindingmultiply-always

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Attacking Exponent Blinding in RSA without CRT
• Correlation analysis against protected SFM implementations of RSA
• Publication:4502778
• Progress in Cryptology – Mycrypt 2005
• Exclusive exponent blinding may not suffice to prevent timing attacks on RSA

Cites work

• scientific article; zbMATH DE number 2085435 (Why is no real title available?)
• scientific article; zbMATH DE number 2123129 (Why is no real title available?)
• scientific article; zbMATH DE number 1979287 (Why is no real title available?)
• scientific article; zbMATH DE number 1504818 (Why is no real title available?)
• scientific article; zbMATH DE number 1418307 (Why is no real title available?)
• A method for obtaining digital signatures and public-key cryptosystems
• Attacking unbalanced RSA-CRT using SPA.
• Power Analysis for Secret Recovering and Reverse Engineering of Public Key Algorithms
• Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems

Cited in

(13)

• ROSETTA for single trace analysis
• Correlation analysis against protected SFM implementations of RSA
• Progress in Cryptology – Mycrypt 2005
• Exclusive exponent blinding may not suffice to prevent timing attacks on RSA
• Correlated extra-reductions defeat blinded regular exponentiation
• Thwarting side-channel analysis against RSA cryptosystems with additive blinding
• Combined attack on CRT-RSA. Why public verification must not be public?
• Exploiting collisions in addition chain-based exponentiation algorithms using a single trace
• On the (in)security of the Diffie-Hellman oblivious PRF with multiplicative blinding
• Attacking Exponent Blinding in RSA without CRT
• Review of cryptographic schemes applied to remote electronic voting systems: remaining challenges and the upcoming post-quantum paradigm
• Localized electromagnetic analysis of cryptographic implementations
• Stochastic methods defeat regular RSA exponentiation algorithms with combined blinding methods

This page was built for publication: Defeating RSA multiply-always and message blinding countermeasures

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