A fast addition algorithm for elliptic curve arithmetic in \(\mathrm{GF}(2^{n})\) using projective coordinates

DOI10.1016/S0020-0190(00)00134-4zbMath1339.94047WikidataQ127829991 ScholiaQ127829991MaRDI QIDQ294862

Naofumi Takagi, Akira Higuchi

Publication date: 16 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019000001344?np=y

zbMATH Keywords

cryptographyaddition algorithmelliptic curve arithmetic

Mathematics Subject Classification ID

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

Related Items (1)

Automatic synthesis of quantum circuits for point addition on ordinary binary elliptic curves

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A fast addition algorithm for elliptic curve arithmetic in \(\mathrm{GF}(2^{n})\) using projective coordinates