Sciweavers

13 search results - page 2 / 3
» Weil Descent of Elliptic Curves over Finite Fields of Charac...
Sort
View
IACR
2011
114views more  IACR 2011»
12 years 5 months ago
Faster Scalar Multiplication on Ordinary Weierstrass Elliptic Curves over Fields of Characteristic Three
Abstract. This paper proposes new explicit formulae for the point doubling, tripling and addition on ordinary Weierstrass elliptic curves with a point of order 3 over finite fiel...
Hongfeng Wu, Changan Zhao
ANTS
2004
Springer
121views Algorithms» more  ANTS 2004»
13 years 11 months ago
Function Field Sieve in Characteristic Three
In this paper we investigate the efficiency of the function field sieve to compute discrete logarithms in the finite fields F3n . Motivated by attacks on identity based encrypti...
Robert Granger, Andrew J. Holt, Dan Page, Nigel P....
AAECC
2005
Springer
104views Algorithms» more  AAECC 2005»
13 years 5 months ago
Isomorphism Classes of Picard Curves over Finite Fields
In this paper we determine the number of isomorphism classes of Picard curves, i.e., superelliptic curves y3 = f(x) of genus three, over finite fields of characteristic different f...
Jong Won Lee
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
ENC
2004
IEEE
13 years 9 months ago
On the Hardware Design of an Elliptic Curve Cryptosystem
We present a hardware architecture for an Elliptic Curve Cryptography System performing the three basic cryptographic schemes: DH key generation, encryption and digital signature....
Miguel Morales-Sandoval, Claudia Feregrino Uribe