FFA
2011
13 years 1 months ago
2011
ABSTRACT. We prove the rationality of the generating function associated to the number of equivalence classes of Fqk -points of a constructible equivalence relation defined over t...
LATINCRYPT
2010
13 years 5 months ago
2010
Let E be a non-supersingular elliptic curve over a finite field Fq. At CRYPTO 2009, Icart introduced a deterministic function Fq → E(Fq) which can be computed efficiently, and ...
MOC
1998
13 years 6 months ago
1998
Abstract. Schoof’s algorithm computes the number m of points on an elliptic curve E defined over a finite field Fq. Schoof determines m modulo small primes using the character...
ASIACRYPT
2001
Springer
13 years 11 months ago
2001
Springer
We present an algorithm for counting points on superelliptic curves yr = f(x) over a finite field Fq of small characteristic different from r. This is an extension of an algorit...
ANTS
2004
Springer
14 years 6 days ago
2004
Springer
We present a non-archimedean method to construct, given an integer N ≥ 1, a finite field Fq and an elliptic curve E/Fq such that E(Fq) has order N.
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
— Recently an algebraic construction of (nt × Q) space-frequency (SF) codes over finite field Fq was proposed for use in MIMO-OFDM systems, where nt is the number of transmit ...
FOCS
2008
IEEE
14 years 1 months ago
2008
IEEE
We give an algorithm for modular composition of degree n univariate polynomials over a finite field Fq requiring n1+o(1) log1+o(1) q bit operations; this had earlier been achiev...