Efficient arithmetic in finite field extensions with application in elliptic curve cryptography.
From MaRDI portal
Publication:5944106
DOI10.1007/s001450010012zbMath1050.11100MaRDI QIDQ5944106
Christof Paar, Daniel V. Bailey
Publication date: 7 November 2001
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s001450010012
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
94A60: Cryptography
12E20: Finite fields (field-theoretic aspects)
Related Items
Toward Acceleration of RSA Using 3D Graphics Hardware, A comparison of different finite fields for elliptic curve cryptosystems, Complexity of computation in finite fields, An alternative class of irreducible polynomials for optimal extension fields, Efficient software-implementation of finite fields with applications to cryptography, Efficient hardware implementation of finite fields with applications to cryptography, A taxonomy of pairing-friendly elliptic curves, On hardware and software implementation of arithmetic in finite fields of characteristic 7 for calculation of pairings, An Improvement of Optimal Ate Pairing on KSS Curve with Pseudo 12-Sparse Multiplication, An Analysis of Affine Coordinates for Pairing Computation, Optimal Extension Field Inversion in the Frequency Domain, On Software Parallel Implementation of Cryptographic Pairings
