Semi-systolic Modular Multiplier over GF(2m)

DOI10.1007/978-3-540-69848-7_66MaRDI QIDQ3512542zbMATH OpenOpenAlexFDO

Authors Hyun-Sung Kim, Sung W. Lee

Publication date 18 July 2008

Published in Computational Science and Its Applications – ICCSA 2008 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-69848-7_66

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Cryptography (94A60)

Recommendations

• Computational Science – ICCS 2005
• Low Complexity Systolic Architecture for Modular Multiplication over GF(2 m )
• Design of a linear systolic array for computing modular multiplication and squaring in \(\text{GF}(2^m)\)
• scientific article; zbMATH DE number 1941246
• A fully-pipeline linear systolic architecture for modular multiplier in public-key crypto-systems

Cites work

• scientific article; zbMATH DE number 438988 (Why is no real title available?)
• scientific article; zbMATH DE number 3397423 (Why is no real title available?)
• Structure of parallel multipliers for a class of fields GF(2^ m)
• Systolic Multipliers for Finite Fields GF(2^m)
• The use of finite fields to compute convolutions

Cited in

(7)

• A fully-pipeline linear systolic architecture for modular multiplier in public-key crypto-systems
• AOP arithmetic architectures over GF(2\(^m\))
• scientific article; zbMATH DE number 2089179 (Why is no real title available?)
• Modular Reduction in GF(2 n ) without Pre-computational Phase
• Low Complexity Systolic Architecture for Modular Multiplication over GF(2 m )
• Computational Science – ICCS 2005
• Design of a linear systolic array for computing modular multiplication and squaring in \(\text{GF}(2^m)\)

This page was built for publication: Semi-systolic Modular Multiplier over GF(2m)

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