RSA and Elliptic Curve Least Significant Bit Security

DOI10.1007/978-3-319-16295-9_8zbMath1378.94059MaRDI QIDQ2946472

Dionathan Nakamura, Routo Terada

Publication date: 17 September 2015

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

Full work available at URL: https://doi.org/10.1007/978-3-319-16295-9_8

zbMATH Keywords

RSA; elliptic curve; oracle; Diffie-Hellman; least significant bit; integer factorization; discrete log problem

Mathematics Subject Classification ID

94A60: Cryptography

14H52: Elliptic curves

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the bit security of the weak Diffie-Hellman problem
• Stronger security proofs for RSA and Rabin bits.
• Computational problems associated with Racah algebra
• Systolic VLSI Arrays for Polynomial GCD Computation
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes
• Bits Security of the Elliptic Curve Diffie–Hellman Secret Keys
• Practical Chosen Ciphertext Secure Encryption from Factoring
• Optimal Randomness Extraction from a Diffie-Hellman Element
• A Simple Unpredictable Pseudo-Random Number Generator
• RSA and Rabin Functions: Certain Parts are as Hard as the Whole
• New directions in cryptography
• A method for obtaining digital signatures and public-key cryptosystems
• Selecting cryptographic key sizes