Hardware Elliptic Curve Cryptographic Processor Over<tex>rm GF(p)</tex>

DOI10.1109/TCSI.2006.880184MaRDI QIDQ4590567zbMATH OpenOpenAlexFDO

Authors Ciaran J. McIvor, Máire McLoone, John V. McCanny

Publication date 20 November 2017

Published in IEEE Transactions on Circuits and Systems I: Regular Papers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tcsi.2006.880184

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50) Numerical algorithms for computer arithmetic, etc. (65Y04) Mathematical problems of computer architecture (68M07) Cryptography (94A60)

Cited in

(2)

• scientific article; zbMATH DE number 1759281 (Why is no real title available?)
• Hardware realization of fast elliptic curve point multiplication using balanced ternary representation and pre-computation over \(\mathrm{GF}(p)\)

This page was built for publication: Hardware Elliptic Curve Cryptographic Processor Over<tex>$rm GF(p)$</tex>

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