Advertisement

Combinatorics, Probability, and Information Theory

  • Jeffrey Hoffstein
  • Jill Pipher
  • Joseph H. Silverman
Chapter
Part of the Undergraduate Texts in Mathematics book series (UTM)

Abstract

In considering the usefulness and practicality of a cryptographic system, it is necessary to measure its resistance to various forms of attack. Such attacks include simple brute-force searches through the key or message space, somewhat faster searches via collision or meet-in-the-middle algorithms, and more sophisticated methods that are used to compute discrete logarithms, factor integers, and find short vectors in lattices.

References

  1. [1]
    M. Agrawal, N. Kayal, N. Saxena, PRIMES is in P. Ann. Math. (2) 160(2), 781–793 (2004)Google Scholar
  2. [4]
    M. Ajtai, C. Dwork, A public-key cryptosystem with worst-case/average-case equivalence, in STOC ’97, El Paso (ACM, New York, 1999), pp. 284–293 (electronic)Google Scholar
  3. [23]
    R.P. Brent, An improved Monte Carlo factorization algorithm. BIT 20(2), 176–184 (1980)MathSciNetCrossRefzbMATHGoogle Scholar
  4. [28]
    H. Cohen, A Course in Computational Algebraic Number Theory. Volume 138 of Graduate Texts in Mathematics (Springer, Berlin, 1993)Google Scholar
  5. [30]
    S.A. Cook, The complexity of theorem-proving procedures, in STOC ’71: Proceedings of the Third Annual ACM Symposium on Theory of Computing, Shaker Heights (ACM, New York, 1971), pp. 151–158Google Scholar
  6. [46]
    M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. A Series of Books in the Mathematical Sciences (W. H. Freeman, San Francisco, 1979)Google Scholar
  7. [51]
    G.R. Grimmett, D.R. Stirzaker, Probability and Random Processes, 3rd edn. (Oxford University Press, New York, 2001)Google Scholar
  8. [60]
    E.T. Jaynes, Information theory and statistical mechanics. Phys. Rev. (2) 106, 620–630 (1957)Google Scholar
  9. [63]
    D. Kahn, The Codebreakers: The Story of Secret Writing (Scribner Book, New York, 1996)Google Scholar
  10. [90]
    P.L. Montgomery, Speeding the Pollard and elliptic curve methods of factorization. Math. Comput. 48(177), 243–264 (1987)CrossRefzbMATHGoogle Scholar
  11. [97]
    NIST–DES, Data Encryption Standard (DES). FIPS Publication 46-3, National Institue of Standards and Technology, 1999. http://csrc.nist.gov/publications/fips/fips46-3/fips46-3.pdf
  12. [104]
    J.M. Pollard, Monte Carlo methods for index computation (mod p). Math. Comput. 32(143), 918–924 (1978)MathSciNetzbMATHGoogle Scholar
  13. [106]
    E.L. Post, A variant of a recursively unsolvable problem. Bull. Am. Math. Soc. 52, 264–268 (1946)MathSciNetCrossRefzbMATHGoogle Scholar
  14. [112]
    S. Ross, A First Course in Probability, 9th edn. (Pearson, England 2001)Google Scholar
  15. [126]
    C.E. Shannon, A mathematical theory of communication. Bell Syst. Tech. J. 27, 379–423, 623–656 (1948)MathSciNetCrossRefGoogle Scholar
  16. [127]
    C.E. Shannon, Communication theory of secrecy systems. Bell Syst. Tech. J. 28, 656–715 (1949)MathSciNetCrossRefzbMATHGoogle Scholar
  17. [130]
    V. Shoup, Lower bounds for discrete logarithms and related problems, in Advances in Cryptology—EUROCRYPT ’97, Konstanz. Volume 1233 of Lecture Notes in Computer Science (Springer, Berlin, 1997), pp. 256–266Google Scholar
  18. [143]
    J. Talbot, D. Welsh, Complexity and Cryptography: An Introduction (Cambridge University Press, Cambridge, 2006)CrossRefGoogle Scholar
  19. [144]
    E. Teske, Speeding up Pollard’s rho method for computing discrete logarithms, in Algorithmic Number Theory, Portland, 1998. Volume 1423 of Lecture Notes in Computer Science (Springer, Berlin, 1998), pp. 541–554Google Scholar
  20. [145]
    E. Teske, Square-root algorithms for the discrete logarithm problem (a survey), in Public-Key Cryptography and Computational Number Theory, Warsaw, 2000 (de Gruyter, Berlin, 2001), pp. 283–301Google Scholar

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  • Jeffrey Hoffstein
    • 1
  • Jill Pipher
    • 1
  • Joseph H. Silverman
    • 1
  1. 1.Department of MathematicsBrown UniversityProvidenceUSA

Personalised recommendations