Recovering CRT-RSA secret keys from message reduced values with side-channel analysis

DOI10.1007/978-3-319-13039-2_4MaRDI QIDQ2945372zbMATH OpenOpenAlexFDO

Authors Benoit Feix, Hugues Thiebeauld, Lucille Tordella

Publication date 10 September 2015

Published in Progress in Cryptology -- INDOCRYPT 2014 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-13039-2_4

zbMATH Keywords

side-channel analysisexponentiationmodular reductionembedded deviceslong integer arithmetic

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1979287
• Attacking noisy secret CRT-RSA exponents in binary method
• Improved CRT-RSA secret key recovery method from sliding window leakage
• Recovering CRT-RSA secret keys from noisy square-and-multiply sequences in the sliding window method
• Combined attack on CRT-RSA. Why public verification must not be public?

Cited in

(3)

• Thwarting side-channel analysis against RSA cryptosystems with additive blinding
• scientific article; zbMATH DE number 1979287 (Why is no real title available?)
• Recovering short secret keys of RLCE in polynomial time

This page was built for publication: Recovering CRT-RSA secret keys from message reduced values with side-channel analysis

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