Defeating RSA Multiply-Always and Message Blinding Countermeasures

DOI10.1007/978-3-642-19074-2_6zbMath1284.94126OpenAlexW1486711257MaRDI QIDQ3073697

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)

Related Items

Localized Electromagnetic Analysis of Cryptographic Implementations ⋮ Review of cryptographic schemes applied to remote electronic voting systems: remaining challenges and the upcoming post-quantum paradigm ⋮ Combined Attack on CRT-RSA ⋮ Exploiting Collisions in Addition Chain-Based Exponentiation Algorithms Using a Single Trace

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
• 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

This page was built for publication: Defeating RSA Multiply-Always and Message Blinding Countermeasures