An inverter architecture for ECC-GF(2ᵐ) based on the Stein's algorithm

MaRDI QIDQ6607239zbMATH OpenFDO

Authors Maurício Araújo Dias, José Raimundo de Oliveira

Publication date 18 September 2024

zbMATH Keywords

elliptic curve cryptography

Mathematics Subject Classification ID

Applications to coding theory and cryptography of arithmetic geometry (14G50) Elliptic curves (14H52) Cryptography (94A60)

Recommendations

• Bit-parallel coprocessor for standard ECC-GF(2ᵐ) on FPGA
• Applying systolic multiplication-inversion architectures based on modified extended Euclidean algorithm for \(\text{GF}(2^k)\) in elliptic curve cryptography
• scientific article; zbMATH DE number 1950621
• Reconfigurable architecture for elliptic curve cryptography using FPGA
• An area/performance trade-off analysis of a GF(2ᵐ) multiplier architecture for elliptic curve cryptography

This page was built for publication: An inverter architecture for ECC-\(\mathrm{GF}(2^m)\) based on the Stein's algorithm

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