Search

Search Results

1. Faster Explicit Formulas for Computing Pairings over Ordinary Curves

   We describe efficient formulas for computing pairings on ordinary elliptic curves over prime fields. First, we generalize lazy reduction techniques,...

   Diego F. Aranha, Koray Karabina, ... Julio López in Advances in Cryptology – EUROCRYPT 2011

   Conference paper 2011
   

2. Efficient GF(p m ) Arithmetic Architectures for Cryptographic Applications

   Recently, there has been a lot of interest on cryptographic applications based on fields GF(p m...

   Guido Bertoni, Jorge Guajardo, ... Thomas Wollinger in Topics in Cryptology — CT-RSA 2003

   Conference paper 2003
   

3. Efficient Arithmetic in Finite Field Extensions with Application in Elliptic Curve Cryptography

   This contribution focuses on a class of Galois field used to achieve fast finite field arithmetic which we call an Optimal Extension Field (OEF),...

   Daniel V. Bailey, Christof Paar in Journal of Cryptology

   Article 01 June 2001

4. Optimal extension fields for fast arithmetic in public-key algorithms

   This contribution introduces a class of Galois field used to achieve fast finite field arithmetic which we call an Optimal Extension Field (OEF)....

   Daniel V. Bailey, Christof Paar in Advances in Cryptology — CRYPTO '98

   Conference paper 1998
   

5. Main Routines

   Bruce W. Char, Keith O. Geddes, ... Stephen M. Watt in Maple V Library Reference Manual

   Chapter 1991