Low complexity normal bases
- 1 November 1989
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 25 (3), 191-210
- https://doi.org/10.1016/0166-218x(89)90001-2
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A public key cryptosystem and a signature scheme based on discrete logarithmsIEEE Transactions on Information Theory, 1985
- On Symmetric Representations of Finite FieldsSIAM Journal on Algebraic Discrete Methods, 1983
- Bit-serial Reed - Solomon encodersIEEE Transactions on Information Theory, 1982
- Factorization of Symmetric Matrices and Trace-Orthogonal Bases in Finite FieldsSIAM Journal on Computing, 1980
- An improved algorithm for computing logarithms overGF(p)and its cryptographic significance (Corresp.)IEEE Transactions on Information Theory, 1978
- New directions in cryptographyIEEE Transactions on Information Theory, 1976
- Bases for Finite FieldsJournal of the London Mathematical Society, 1968
- Primitive roots in a finite fieldTransactions of the American Mathematical Society, 1952