Hardware realization of fast elliptic curve point multiplication using balanced ternary representation and pre-computation overGF(p)

DOI10.1080/09720529.2015.1103017zbMath1498.11237OpenAlexW2401718577MaRDI QIDQ5069765

No author found.

Publication date: 19 April 2022

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2015.1103017

zbMATH Keywords

balanced ternary representationelliptic curve point multiplicationradix 3 pre-computationternary point multiplication

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Curves over finite and local fields (11G20) Computational number theory (11Y99)

Cites Work

• Elliptic Curve Cryptosystems
• Hardware Elliptic Curve Cryptographic Processor Over<tex>$rm GF(p)$</tex>
• Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Hardware realization of fast elliptic curve point multiplication using balanced ternary representation and pre-computation overGF(p)