Efficient Arithmetic on Elliptic Curves over Fields of Characteristic Three

  title={Efficient Arithmetic on Elliptic Curves over Fields of Characteristic Three},
  author={Reza Rezaeian Farashahi and Hongfeng Wu and Changan Zhao},
  booktitle={Selected Areas in Cryptography},
This paper presents new explicit formulae for the point doubling, tripling and addition for ordinary Weierstras elliptic curves with a point of order 3 and their equivalent Hessian curves over finite fields of characteristic three. The cost of basic point operations is lower than that of all previously proposed ones. The new doubling, mixed addition and tripling formulae in projective coordinates require 3M + 2C, 8M + 1C + 1D and 4M + 4C + 1D respectively, where M, C and D is the cost of a… 
Twisted Hessian Curves
This paper presents new speed records for arithmetic on a large family of elliptic curves with cofactor 3: specifically, 8.77Mper bit for 256-bit variable-base single-scalar multiplication when curve
Regular Ternary Algorithm for Scalar Multiplication on Elliptic Curves over Finite Fields of Characteristic Three
  • Cholmin Sin
  • Computer Science, Mathematics
    IACR Cryptol. ePrint Arch.
  • 2012
An efficient and regular ternary algorithm for scalar multiplication on elliptic curves over finite fields of characteristic three is proposed and the cost per bit is lower than that of all previous ones.
Elliptic Curve Scalar Multiplication Algorithm Based on Side Channel Atomic Block over GF(2)
This work proposes a new secure and efficient scalar multiplication algorithm on elliptic curves over GF(2) and presents the new composite operation formulas 3P1 and 2P1 + P2 using only xcoordinate, where P1 and P2 are points on an elliptic curve.
Point Multiplication using Integer Sub-Decomposition for Elliptic Curve Cryptography
A new approach called integer sub-decomposition (ISD) based on the GLV idea to compute any multiple kP of a point P of order n lying on an elliptic curve E using two fast endomorphisms ψ1 and ψ2 of E over prime field Fp to calculate kP.
New Parallel Approaches for Scalar Multiplication in Elliptic Curve over Fields of Small Characteristic
A Montgomery-halving algorithm which is a variation of the original Montgomery-ladder for point multiplication and two point thirding formulas in some subfamilies of curves E(F3m) are presented, which are used to implement scalar multiplication through (Third, Double)-and-add and ( third, Triple)- and-add parallel approaches.
An Improved Ternary Montgomery Ladder Algorithm on Elliptic Curves over GF(3^m)
A new scalar multiplication algorithm on elliptic curves over GF(3), which combines original Montgomery ladder algorithm and the ternary representation of the scalar, which makes full use of cubing and can resist Simple Power Attack.
Isogenies on twisted Hessian curves
These explicit formulas for isogenies between elliptic curves in (twisted) Hessian form have the lowest costs for processing the kernel and the X-affine formula has the lowest cost for processing an input point in affine coordinates.
Distance functions on the sets of ordinary elliptic curves in short Weierstrass form over finite fields of characteristic three
It is proved that one can construct distance functions on the set of ordinary elliptic curves in short Weierstrass form over any finite field of characteristic three.
Twisted Hessian Isogenies
This paper derives an explicit formula for isogenies between elliptic curves in (tw) Hessian form and shows some isogeny formulas for (twisted) Edwards, Huff, and Montgomery forms of elliptic curve.
On the distribution of scalar k for elliptic scalar multiplication
In this study, we introduce the probability distribution of the elliptic curve scalar multiplication through finding the probability distribution of the secret key, namely, the scalar k of the scalar


Improved Algorithms for Elliptic Curve Arithmetic in GF(2n)
A new method for doubling an elliptic curve point, which is simpler to implement than the fastest known method, due to Schroeppel, and which favors sparse elliptic Curve coefficients, and a new kind of projective coordinates that provides the fastestknown arithmetic on elliptic curves.
Point Multiplication on Ordinary Elliptic Curves over Fields of Characteristic Three
  • N. Smart, E. J. Westwood
  • Mathematics, Computer Science
    Applicable Algebra in Engineering, Communication and Computing
  • 2003
It is shown that using the Hessian form in characteristic three produces a point multiplication algorithm under 50 percent slower than the equivalent system in characteristic two, suggesting that curves in characteristicThree, could offer greater performance than currently perceived by the community.
Scalar Multiplication on Elliptic Curves Defined over Fields of Small Odd Characteristic
  • C. Nègre
  • Mathematics, Computer Science
  • 2005
This paper establishes formulas multiplying by p a random point on an ordinary curve defined over $\mathbb{F}_{p^{n}}$, thereby improving scalar multiplication on random and special curves for p = 3 or 5 using a p-Multiply-and-Add method.
New Fast Algorithms for Arithmetic on Elliptic Curves over Fields of Characteristic Three
New formulae and algorithms for arithmetic on ordinary elliptic curve with a point of order 3 over finite field of characteristic three are proposed by which the cost of a point multiplication on the curves decreases about 10~20%.
Efficient Arithmetic on Hessian Curves
A generalized form for Hessian curves is considered and it is shown to be equivalent to the family of elliptic curves with a torsion subgroup isomorphic to ℤ/3ℤ.
Elliptic curve cryptosystems
The question of primitive points on an elliptic curve modulo p is discussed, and a theorem on nonsmoothness of the order of the cyclic subgroup generated by a global point is given.
New Formulae for Efficient Elliptic Curve Arithmetic
This paper improves timings for Jacobiquartic and Hessian doubling operations and provides a faster mixed-addition formulae for Jacobi-intersection, Hessian (5M+6S) and Edwards (9M+1S+ 1d+4a) forms.
Handbook of Elliptic and Hyperelliptic Curve Cryptography
The introduction to Public-Key Cryptography explains the development of algorithms for computing Discrete Logarithms and their applications in Pairing-Based Cryptography and its applications in Fast Arithmetic Hardware Smart Cards.
An Elliptic Curve Implementation of the Finite Field Digital Signature Algorithm
A supersingular implementation of the Elliptic Curve Digital Signature Algorithm (ECDSA) is constructed that is essentially equivalent to a finite field implemented version of the DSA, and the efficiency of the two systems is compared.
Elliptic curves in cryptography
This book summarizes knowledge built up within Hewlett-Packard over a number of years, and explains the mathematics behind practical implementations of elliptic curve systems, to help engineers and computer scientists wishing (or needing) to actually implement such systems.