See this document in CiteSeerX!

Counting Prime Divisors on Elliptic Curves  (Make Corrections)  
and Multiplication in Finite Fields M. Amin Shokrollahi Bell Labs, Rm....



  Home/Search   Context   Related

 
View or download:
usna.edu/~wdj/papers...amin_divisors.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  navy.mil/~wdj/papers/cryptoday (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

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. (Update)

Similar documents (at the sentence level):
65.9%:   Counting Prime Divisors on Elliptic Curves and Multiplication.. - Shokrollahi   (Correct)

Active bibliography (related documents):   More   All
0.3:   Tensor Codes for the Rank Metric - Roth (1995)   (Correct)
0.3:   Decoding Algebraic-Geometric Codes Beyond the.. - Shokrollahi, Wasserman (1998)   (Correct)
0.2:   List Decoding of Algebraic-Geometric Codes - Shokrollahi, Wasserman (1999)   (Correct)

Similar documents based on text:
0.0:   Unknown -   (Correct)

BibTeX entry:   (Update)

@misc{ in-counting,
  author = "And Multiplication In",
  title = "Counting Prime Divisors on Elliptic Curves",
  url = "citeseer.ist.psu.edu/755801.html" }
Citations (may not include all citations):
216   volume 2: semi-numerical algorithms (context) - Knuth, of - 1981
104   Introduction to Analytic Number Theory (context) - Apostol - 1979
17   Lectures on the Theory of Algebraic Functions of One Variabl.. (context) - Deuring - 1973
15   volume 315 of Grundlehren der Mathematischen Wissenschaften (context) - Burgisser, Clausen et al. - 1996
11   A note on elliptic curves over finite fields (context) - Ruck - 1987
4   Efficient randomized generation of algorithms for multiplica.. (context) - Shokrollahi - 1992
3   Algebraic complexity and algebraic curves over finite fields (context) - Chudnovsky, Chudnovsky - 1988
2   Vorlesungen uber Klassenkorpertheorie (context) - Hasse - 1967
2   Optimal algorithms for multiplication in certain finite fiel.. (context) - Shokrollahi - 1992
1   An optimal algorithm for multiplication in F256 =F (context) - Baum, Shokrollahi - 1991

Documents on the same site (http://web.usna.navy.mil/~wdj/papers/cryptoday.html):   More
A Talk on Quantum Cryptography - Or How Alice   (Correct)
Reminiscences and Re ections of a - Codebreaker Peter Hilton   (Correct)
On Cyclic MDS-Codes - Amin Shokrollahi Bell   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC