Abstract
It is well known that the RSA public-key cryptosystem can be broken if the composite modulus can be factored. It is nor known, however, whether the problem of breaking any RSA system is equivalent in difficulty to factoring the modulus. In 1979 Rabin [5] introduced a public-key cryptosystem which is as difficult to break as it is to factor a modulus R=p1p2, where p1p2 are two distinct large primes. Esaentially Rabin suggested that the designer of such a scheme first determine p1 and p2, keep them secret and make R public. Anyone wishing to send a secure message H (0 < M < R ) to the designer would encrypt M as K , where
and 0 < K < R, then transmit K to the designer.
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.
Research supported by NSERC of Canada Grant A7649.
Download to read the full chapter text
Chapter PDF
References
R.A. Demillo, G.I. Davida, D.P. Dobkin, M.A. Harrison, and R.J. Lipton, On the Safety of Cryptosystems, Applied Cryptology, Cryptographic Protocols and Computer Security Models, AMS Short Courses Lecture Notes, Vol. 29, Providence, 1983.
Shafi Goldwasser, Silvio Micali, R.L. Rivest, A “paradoxical” solution to the signature problem, Proc. 25th IEEE Symposium on Foundations of Computer Science, to appear.
D.H. Lehmer, Computer technology applied to the theory of numbers, Studies in Number Theory, Math. Assoc. of America, 1969, Theorem 5, p. 133.
H.W. Lenstra, jr., Euclidean number fields I., Math. Intelligencer 2 (1979/80), 6–15.
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.
Rene Schoof, Elliptic curves over finite fields and the computation of square roots mod p, Math. Comp. 44 (1985), 483–494.
D. Shanks, Five number theoretic algorithms, Congressus Numerantium 7 (1973), 51–69.
Peter Wilker, An effecient algorithmic solution of the diophantine equation u 2 + 5v 2 = m, Math. Comp. 35 (1980), 1347–1352.
H.C. Williams and R. Holte, Computation of the solution of x 3 + Dy 3 = 1, Math. Comp. 31 (1977), 778–785.
H.C. Williams, A modification of the RSA public-key enryption 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
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Williams, H.C. (1986). An M3 Public-Key Encryption Scheme. In: Williams, H.C. (eds) Advances in Cryptology — CRYPTO ’85 Proceedings. CRYPTO 1985. Lecture Notes in Computer Science, vol 218. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39799-X_26
Download citation
DOI: https://doi.org/10.1007/3-540-39799-X_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16463-0
Online ISBN: 978-3-540-39799-1
eBook Packages: Springer Book Archive