27 search results - page 2 / 6 » Coordinate Blinding over Large Prime Fields |
CRYPTO
1993
Springer
13 years 9 months ago
1993
Springer
Abstract. There are numerous subexponential algorithms for computing discrete logarithms over certain classes of finite fields. However, there appears to be no published subexponen...
CORR
2006
Springer
13 years 5 months ago
2006
Springer
We survey algorithms for computing isogenies between elliptic curves defined over a field of characteristic either 0 or a large prime. We introduce a new algorithm that computes an...
COCO
2008
Springer
13 years 7 months ago
2008
Springer
We study the complexity of deciding whether a given homogeneous multivariate polynomial has a nontrivial root over a finite field. Given a homogeneous algebraic circuit C that com...
ASIACRYPT
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. The complex multiplication (CM) method for genus 2 is currently the most efficient way of generating genus 2 hyperelliptic curves defined over large prime fields and suit...
PAIRING
2007
Springer
13 years 11 months ago
2007
Springer
Let C be a curve of genus g, defined over a finite field Fq, where q = pm for a prime p. Let N be a large integer coprime to p, dividing the order of the Jacobian variety associ...