A comparison of different finite fields for elliptic curve cryptosystems

DOI10.1016/S0898-1221(01)00133-XzbMath0994.94024OpenAlexW1837024946WikidataQ127391381 ScholiaQ127391381MaRDI QIDQ5948821

Nigel P. Smart

Publication date: 12 November 2001

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0898-1221(01)00133-x

zbMATH Keywords

elliptic curvesfinite fieldscryptography

Mathematics Subject Classification ID

Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Cites Work

• A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
• Constructive and destructive facets of Weil descent on elliptic curves
• Modular Multiplication Without Trial Division
• Efficient arithmetic in finite field extensions with application in elliptic curve cryptography.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A comparison of different finite fields for elliptic curve cryptosystems