Attacking unbalanced RSA-CRT using SPA.

DOI10.1007/978-3-540-45238-6_21MaRDI QIDQ5187960zbMATH OpenOpenAlexFDO

Authors Pierre-Alain Fouque, Gwenaëlle Martinet, Guillaume Poupard

Publication date 9 March 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-45238-6_21

zbMATH Keywords

factorizationLLL algorithmRSA signaturesimple power analysis

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Cryptography (94A60)

Recommendations

• Power Attack on Small RSA Public Exponent
• Attacking Exponent Blinding in RSA without CRT
• scientific article; zbMATH DE number 1942424
• scientific article; zbMATH DE number 1979287
• scientific article; zbMATH DE number 2085435

Cited in

(6)

• scientific article; zbMATH DE number 2085435 (Why is no real title available?)
• Defeating RSA multiply-always and message blinding countermeasures
• Leakage-resilient signatures
• Power Attack on Small RSA Public Exponent
• Known–Plaintext–Only Attack on RSA–CRT with Montgomery Multiplication
• scientific article; zbMATH DE number 1979287 (Why is no real title available?)

This page was built for publication: Attacking unbalanced RSA-CRT using SPA.

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