Software implementation of the NIST elliptic curves over prime fields

DOI10.1007/3-540-45353-9_19MaRDI QIDQ2724445zbMATH OpenFDO

Authors Darrel Hankerson, Julio López, Alfred Menezes, Michael Brown

Publication date 10 September 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45353-9_19

zbMATH Keywords

NIST-recommended elliptic curves over prime fields

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Software implementation of elliptic curve cryptography over binary fields
• A practical implementation of elliptic curve cryptosystems over GF(p) on a 16-bit microcomputer
• Fast implementation of elliptic curve arithmetic in GF(p^n)
• scientific article; zbMATH DE number 4191556
• Elliptic curve cryptosystems and their implementation

Cited in

(10)

• Fast elliptic curve point multiplication based on binary and binary non-adjacent scalar form methods
• Fast cryptography in genus 2
• Improving smart card security using elliptic curve cryptography over prime field \((F_{p})\)
• Improved precomputation scheme for scalar multiplication on elliptic curves
• An efficient method against side-channel attacks on ECC
• Fast Point Decompression for Standard Elliptic Curves
• Software implementation of elliptic curve cryptography over binary fields
• Generalised Mersenne numbers revisited
• New Composite Operations and Precomputation Scheme for Elliptic Curve Cryptosystems over Prime Fields
• Efficient software-implementation of finite fields with applications to cryptography

This page was built for publication: Software implementation of the NIST elliptic curves over prime fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2724445)