A new algorithm for multiplication in finite fields
- 1 July 1989
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 38 (7) , 1045-1049
- https://doi.org/10.1109/12.30855
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Bases for finite fields and a canonical decomposition for a normal basis generatorCommunications in Algebra, 1989
- VLSI Architectures for Computing Multiplications and Inverses in GF(2m)IEEE Transactions on Computers, 1985
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984
- Systolic Multipliers for Finite Fields GF(2m)IEEE Transactions on Computers, 1984
- On multiplication in algebraic extension fieldsTheoretical Computer Science, 1979
- New directions in cryptographyIEEE Transactions on Information Theory, 1976
- The Fast Fourier Transform in a Finite FieldMathematics of Computation, 1971