Software implementation of elliptic curve cryptography over binary fields

DOI10.1007/3-540-44499-8_1MaRDI QIDQ4536202zbMATH OpenFDO

Authors Darrel Hankerson, Julio López Hernandez, Alfred Menezes

Publication date 25 June 2002

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

Full work available at URL https://doi.org/10.1007/3-540-44499-8_1

zbMATH Keywords

algorithmselliptic curve cryptographyelliptic curves over binary fieldssoftware implementation

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Symbolic computation and algebraic computation (68W30) Cryptography (94A60)

Recommendations

• Software implementation of the NIST elliptic curves over prime fields
• scientific article; zbMATH DE number 4191556
• Elliptic curve cryptosystems and their implementation
• scientific article; zbMATH DE number 2232692
• A practical implementation of elliptic curve cryptosystems over GF(p) on a 16-bit microcomputer

Cited in

(18)

• Random small Hamming weight products with applications to cryptography
• Koblitz curve cryptosystems
• Software implementation of the NIST elliptic curves over prime fields
• scientific article; zbMATH DE number 1808283 (Why is no real title available?)
• Methods for increasing the resistance of cryptographic designs against horizontal DPA attacks
• Efficient software implementation of binary field arithmetic using vector instruction sets
• Complexity of computation in finite fields
• A practical implementation of elliptic curve cryptosystems over GF(p) on a 16-bit microcomputer
• scientific article; zbMATH DE number 1947427 (Why is no real title available?)
• scientific article; zbMATH DE number 2043312 (Why is no real title available?)
• Elliptic Curve Cryptography: A Software Implementation
• Efficient Software Implementation of Laddering Algorithms Over Binary Elliptic Curves
• Enhanced digital signature using RNS digit exponent representation
• The double-base number system and its application to elliptic curve cryptography
• On the Design and Optimization of a Quantum Polynomial-Time Attack on Elliptic Curve Cryptography
• An extension of TYT algorithm for GF((2ⁿ)^m) using precomputation
• Efficient software-implementation of finite fields with applications to cryptography
• An extension of TYT inversion algorithm in polynomial basis

This page was built for publication: Software implementation of elliptic curve cryptography over binary fields

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