A fast addition algorithm for elliptic curve arithmetic in GF(2ⁿ) using projective coordinates

DOI10.1016/S0020-0190(00)00134-4MaRDI QIDQ294862zbMATH OpenWikidataFDO

Authors Akira Higuchi, Naofumi Takagi

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

addition algorithmcryptographyelliptic curve arithmetic

Mathematics Subject Classification ID

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

Cited in

(1)

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

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

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