Highly regular architectures for finite field computation using redundant basis

DOI10.1007/3-540-48059-5_23MaRDI QIDQ4502794zbMATH OpenFDO

Authors Huapeng Wu, M. Anwar Hasan, Ian Blake

Publication date 7 November 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48059-5_23

zbMATH Keywords

elliptic curve cryptosystemsfinite field multiplierhardware implementationredundant basis

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Mathematical problems of computer architecture (68M07) Cryptography (94A60)

Recommendations

• Redundant representation of finite fields
• scientific article; zbMATH DE number 1997929
• A new construction of Massey-Omura parallel multiplier over GF(2/sup m/)
• Low complexity bit-parallel finite field arithmetic using polynomial basis
• A redundant representation of GF(qⁿ) for designing arithmetic circuits

Cited in

(3)

• Redundant representation of finite fields
• scientific article; zbMATH DE number 5926987 (Why is no real title available?)
• A redundant representation of GF(qⁿ) for designing arithmetic circuits

This page was built for publication: Highly regular architectures for finite field computation using redundant basis

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