Abstract
We prove by some novel sampling techniques that the least significant bits of RSA-messages are 0.5 + ε - secure. Any oracle which correctly predicts the k-th least significant message bit for at least a 0.5 + ε - fraction of all messages can be used to decipher all RSA ciphertexts in random polynomial time (more precisely in time \( (\log n)^{0(\varepsilon ^{ - 2} + k)}\)).
February 1984
Chapter PDF
Similar content being viewed by others
References
M. Ben-Or, B. Chor, A. Shamir, On the Cryptographic Security of Single RSA Bits, Proc. STOC 1983, 421–430
L. Blum, M. Blum, M. Snub, A Simple Secure Pseudo-Random Number Generator. Crypto 1982
M. Blum & S. Micali, How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits, Proc. FOCS 1982, 112–117.
S. Goldwasser, S. Micali, P. Tong, Why and How to Establish a Private Code on a Public Network, Proc. FOCS 1982, 134–144.
M. Rabin, Digital Signatures and Public Key Functions as Intractable as Factorization, MIT/LCS/TR-212, Technical Report, MIT, 1979.
A. Renyi, Wahrscheinlichkeitsrechnung VEB Deutscher Verlag der Wissenschaften Berlin 1966.
R. Rivest, A. Shamir & L. Adelman, A Method of Obtaining Digital Signatures and Public Key Cryptosystems, CACM, February 1978.
A. Shamir, On the generation of Cryptographically Strong Pseudo-Random Sequences, 1981 ICALP.
A. Yao, Theory and Applications of Trapdoor Functions, proc. FOCS 1982, 80–91
U. V. and V. V. Vazirani, RSA bits are.732 + ε secure. TR U. Berkeley and Harvard University 1983.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schnorr, C.P., Alexi, W. (1985). RSA-bits are 0.5 + ε secure. In: Beth, T., Cot, N., Ingemarsson, I. (eds) Advances in Cryptology. EUROCRYPT 1984. Lecture Notes in Computer Science, vol 209. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39757-4_12
Download citation
DOI: https://doi.org/10.1007/3-540-39757-4_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16076-2
Online ISBN: 978-3-540-39757-1
eBook Packages: Springer Book Archive