1400 search results - page 7 / 280 » On multiplication in finite fields |
ANTS
2008
Springer
13 years 9 months ago
2008
Springer
Let K be a p-adic local field and E an elliptic curve defined over K. The component group of E is the group E(K)/E0(K), where E0(K) denotes the subgroup of points of good reduction...
JOC
2006
13 years 7 months ago
2006
Motivated by the needs of the pairing based cryptography, Miyaji, Nakabayashi and Takano have suggested a construction of so-called MNT elliptic curves with low embedding degree. ...
ASIACRYPT
2006
Springer
13 years 11 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...
DCC
2000
IEEE
13 years 7 months ago
2000
IEEE
It has become increasingly common to implement discrete-logarithm based public-key protocols on elliptic curves over finite fields. The basic operation is scalar multiplication: ta...
MOC
2000
13 years 7 months ago
2000
We describe an adaptation of the number field sieve to the problem of computing logarithms in a finite field. We conjecture that the running time of the algorithm, when restricted ...