A VLSI design for computing exponentiations in GF(2/sup m/) and its application to generate pseudorandom number sequences
From MaRDI portal
Publication:5375439
DOI10.1109/12.45211zbMath1395.11141OpenAlexW2027457414MaRDI QIDQ5375439
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
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Communication theory (94A05)
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