Efficient power-sum systolic architectures for public-key cryptosystems in GF(2ᵐ)

DOI10.1007/3-540-45655-4_18MaRDI QIDQ4808633zbMATH OpenFDO

Authors Nam-Yeun Kim, Won-Ho Lee, Kee-Young Yoo

Publication date 12 August 2004

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2387/23870153.htm

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• A power-sum systolic architecture in \(\text{GF}(2^m)\)
• Inversion/division systolic architecture for public-key cryptosystems in GF(2)
• Low Complexity Systolic Architecture for Modular Multiplication over GF(2 m )
• Computational Science and Its Applications – ICCSA 2004
• New systolic arrays for C+AB/sup 2/, inversion, and division in GF(2/sup m/)

Cited in

(5)

• A low-complexity power-sum circuit for GF(2ᵐ) and its applications
• A power-sum systolic architecture in \(\text{GF}(2^m)\)
• Low Complexity Systolic Architecture for Modular Multiplication over GF(2 m )
• Inversion/division systolic architecture for public-key cryptosystems in GF(2)
• Computational Science and Its Applications – ICCSA 2004

This page was built for publication: Efficient power-sum systolic architectures for public-key cryptosystems in \(\text{GF}(2^m)\)

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