scientific article; zbMATH DE number 426129

zbMATH Open0792.11046MaRDI QIDQ3136949FDOQ3136949

Authors: Harald Niederreiter 

Publication date: 1 November 1993

Title of this publication is not available (Why is that?)

Recommendations

• scientific article
• Computational problems in the theory of finite fields
• scientific article; zbMATH DE number 19618
• Publication:4893202
• scientific article; zbMATH DE number 1361739

zbMATH Keywords

surveyfinite fieldsbibliographyprimitive polynomialsnormal basesfactorization of polynomialsdiscrete logarithmsirreducibility testingshift registerfield isomorphismsconstruction of irreducible polynomials

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Polynomials over finite fields (11T06) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Research exposition (monographs, survey articles) pertaining to number theory (11-02)

Cited In (7)

• Finding Isomorphisms Between Finite Fields
• The algebraic theory of fractional jumps
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Factorization of polynomials and some linear-algebra problems over finite fields
• Title not available (Why is that?)

This page was built for publication:

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