Attacking noisy secret CRT-RSA exponents in binary method

DOI10.1007/978-3-030-12146-4_3MaRDI QIDQ1736031zbMATH OpenOpenAlexFDO

Authors Kento Oonishi, Noboru Kunihiro

Publication date 29 March 2019

Full work available at URL https://doi.org/10.1007/978-3-030-12146-4_3

zbMATH Keywords

error correctionexponentiationside-channel attacksCRT-RSA encryption scheme

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Recovering CRT-RSA secret keys from noisy square-and-multiply sequences in the sliding window method
• Improved CRT-RSA secret key recovery method from sliding window leakage
• Side channel attack to actual cryptanalysis: breaking CRT-RSA with low weight decryption exponents
• Partial key exposure attack on CRT-RSA
• An improved attack for recovering noisy RSA secret keys and its countermeasure

Cited in

(9)

• RSA key recovery from digit equivalence information
• Recovering CRT-RSA secret keys from message reduced values with side-channel analysis
• 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
• Attacking Exponent Blinding in RSA without CRT
• Side channel attack to actual cryptanalysis: breaking CRT-RSA with low weight decryption exponents
• Applied Cryptography and Network Security
• HS-based error correction algorithm for noisy binary GCD side-channel sequences
• Comparison-based attacks against noise-free fully homomorphic encryption schemes

This page was built for publication: Attacking noisy secret CRT-RSA exponents in binary method

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