Skip to main content
SpringerLink
Log in

Number theoretic algorithms and cryptology

  • Invited Lectures
  • Conference paper
  • First Online:
Book cover Fundamentals of Computation Theory (FCT 1991)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 529))

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Buchmann, Zur Komplexität der Berechnung von Einheiten und Klassenzahlen algebraischer Zahlkörper, Habilitationsschrift, Düsseldorf 1987.

    Google Scholar 

  2. J. Buchmann A subexponential algorithm for computing class groups and regulators of number fields, erscheint in Seminaire de Theorie des Nombres Paris 1988–1989, 27–41.

    Google Scholar 

  3. J. Buchmann, S. Düllmann, H.C. Williams, On the complexity and efficiency of a new key exchange system, Lecture Notes in Computer Science 434 (1989), 597–616.

    Google Scholar 

  4. J. Buchmann, S. Düllmann, A probabilistic class group and regulator algorithm and its implementation, erscheint in Proceedings of the Colloquium on Number Theory, Debrecen, 1989.

    Google Scholar 

  5. J. Buchmann, S. Düllmann, On the computation of discrete logarithms in class groups, in Proceedings CRYPTO 90.

    Google Scholar 

  6. J. Buchmann, R. Scheidler, H.C. Williams, Implementation of a key exchange protocol using real quadratic fields, Proceedings EUROCRYPT 90 Springer Lecture Notes in Computer Science 473 (1991), 98–109.

    Google Scholar 

  7. J. Buchmann, H.C. Williams, A key exchange system based on imaginary quadratic fields, J. Cryptology 1 (1988), 107–118.

    Google Scholar 

  8. J. Buchmann, H.C. Williams, A key exchange system based on real quadratic fields, Lecture Notes in Computer Science 435 (1989), 335–343.

    Google Scholar 

  9. W. Diffie, M. Hellman, New directions in cryptography, IEEE Trans. Inform. Theory 22 (1976), 472–492.

    Google Scholar 

  10. S. Goldwasser, The search for provably secure crypto systems, Manuscript, 1990.

    Google Scholar 

  11. D. Gordon, Discrete logarithms in GF(p) using the number field sieve, mnuscript, 1990.

    Google Scholar 

  12. N. Koblitz, Elliptic curve cryptosystems, Math. Comp. 48 (1987), 203–209.

    Google Scholar 

  13. A.K. Lenstra, H.W. Lenstra Jr., M. Manasse, J.M. Pollard, The number field sieve, Proceedings STOC 1990, 564–572.

    Google Scholar 

  14. K.S. McCurley, A key distribution system equivalent to factoring.

    Google Scholar 

  15. A. Menezes, T. Okamoto, S. Vanstone, Reducing elliptic curve logarithms to logarithms in a finite field, manuscript 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. FB Informatik, Universität des Saarlandes, Germany

    Johannes Buchmann

Authors
  1. Johannes Buchmann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

L. Budach

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Buchmann, J. (1991). Number theoretic algorithms and cryptology. In: Budach, L. (eds) Fundamentals of Computation Theory. FCT 1991. Lecture Notes in Computer Science, vol 529. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54458-5_45

Download citation

  • DOI: https://doi.org/10.1007/3-540-54458-5_45

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54458-6

  • Online ISBN: 978-3-540-38391-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation