Skip to main content
SpringerLink
Log in

Signature Calculus and Discrete Logarithm Problems

  • Conference paper
Algorithmic Number Theory (ANTS 2006)

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

Included in the following conference series:

Abstract

Index calculus has been successful in many cases for treating the discrete logarithm problem for the multiplicative group of a finite field, but less so for elliptic curves over a finite field. In this paper we seek to explain why this might be the case from the perspective of arithmetic duality and propose a unified method for treating both problems which we call signature calculus.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Frey, G.: Applications of arithmetical geometry to cryptographic constructions. In: Proceedings of the Fifth International Conference on Finite Fields and Applications, pp. 128–161. Springer, Heidelberg (1999); Preprint also available at: http://www.exp-math.uni-essen.de/zahlentheorie/preprints/Index.html

  2. Frey, G., Rück, H.-G.: A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves. Mathematics of Computation 62(206), 865–874 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  3. Huang, M.-D., Kueh, K.L., Tan, K.-S.: Lifting elliptic curves and solving the elliptic curve discrete logarithm problem. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol. 1838, Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  4. Huang, M.-D., Raskind, W.: Global duality and the discrete logarithm problem (preprint, 2006), http://www-rcf.usc.edu/~mdhuang/papers.html

  5. Huang, M.-D., Raskind, W.: Signature calculus and the the discrete logarithm problem for the multiplicative group case (preprint, 2006), http://www-rcf.usc.edu/~mdhuang/papers.html

  6. Huang, M.-D., Raskind, W.: Signature calculus and the discrete logarithm problem for elliptic curves (preprint, 2006)

    Google Scholar 

  7. Jacobson, M.J., Koblitz, N., Silverman, J.H., Stein, A., Teske, E.: Analysis of the Xedni calculus attack. Design, Codes and Cryptography 20, 41–64 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  8. Koblitz, N.: Elliptic curve cryptosystems. Mathematics of Computation 48, 203–209 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  9. Koblitz, N., Menezes, A., Vanstone, S.: The state of elliptic curve cryptography. Design, Codes and Cryptography 19, 173–193 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  10. Mazur, B.: Notes on the étale cohomology of number fields. Ann. Sci. École Normale Supérieure 6, 521–556 (1973)

    MATH  MathSciNet  Google Scholar 

  11. McCurley, K.: The discrete logarithm problem. In: Pomerance, C. (ed.) Cryptology and Computational Number Theory. Proceedings of Symposia in Applied Mathematics, vol. 42, pp. 49–74 (1990)

    Google Scholar 

  12. Miller, V.: Uses of elliptic curves in cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 417–426. Springer, Heidelberg (1986)

    Google Scholar 

  13. Milne, J.S.: Étale Cohomology. Princeton Mathematical Series, vol. 33. Princeton University Press, Princeton (1980)

    MATH  Google Scholar 

  14. Milne, J.S.: Arithmetic Duality Theorems. Perspectives in Mathematics, vol. 1. Academic Press, London (1986)

    MATH  Google Scholar 

  15. Nguyen, K.: Thesis, Universität Essen (2001)

    Google Scholar 

  16. Serre, J.-P.: Local Fields. Graduate Texts in Mathematics, vol. 67. Springer, Heidelberg (1979)

    MATH  Google Scholar 

  17. Schoof, R.: Counting points on elliptic curves over finite fields. Journal de Théorie des Nombres de Bordeaux 7, 219–254 (1995)

    MATH  MathSciNet  Google Scholar 

  18. Schirokauer, O., Weber, D., Denny, T.: Discrete logarithms: The effectiveness of the index calculus method. In: Cohen, H. (ed.) ANTS 1996. LNCS, vol. 1122. Springer, Heidelberg (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Southern California, Los Angeles, CA, 90089-0781, USA

    Ming-Deh Huang

  2. Department of Mathematics, University of Southern California, Los Angeles, CA, 90089-2532, USA

    Wayne Raskind

Authors
  1. Ming-Deh Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wayne Raskind
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Technische Universität Berlin, Germany

    Florian Hess

  2. Institut für Mathematik, MA 8–1, Technische Universität Berlin, Straße des 17. Juni 136, 10623, Berlin, Germany

    Sebastian Pauli

  3. Institut für Mathematik, Technische Universität Berlin, Fakultät II, MA 8-1, Strasse des 17. Juni 136, 10623, Berlin, Germany

    Michael Pohst

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Huang, MD., Raskind, W. (2006). Signature Calculus and Discrete Logarithm Problems. In: Hess, F., Pauli, S., Pohst, M. (eds) Algorithmic Number Theory. ANTS 2006. Lecture Notes in Computer Science, vol 4076. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11792086_39

Download citation

  • DOI: https://doi.org/10.1007/11792086_39

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation