Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 2007: Mathematical Foundations of Computer Science 2007 pp 333–345Cite as

Public Key Identification Based on the Equivalence of Quadratic Forms

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4708))

Abstract

The computational equivalence problem for quadratic forms is shown to be NP-hard under randomized reductions, in particular for indefinite, ternary quadratic forms with integer coefficients. This result is conditional on a variant of the Cohen-Lenstra heuristics on class numbers. Our identification scheme proves knowledge of an equivalence transform.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agrawal, M., Kayal, N., Saxena, N.: PRIMES is in P. Annals of Mathematics 1602, 781–793 (2004)

    Article  MathSciNet  Google Scholar 

  2. Ajtai, M., Dwork, C.: A public-key cryptosystem with worst-case/average-case equivalence. In: Proceedings of the 29th annual ACM symposium on theory of computing, El Paso, TX, USA, May 4-6, New York, pp. 284–293 (Association for Computing Machinery 1997)

    Google Scholar 

  3. Cassels, J.W.S.: Rational quadratic forms. London Mathematical Society Monographs, vol. 13. Academic Press, London (1978)

    MATH  Google Scholar 

  4. Cohen, H.: Course in computational algebraic number theory. Graduate Texts in Mathematics, vol. 138. Springer, Heidelberg (1993)

    MATH  Google Scholar 

  5. Cohen, H., Lenstra jun, H.W.: Heuristics on class groups of number fields, Number Theory. In: Queinnec, C., Halstead Jr., R.H., Ito, T. (eds.) PSLS 1995. LNCS, vol. 1068, Springer, Heidelberg (1996)

    Google Scholar 

  6. Cohen, H., Martinet, J.: Class groups of number fields: Numerical heuristics. Mathematics of Computation 48(177), 123–137 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  7. Heuristics on class groups: Some good primes are no too good, Mathematics of Computation 63(207), 329–334 (1994)

    Google Scholar 

  8. Dietmann, R.: Small solutions of quadratic Diophantine equations. Proceedings of the London Mathematical Society, III. Ser. 86(3), 545–582 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  9. Erdős, P., Nicolas, J.-L.: Sur la fonction: Nombre de facteurs premiers de n. EnsMath2 27, 3–27 (1981)

    Google Scholar 

  10. Fouvry, É., Klüners, J.: On the 4-rank of class groups of quadratic number fields (2006) (preprint)

    Google Scholar 

  11. Gauß, C.F.: Untersuchungen über höhere Arithmetik (Disquisitiones Arithmeticae). Springer, Heidelberg (1889) (German translation by H. Maser)

    MATH  Google Scholar 

  12. Goldreich, O., Goldwasser, S., Halevi, S.: Public-key cryptosystems from lattice reduction problems. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 112–131. Springer, Heidelberg (1997)

    Google Scholar 

  13. Hoffstein, J., Howgrave-Graham, N., Pipher, J., Silverman, J.H., Whyte, W.: NTRUSign: Digital signatures using the NTRU lattice, Topics in cryptology – CT-RSA 2003. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol. 2612, pp. 122–140. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  14. Hoffstein, J., Pipher, J., Silverman, J.H.: A ring-based public key cryptosystem. In: Buhler, J.P. (ed.) Algorithmic number theory. 3rd international symposium, ANTS-III, LNCS, vol. 1423, pp. 267–288. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  15. Pfitzmann, B. (ed.): EUROCRYPT 2001. LNCS, vol. 2045, pp. 211–228. Springer, Heidelberg (2001)

    MATH  Google Scholar 

  16. Gerth III, F.: The 4-class ranks of quadratic fields. Inventiones Mathematicae 77(3), 489–515 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  17. Gerth III, F.: Extension of conjectures of Cohen and Lenstra. Expositiones Mathematicae 5(2), 181–184 (1987)

    MATH  MathSciNet  Google Scholar 

  18. Ivanyos, G., Szánto, Á.: Lattice basis reduction for indefinite forms and an application. Journal on Discrete Mathematics 153(1–3), 177–188 (1996)

    Article  MATH  Google Scholar 

  19. Lenstra jun, H.W., Lenstra, A.K., Lovász, L.: Factoring polynomials with rational coefficients. Mathematische Annalen 261, 515–534 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  20. Khot, S.: Hardness of approximating the shortest vector problem in lattices. Journal of the ACM 52(5), 789–808 (2005)

    Article  MathSciNet  Google Scholar 

  21. Manders, K.L., Adleman, L.M.: NP-complete decision problems for binary quadratics. Journal of Computer and System Sciences 16, 168–184 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  22. Micciancio, D., Goldwasser, S.: Complexity of lattice problems: a cryptographic perspective. In: The Kluwer International Series in Engineering and Computer Science, Boston, Massachusetts, March 2002, vol. 671, Kluwer Academic Publishers, Dordrecht (2002)

    Google Scholar 

  23. Mitrinović, D.S., Sándor, J., Crstici, B. (eds.): Handbook of number theory. Mathematics and Its Applications, vol. 351. Kluwer Academic Publishers, Dordrecht (1996)

    Google Scholar 

  24. O’Meara, O.T.: Introduction to quadratic forms. Grundlehren der mathematischen Wissenschaften, vol. 117. Springer, Heidelberg (1963) (reprinted in 2000)

    MATH  Google Scholar 

  25. Schnorr, C.-P.: Progress on LLL and lattice reduction. In: Proceedings LLL+25, June 29–July 1, 2007, Caen, France (to appear, 2007)

    Google Scholar 

  26. Simon, D.: Solving quadratic equations using reduced unimodular quadratic forms. Mathematics of Computation 74(251), 1531–1543 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  27. Tennenhouse, M., Williams, H.C.: A note on the class-number one in certain real quadratic and pure cubic fields. Mathematics of Computation 46(173), 333–336 (1986)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Johann Wolfgang Goethe Universität Frankfurt a. M., Postfach 11 19 32; Fach 238, 60054 Frankfurt a. M., Germany

    Rupert J. Hartung & Claus-Peter Schnorr

Authors
  1. Rupert J. Hartung
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Claus-Peter Schnorr
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Luděk Kučera Antonín Kučera

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hartung, R.J., Schnorr, CP. (2007). Public Key Identification Based on the Equivalence of Quadratic Forms. In: Kučera, L., Kučera, A. (eds) Mathematical Foundations of Computer Science 2007. MFCS 2007. Lecture Notes in Computer Science, vol 4708. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74456-6_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74456-6_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74455-9

  • Online ISBN: 978-3-540-74456-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation