Optimal normal bases in GF(pn)
Discrete Applied Mathematics
Bit serial multiplication in finite fields
SIAM Journal on Discrete Mathematics
Designs, Codes and Cryptography
Designs, Codes and Cryptography
Efficient exponentiation using weakly dual basis
IEEE Transactions on Very Large Scale Integration (VLSI) Systems - System Level Design
New directions in cryptography
IEEE Transactions on Information Theory
Bit-serial Reed - Solomon encoders
IEEE Transactions on Information Theory
A public key cryptosystem and a signature scheme based on discrete logarithms
IEEE Transactions on Information Theory
On bit-serial multiplication and dual bases in GF(2m)
IEEE Transactions on Information Theory
| Hi-index | 0.04 |
We propose a new characterization of dual bases in finite fields. Let A=(@a"1,...,@a"n) be a basis of F over F"q and its dual basis B=(@b"1,...,@b"n) with the transition matrix C@?GL"n(F"q) such that (@b"1,...,@b"n)=(@a"1,...,@a"n)C. We show that T"k^T=C^-^1T"kC holds for all 1=