Characterization for a family of infinitely many irreducible equally spaced polynomials

DOI10.1016/0020-0190(91)90219-8MaRDI QIDQ750156zbMATH OpenOpenAlexFDO

Authors Toshiya Itoh

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

zbMATH Keywords

generatorfinite fieldparallel algorithmsirreducible polynomial

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Distributed algorithms (68W15) Theory of error-correcting codes and error-detecting codes (94B99)

Recommendations

• Sequences of binary irreducible polynomials
• A note on identification of irreducible polynomials of over \(\mathbb F_{2}\)
• Polynome über endlichen Körpern mit gleichem Wurzelraum. (Polynomials over finite fields with equal root space)
• scientific article; zbMATH DE number 4051759
• Irreducible compositions of polynomials over finite fields of even characteristic

Cites work

• A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
• A geometric approach to root finding in GT(q/sup m/)
• 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(2^m)

This page was built for publication: Characterization for a family of infinitely many irreducible equally spaced polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q750156)