Computing Roots of Polynomials over Function Fields of Curves

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


Published in:
Coding Theory and Cryptography: from Enigma and Geheimschreiber to Quantum Theory, 180-201
Year:
1999
Publisher:
Springer
Keywords:
Laboratories:




 Record created 2007-01-26, last modified 2018-03-17

External link:
Download fulltext
URL
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)