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

DOI10.1007/978-3-319-13039-2_4zbMATH Open1344.94046OpenAlexW181244537MaRDI QIDQ2945372FDOQ2945372

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

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?

zbMATH Keywords

side-channel analysisexponentiationmodular reductionembedded deviceslong integer arithmetic

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (3)

• Recovering short secret keys of RLCE in polynomial time
• Title not available (Why is that?)
• Thwarting side-channel analysis against RSA cryptosystems with additive blinding

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)