Abstract
This paper surveys computational problems related to integer factorization and the calculation of discrete logarithms in various groups. Its aim is to provide theory sufficient for the derivation of heuristic running time estimates, and at the same time introduce algorithms of practical value.
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.
6. References
L.M. Adleman, A subexponential algorithm for the discrete logarithm problem with applications to cryptography, in Proceedings of the 1980 IEEE Symposium on Foundations of Computer Science, New York: IEEE (1980).
L.M. Adleman and R. McDonnell, An application of higher reciprocity to computational number theory, in Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science, New York: IEEE (1983).
L.M. Adleman, C. Pomerance, and R.S. Rumely, On distinguishing prime numbers from composite numbers, Annals of Mathematics 117 (1983), pp. 173–206.
* L.M. Adleman and K.S. McCurley, Open problems in number theoretic complexity, in Discrete Algorithms and Complexity (Proceedings of the Japan-US Joint Seminar), London: Academic Press (1987).
L.M. Adleman, D.R. Estes, and K.S. McCurley, Solving bivariate quadratic congruences in random polynomial time, Mathematics of Computation 48 (1987), pp. 17–28.
E. Bach, Discrete logarithms and factoring, University of California at Berkeley Computer Science Division Report 84/186 (1984).
E. Bach and J. Shallit, Factoring with cyclotomic polynomials, Mathematics of Computation 52 (1989).
E. Bach, How to generate factored random numbers, SIAM Journal on Computing 17 (1988), pp. 179–193.
E.R. Berlekamp, Factoring polynomials over finite fields, Bell System Technical Journal 46 (1967), pp. 1853–1859.
B. den Boer, Diffie-Hellman is as strong as discrete log for certain primes, preprint, Centre for Mathematics and Computer Science, Amsterdam (1988).
J. Brillhart, D.H. Lehmer, J.L. Selfridge, B. Tuckerman, and S.S. Wagstaff, Jr., Factorizations of b n±1, b =2,3,5,6,7,10,11,12 up to High Powers, Providence: American Mathematical Society (1983).
N.G. de Bruijn, The asymptotic behavior of a function occurring in the theory of primes, Journal of the Indian Mathematical Society 15 (1951), pp. 25–32.
J. Buchmann and H.C. Williams, A key-exchange system based on imaginary quadratic fields, Journal of Cryptology 1 (1988).
E.R. Canfield, P. Erdös, and C. Pomerance, On a problem of Oppenheim concerning “Factorisatio Numerorum”, Journal of Number Theory 17 (1983), pp. 1–28.
B.-Z. Chor, Two Issues in Public Key Cryptography, Cambridge: MIT Press (1986).
H. Cohen and H.W. Lenstra, Jr., Heuristics on class groups of number fields, in Number Theory (Lecture Notes in Mathematics 1068), Berlin: Springer (1984).
J.D. Cohen and M.J. Fischer, A robust and verifiable cryptographically secure election scheme, in Proceedings of the 26th Annual ACM Symposium on Foundations of Computer Science, New York: IEEE (1985).
G. Collins and R. Loos, The Jacobi symbol algorithm, SIGSAM Bulletin 16 (1982), pp. 12–16.
D. Coppersmith, Fast evaluation of logarithms in fields of characteristic two, IEEE Transactions on Information Theory 30 (1984), pp. 587–594.
D. Coppersmith, A.M. Odlyzko, and R. Schroeppel, Discrete logarithms in GF(p), Algorithmica 1 (1986), pp. 1–15.
Y. Desmedt and A.M. Odlyzko, A chosen text attack on the RSA cryptosystem and some discrete logarithm schemes, in Proceedings of CRYPTO’ 85 (Lecture Notes in Computer Science 218), Berlin: Springer (1986).
W. Diffie and M. Hellman, New directions in cryptography, IEEE Transactions on Information Theory 22 (1978), pp. 644–654.
T. ElGamal, On computing logarithms over finite fields, in Proceedings of CRYPTO’ 85 (Lecture Notes in Computer Science 218), Berlin: Springer (1986).
S. Goldwasser and S. Micali, Probabilistic encryption, Journal of Computer and System Sciences 28 (1984), pp. 270–299.
* R.K. Guy, How to factor a number, in Proceedings of the Fifth Manitoba Conference on Numerical Mathematics (1976).
D.G. Hazlewood, On ideals having only small prime factors, Rocky Mountain Journal of Mathematics 7 (1977), pp. 753–768.
N. Koblitz, Elliptic curve cryptosystems, Mathematics of Computation 48 (1987), pp. 203–209.
N. Koblitz, A family of Jacobians suitable for discrete log cryptosystems, Proceedings of CRYPTO’ 88, Berlin: Springer (1989).
S. Landau, Some remarks on computing the square parts of integers, Information and Computation 78 (1988), pp. 246–253.
A.K. Lenstra, Fast and rigorous factorization under the generalized Riemann hypothesis, University of Chicago Computer Science Department Report 87-007 (1987) [to appear, Indagationes Mathematicae].
* A.K. Lenstra and H.W. Lenstra, Jr., Algorithms in number theory, to appear in Handbook of Theoretical Computer Science, Amsterdam: North-Holland.
A.K. Lenstra and M. Manasse, 100 digit factorization, announcement (1988).
H.W. Lenstra, Jr., Factoring integers with elliptic curves, Annals of Mathematics 126 (1987), pp. 649–673
J. van de Lune and E. Wattel, On the numerical solution of a differential-difference equation arising in analytic number theory, Mathematics of Computation 23 (1969), pp. 417–421.
K.S. McCurley, A key distribution system equivalent to factoring, preprint, IBM Almaden Research Center (1987).
K.S. McCurley, Cryptographic key distribution and computation in class groups, to appear in Proceedings of the NATO Advanced Study Institute on Number Theory and Applications (Banff, May 1988), Dordrecht: Reidel. [Available as IBM Almaden Research Center Technical Report #6433.]
G.L. Miller, Riemann’s hypothesis and tests for primality, Journal of Computer and System Sciences 13 (1976), pp. 300–317.
V. Miller, Use of elliptic curves in cryptography, in Proceedings of CRYPTO’ 85 (Lecture Notes in Computer Science 218), Berlin: Springer (1986).
P.L. Montgomery, Speeding the Pollard and elliptic curve methods of factoring, Mathematics of Computation 48 (1987), pp. 243–264.
F. Morain, Implementation of the Goldwasser-Kilian-Atkin primality testing algorithm, University of Limoges / INRIA Report (1988).
M.A. Morrison and J. Brillhart, A method of factoring and the factorization of F 7, Mathematics of Computation 29 (1975), pp. 183–205.
J.M. Pollard, Theorems on factorization and primality testing, Proceedings of the Cambridge Philosophical Society 76 (1974), pp. 521–528.
J.M. Pollard, Monte Carlo methods for index computation (mod p), Mathematics of Computation 32 (1978), pp. 918–924.
J.M. Pollard and C.-P. Schnorr, An efficient solution of the congruence x 2+ky 2≡m (mod n). IEEE Transactions on Information Theory IT-33 (1987), pp. 702–709.
S. Pohlig and M. Hellman, An improved algorithm for computing logarithms over GF(p) and its cryptographic significance, IEEE Transactions on Information Theory 24 (1978), pp. 106–110.
* C. Pomerance, Analysis and comparison of some integer factoring algorithms, in Computational Methods in Number Theory (v. 1), edited by H.W. Lenstra, Jr., and R. Tijdeman, Amsterdam Mathematical Centre Tract #154 (1982).
C. Pomerance, The quadratic sieve factoring algorithm, in Proceedings of EUROCRYPT 84 (Lecture Notes in Computer Science 209) Berlin: Springer (1985).
C. Pomerance, Fast rigorous factorization and discrete logarithm algorithms, in Discrete Algorithms and Complexity, Proceedings of the Japan-US Joint Seminar, London: Academic Press (1987).
* A.M. Odlyzko, Discrete logarithms and their cryptographic significance, Proceedings of EUROCRYPT’ 84 (Lecture Notes in Computer Science 209), Berlin: Springer (1985).
M.O. Rabin, Digitalized signatures and public-key functions as intractable as factorization, MIT Laboratory for Computer Science Report TR-212 (1979).
M.O. Rabin, Probabilistic algorithm for testing primality, Journal of Number Theory 12 (1980), pp. 128–138.
H. te Riele, W. Lioen and Dik Winter, New factorization records, announcement (1988).
R. Rivest, A. Shamir, and L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM 21 (1978), pp. 120–126.
D. Shanks, Class number, a theory of factorization, and genera, in Proceedings of Symposia in Pure Mathematics 20, Providence: American Mathematical Society (1971).
C. Schnorr and H.W. Lenstra, Jr., A Monte Carlo factoring algorithm with linear storage, Mathematics of Computation 43 (1984), pp. 289–311.
R. Schoof, Quadratic fields and factorization, in Computational Methods in Number Theory (v. 2), edited by H.W. Lenstra, Jr., and R. Tijdeman, Amsterdam Mathematical Centre Tract #155 (1982).
R. Schoof, Elliptic curves over finite fields and the computation of square roots mod p, Mathematics of Computation 44 (1985), pp. 483–494.
J. Shallit and A. Shamir, Number-theoretic functions which are equivalent to number of divisors, Information Processing Letters 20 (1985), pp. 151–153.
Z. Shmuely, Composite Diffie-Hellman public-key systems are hard to break, Technion Computer Science Department Report 356 (1985).
R.D. Silverman, The multiple polynomial quadratic sieve, Mathematics of Computation 48 (1987), pp. 329–339.
B. Vallée, Quasi-uniform algorithms for finding small quadratic residues and application to integer factorisation, preprint, Université de Caen (1988) [Presented at 1988 AMS Computational Number Theory Conference].
V. Varadharajan, Trapdoor rings and their use in cryptosystems, in Proceedings of CRYPTO’ 85 (Lecture Notes in Computer Science 218), Berlin: Springer (1986).
D.H. Wiedemann, Solving sparse linear equations over finite fields, IEEE Transactions on Information Thery 32 (1986), pp. 54–62.
H.C. Williams, A p+I method of factoring, Mathematics of Computation 39 (1982), pp. 225–234.
H.C. Williams, An M 3 public-key encryption scheme, in Proceedings of CRYPTO’ 85 (Lecture Notes in Computer Science 218), Berlin: Springer (1986).
* H. Woll, Reductions among number-theoretic problems, Information and Computation 72 (1987), pp. 167–169.
M. Wunderlich, Implementing the continued fraction factoring algorithm on parallel machines, Mathematics of Computation 44 (1985), pp. 251–260.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bach, E. (1990). Intractable Problems in Number Theory. In: Goldwasser, S. (eds) Advances in Cryptology — CRYPTO’ 88. CRYPTO 1988. Lecture Notes in Computer Science, vol 403. Springer, New York, NY. https://doi.org/10.1007/0-387-34799-2_7
Download citation
DOI: https://doi.org/10.1007/0-387-34799-2_7
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-97196-4
Online ISBN: 978-0-387-34799-8
eBook Packages: Springer Book Archive