Defeating RSA multiply-always and message blinding countermeasures
From MaRDI portal
Publication:3073697
DOI10.1007/978-3-642-19074-2_6zbMATH Open1284.94126OpenAlexW1486711257MaRDI QIDQ3073697FDOQ3073697
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
Recommendations
Cites Work
- A method for obtaining digital signatures and public-key cryptosystems
- Title not available (Why is that?)
- Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Power Analysis for Secret Recovering and Reverse Engineering of Public Key Algorithms
- Title not available (Why is that?)
- Attacking unbalanced RSA-CRT using SPA.
Cited In (9)
- On the (in)security of the Diffie-Hellman oblivious PRF with multiplicative blinding
- Combined attack on CRT-RSA. Why public verification must not be public?
- Review of cryptographic schemes applied to remote electronic voting systems: remaining challenges and the upcoming post-quantum paradigm
- Attacking Exponent Blinding in RSA without CRT
- Progress in Cryptology – Mycrypt 2005
- Localized electromagnetic analysis of cryptographic implementations
- Correlation analysis against protected SFM implementations of RSA
- Exploiting collisions in addition chain-based exponentiation algorithms using a single trace
- ROSETTA for single trace analysis
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)
