A speed‐area‐efficient hardware ECPM‐engine in GF(p) over generic Weierstrass curves

A speed‐area‐efficient hardware ECPM‐engine in GF(p) over generic Weierstrass curves

Abstract This paper proposes a 256‐bit speed‐area‐efficient hardware elliptic curve point‐multiplication engine (ECPM‐engine) in GF(p) over generic Weierstrass curves, which is optimized by a new speed‐area‐efficient radix‐64 Montgomery modular multiplication (R64MMM) and a novel Montgomery ladder s...

Olles dieđut

Bibliográfalaš dieđut
Váldodahkkit: Yujun Xie, Zhenhui He, Yuan Liu, Xin Zheng, Shuting Cai, Xiaoming Xiong
Materiálatiipa: Artihkal
Giella:English
Almmustuhtton: Wiley 2024-02-01
Ráidu:Electronics Letters
Fáttát:
circuits and systems
cryptography
digital arithmetic
digital circuits
Liŋkkat:https://doi.org/10.1049/ell2.13069

Interneahtta

https://doi.org/10.1049/ell2.13069

Geahča maid