Skip to main content
SpringerLink
Log in

Counting Prime Divisors on Elliptic Curves and Multiplication in Finite Fields

  • Conference paper
Coding Theory and Cryptography

Abstract

Let K/F q be an elliptic function field. For every natural number n we determine the number of prime divisors of degree n of K/F q which lie in a given divisor class of K.

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. T.M. Apostol. Introduction to Analytic Number Theory. Undergraduate Texts in Mathematics. Springer Verlag, 1979.

    Google Scholar 

  2. U. Baum and M.A. Shokrollahi. An optimal algorithm for multiplication in FF256 /F4. AAECC, 2: 15–20, 1991.

    Article  MathSciNet  MATH  Google Scholar 

  3. P. Bürgisser, M. Clausen, and M.A. Shokrollahi. Algebraic Complexity Theory, volume 315 of Grundlehren der Mathematischen Wissenschaften. Springer Verlag, Heidelberg, 1996.

    Google Scholar 

  4. D.V. Chudnovsky and G.V. Chudnovsky. Algebraic complexity and algebraic curves over finite fields. J. Compl., 4: 285–316, 1988.

    Article  MathSciNet  MATH  Google Scholar 

  5. M. Deuring. Lectures on the Theory of Algebraic Functions of One Variable, volume 314 of Lecture Notes in Mathematics. Springer Verlag, 1973.

    MATH  Google Scholar 

  6. H. Hasse. Vorlesungen über Klassenkörpertheorie. Physica-Verlag, Würzburg, 1967.

    MATH  Google Scholar 

  7. D.E. Knuth. The Art of Computer Programming, volume 2: semi-numerical algorithms. Addison-Wesley, 1981.

    MATH  Google Scholar 

  8. H. G. Rück. A note on elliptic curves over finite fields. Math. Comp., 49: 30 1304, 1987.

    Google Scholar 

  9. M.A. Shokrollahi. Efficient randomized generation of algorithms for multiplication in certain finite fields. Comp. Compl., 2: 67–96, 1992.

    Article  MathSciNet  MATH  Google Scholar 

  10. M.A. Shokrollahi. Optimal algorithms for multiplication in certain finite fields using elliptic curves. SIAM J. Comp., 21: 1193–1198, 1992.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Bell Labs, Rm. 2C-353, 700 Mountain Ave, Murray Hill, NJ, 07974, USA

    M. Amin Shokrollahi

Authors
  1. M. Amin Shokrollahi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics, US Naval Academy, 572C Holloway Dr., 21402, Annapolis, MD, USA

    David Joyner

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shokrollahi, M.A. (2000). Counting Prime Divisors on Elliptic Curves and Multiplication in Finite Fields. In: Joyner, D. (eds) Coding Theory and Cryptography. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-59663-6_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-59663-6_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66336-2

  • Online ISBN: 978-3-642-59663-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation