Efficient CRT-RSA decryption for small encryption exponents

DOI10.1007/978-3-642-11925-5_3MaRDI QIDQ5189439zbMATH OpenOpenAlexFDO

Authors Subhamoy Maitra, Santanu Sarkar

Publication date 16 March 2010

Published in Topics in Cryptology - CT-RSA 2010 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-11925-5_3

zbMATH Keywords

CRT-RSAefficient decryptionkey generationRSAsmall encryption exponents

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073
• A New Attack on RSA and CRT-RSA
• Public Key Cryptography - PKC 2006
• Small CRT-Exponent RSA Revisited
• Cryptanalysis of RSA with a small parameter

Cited in

(3)

• Small CRT-exponent RSA revisited
• Small CRT-Exponent RSA Revisited
• Compression-RSA technique: A more efficient encryption-decryption procedure

This page was built for publication: Efficient CRT-RSA decryption for small encryption exponents

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