Characterization for a family of infinitely many irreducible equally spaced polynomials
From MaRDI portal
Publication:750156
DOI10.1016/0020-0190(91)90219-8zbMath0713.68030OpenAlexW2006176786MaRDI QIDQ750156
Publication date: 1991
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(91)90219-8
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Theory of error-correcting codes and error-detecting codes (94B99) Distributed algorithms (68W15)
Cites Work
- Optimal normal bases in \(GF(p^ n)\)
- A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
- Structure of parallel multipliers for a class of fields \(GF(2^ m)\)
- VLSI Architectures for Computing Multiplications and Inverses in GF(2m)
- A geometric approach to root finding in GT(q/sup m/)