Low complexity normal bases for \(F_{2^{mn}}\)
From MaRDI portal
Publication:918710
DOI10.1016/0166-218X(90)90012-2zbMath0706.68060MaRDI QIDQ918710
Publication date: 1990
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(90)90012-2
68Q25: Analysis of algorithms and problem complexity
94A60: Cryptography
11Y16: Number-theoretic algorithms; complexity
94A24: Coding theorems (Shannon theory)
Related Items
Complexity of computation in finite fields, A new criterion on normal bases of finite field extensions, Trace-orthogonal normal bases, Almost weakly self-dual bases for finite fields
Cites Work
- Low complexity normal bases
- Optimal normal bases in \(GF(p^ n)\)
- Structure of parallel multipliers for a class of fields \(GF(2^ m)\)
- VLSI Architectures for Computing Multiplications and Inverses in GF(2m)
- An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)