Efficient arithmetic in finite field extensions with application in elliptic curve cryptography.

DOI10.1007/s001450010012zbMath1050.11100OpenAlexW1586812950MaRDI 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

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Finite fields (field-theoretic aspects) (12E20)

Related Items (12)

Efficient software-implementation of finite fields with applications to cryptography ⋮ Efficient hardware implementation of finite fields with applications to cryptography ⋮ Complexity of computation in finite fields ⋮ Optimal Extension Field Inversion in the Frequency Domain ⋮ An Improvement of Optimal Ate Pairing on KSS Curve with Pseudo 12-Sparse Multiplication ⋮ On hardware and software implementation of arithmetic in finite fields of characteristic 7 for calculation of pairings ⋮ An alternative class of irreducible polynomials for optimal extension fields ⋮ A taxonomy of pairing-friendly elliptic curves ⋮ A comparison of different finite fields for elliptic curve cryptosystems ⋮ An Analysis of Affine Coordinates for Pairing Computation ⋮ Toward Acceleration of RSA Using 3D Graphics Hardware ⋮ On Software Parallel Implementation of Cryptographic Pairings

This page was built for publication: Efficient arithmetic in finite field extensions with application in elliptic curve cryptography.