Abstract
It is well known that if one can factor the modulus R = pq (p, q distinct large primes) of the RSA cryptosystem [4], then the system can be broken. However, it is not known whether the problem of breaking an RSA cryptosystem is equivalent in difficulty to factoring R. Rabin [3] has given a publik-key encryption method which is as difficult to break as it is to factor R, but the decryption process produces four possible candidates for the correct message and only one of these is the correct redundancy (e.g., a cryptographic key) there is no way for the sender to allow the recipient to identify the correct message being transmitted. Also, in [1] Lipton has pointed out some other weaknesses in the scheme when it is used as a cryptosystem. Indeed, Rabin only advocated its use as a signature system.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
R. A. Demillo et al. “On the Safety of Cryptosystems,” Applied Cryptology, Cryptographic Protocols and Computer Security Models, AMS Short Course Lecture Notes, Vol. 29, Providence, 1983.
D. H. Lehmer, Computer technology applied to the theory of numbers, Studies in Number Theory, MAA Studies in Mathematics Vol. 6, 1969, pp. 117–151.
M. O. Rabin, “Digitized signatures and public-key functions as intractable as factorization,” M.I.T. Lab. for Computer Science, Tech. Rep. LCS/TR212, 1979.
R. L. Rivest, A. Shamir, and L. Adelman, “A method for obtaining digital signatures and public-key cryptosystems,” Comm. ACM, 21 (1978), 120–126.
H. C. Williams, “A modification of the RSA public-key encryption procedure,” IEEE Transactions on Information Theory, IT-26 (1980), 726–729.
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
Williams, H.C. (1985). Some Public-Key Crypto-Functions as Intractable as Factorization. In: Blakley, G.R., Chaum, D. (eds) Advances in Cryptology. CRYPTO 1984. Lecture Notes in Computer Science, vol 196. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39568-7_7
Download citation
DOI: https://doi.org/10.1007/3-540-39568-7_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15658-1
Online ISBN: 978-3-540-39568-3
eBook Packages: Springer Book Archive