Analyzing the Galbraith-Lin-Scott Point Multiplication Method for Elliptic Curves over Binary Fields

DOI10.1109/TC.2009.61zbMath1367.94314MaRDI QIDQ4974894

Koray Karabina, Darrel Hankerson, Alfred J. Menezes

Publication date: 8 August 2017

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Related Items (7)

Efficient Software Implementation of Laddering Algorithms Over Binary Elliptic Curves ⋮ Efficiently computable endomorphism for genus 3 hyperelliptic curve cryptosystems ⋮ Endomorphisms for faster elliptic curve cryptography on a large class of curves ⋮ Extending the GLS endomorphism to speed up GHS Weil descent using Magma ⋮ Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves ⋮ Kummer for genus one over prime-order fields ⋮ Koblitz curves over quadratic fields

This page was built for publication: Analyzing the Galbraith-Lin-Scott Point Multiplication Method for Elliptic Curves over Binary Fields