Abstract
It is well known that the cryptosecurity of the RSA (Rivest-Shamir-Adleman) two key cryptoalgorithm [1] is no better that the composite melulus is difficult to factor. Except for one special case, the converse statement is still an open and extremely important question. It is not so wll known, perhaps, that there are several other crypto-like schemes whose performanc is also bounded by the diffuculty of factoring large numbers: the digital signaure schemes of Ong—Schnorr [2], of Ong-Schrnorr-Shamir [3] and of Schnorr [4], the oblivius transefer of chennel of Rabin [5] and the subliminal channel of Simmons [6] to name only a few. The point is that the difficulty of factoring large integers has become a vital parameter in estimating the security achievable in many secure data schemes -- and conversely factoring techniques are potentially a tool for the cryptanalyst if the cryptographer misjudges the difficulty of factoring a composite number on which he bases a system.
This work performed at Sandia National Laboratories supported by the U. S. Department of Energy under contract No. DE-AC04-76DP00789.
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. Rivest, A. Shamir and L. Adleman, “A Method for Obtaining Digital Signatures and Public-key Cryptosystems,” Commun. ACM 21, 2 (Feb. 1978), 120–126
H. Ong and C. P. Schnorr, “Signatures through Approximate Representations by Quadratic Forms,” Proceedings of Crypto 83, Santa Barbara, CA, August 21–24, 1983, to be published by Plenum Press.
H. Ong, C. P. Schnorr and A. Shamir, “An Efficient Signature Scheme Based on Quadratic Equations,” to appear Proceedings of 16th Symposium on Theory of Computing, Washington D.C., April 1984.
C. P. Schnorr, “A Cubic OSS-Signature Scheme,” private communication, May 1984.
S. Even, O. Goldreich and A. Lempel, “A Randomized Protocol for Signing Contracts,” in Advances in Cryptology, Proceedings of Crypto 82, Ed. by David Chaum, Ronald L. Rivest and Alan T. Sherman, Plenum Press, New York (1983).
G. J. Simmons, “The Prisoners’ Problem and the Subliminal Channel,” Proceedings of Crypto 83, Santa Barbara, CA, August 21–24, 1983, to be published by Plenum Press.
P. D. Merillat, “Secure Stand-Alone Positive Personnel Identity Verification System (SSA-PPIV),” Sandia National Laboratories Tech. Rpt. SAND79-0070 (March 1979).
G. J. Simmons, “A System for Verifying User Identity and Authorization at the Point-of-Sale or Access,” Cryptologia, Vol. 8, No. 1 (January, 1984), pp. 1–21.
G. J. Simmons, “Verification of Treaty Compliance — Revisited,” Proceedings of the 1982 Symposium on Security and Privacy, Oakland, CA (April 25–27, 1983), pp. 61–66.
J. A. Davis and D. B. Holdridge, “Factorization Using the Quadratic Sieve Algorithm,” Sandia National Laboratories Tech. Rpt. SAND83-1346 (Dec. 1983).
J. Brillhart, D. H. Lehmer, J. L. Selfridge, B. Tuckerman and S. S. Wagstaff, Jr., Factorizations of bn ± 1 b = 2, 3, 5, 6, 7, 10, 11, 12 up to High Powers,” AMS Contemporary Mathematics, Vol. 22 (1983).
M. A. Morrison, J. Brillhart, “A Method of Factoring and the Factorization of F7,” Math. Comp. 29 (1975), 183–205.
C. Pomerance, “Analysis and Comparison of Some Integer Factoring Algorithms,” in Number Theory and Computers, Ed. by H. W. Lenstra, Jr., and R. Tijdeman, Math. Centrum Tracts, No. 154, Part I, Amsterdam (1982), pp. 89–139.
R. H. Mendez, “The Japanese Supercomputer Challenge,” SIAM News, Vol. 17, No. 1 (January 1984), pp. 1 and 5.
R. H. Mendez, “Benchmarks on Japanese and American Supercomputers — Preliminary Results,” IEEE Trans. Comp, Vol. C-33, No. 4 (April 1984). pp. 374–375.
D. Parkinson, M. C. Wunderlich, “A Memory Efficient Algorithm for Gaussian Elimination over GF(2) on Parallel Computers,” private communication (Feb. 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
Davis, J.A., Holdridge, D.B., Simmons, G.J. (1985). Status Report on Factoring (At the Sandia National Laboratories). 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_18
Download citation
DOI: https://doi.org/10.1007/3-540-39757-4_18
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