A VLSI design for computing exponentiations in GF(2/sup m/) and its application to generate pseudorandom number sequences

DOI10.1109/12.45211MaRDI QIDQ5375439zbMATH OpenOpenAlexFDO

Authors Charles C. Wang, Dingyi Pei

Publication date 14 September 2018

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/12.45211

Mathematics Subject Classification ID

Communication theory (94A05) Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Recommendations

• scientific article; zbMATH DE number 4102996
• VLSI Architectures for Computing Multiplications and Inverses in GF(2^m)
• VLSI algorithms, architectures, and implementation of a versatile GF(2/sup m/) processor
• A Versatile Reconfigurable Bit-Serial Multiplier Architecture in Finite Fields GF(2m)
• LFSR-based Bit-Serial $GF(2^m)$ Multipliers using Irreducible Trinomials
• Bit-level systolic array for fast exponentiation in GF(2/sup m/)
• scientific article; zbMATH DE number 5041007
• scientific article; zbMATH DE number 1997929
• scientific article; zbMATH DE number 1878334
• Publication:3476924

Cited in

(1)

• VLSI algorithms, architectures, and implementation of a versatile GF(2/sup m/) processor

This page was built for publication: A VLSI design for computing exponentiations in GF(2/sup m/) and its application to generate pseudorandom number sequences

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