Solving equations in finite fields and some results concerning the structure of GF(p/sup m/)

DOI10.1109/18.135660zbMath0754.12001MaRDI QIDQ4008354

Klaus Huber

Publication date: 27 September 1992

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.135660

zbMATH Keywords

complexity; algorithms; finite field; discrete logarithms; solution of polynomial equations; Zech logarithm; iterative root mapping

Mathematics Subject Classification ID

11T71: Algebraic coding theory; cryptography (number-theoretic aspects)

11Y16: Number-theoretic algorithms; complexity

12E20: Finite fields (field-theoretic aspects)

94B15: Cyclic codes

Related Items

Univariate polynomial factorization over finite fields