Sciweavers

9 search results - page 2 / 2
» Modular Counting of Rational Points over Finite Fields
Sort
View
MOC
2000
78views more  MOC 2000»
13 years 5 months ago
Tables of curves with many points
These tables record results on curves with many points over finite fields. For relatively small genus (0 g 50) and q a small power of 2 or 3 we give in two tables the best presen...
Gerard van der Geer, Marcel van der Vlugt
AAECC
2002
Springer
126views Algorithms» more  AAECC 2002»
13 years 5 months ago
Toric Varieties Hirzebruch Surfaces and Error-Correcting Codes
Abstract. For any integral convex polytope in R2 there is an explicit construction of an error-correcting code of length (q - 1)2 over the finite field Fq, obtained by evaluation o...
Johan P. Hansen
ANTS
1998
Springer
123views Algorithms» more  ANTS 1998»
13 years 9 months ago
Primality Proving Using Elliptic Curves: An Update
In 1986, following the work of Schoof on counting points on elliptic curves over finite fields, new algorithms for primality proving emerged, due to Goldwasser and Kilian on the on...
François Morain
ALGORITHMICA
2006
149views more  ALGORITHMICA 2006»
13 years 5 months ago
Partial Lifting and the Elliptic Curve Discrete Logarithm Problem
It has been suggested that a major obstacle in finding an index calculus attack on the elliptic curve discrete logarithm problem lies in the difficulty of lifting points from ellip...
Qi Cheng, Ming-Deh A. Huang