Partitioned systolic architecture for modular multiplication in GF(2ᵐ)

DOI10.1016/S0020-0190(00)00130-7MaRDI QIDQ294869zbMATH OpenFDO

Authors Hyun-Sung Kim, Sung-Woo Lee, Kee-Young Yoo

Publication date 16 June 2016

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL http://www.sciencedirect.com/science/article/pii/S0020019000001307?np=y

zbMATH Keywords

cryptographyLPGS partitionmodular multipliersystolic array

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Mathematical problems of computer architecture (68M07) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Recommendations

• Computational Science and Its Applications – ICCSA 2004
• Unidirectional Two Dimensional Systolic Array for Multiplication in GF(2 m ) Using LSB First Algorithm
• scientific article; zbMATH DE number 17850
• Multiplexer-based bit-parallel systolic multipliers over GF(\(2^m)\)
• Computational Science and Its Applications – ICCSA 2004

Cites work

• A method for obtaining digital signatures and public-key cryptosystems

Cited in

(4)

• Unidirectional Two Dimensional Systolic Array for Multiplication in GF(2 m ) Using LSB First Algorithm
• Computational Science and Its Applications – ICCSA 2004
• Computational Science and Its Applications – ICCSA 2004
• Partition Algorithm For Parallel Processing Of Array Multiplication In Gf(2m) Fields

This page was built for publication: Partitioned systolic architecture for modular multiplication in \(\mathrm{GF}(2^{m})\)

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