Taking \(p\)th roots modulo polynomials over finite fields

DOI10.1023/A:1024118322745zbMath1126.11345OpenAlexW19485423MaRDI QIDQ1395768

Klaus Huber

Publication date: 1 July 2003

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1024118322745

zbMATH Keywords

finite fieldsFrobenius mappingPatterson algorithm

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Polynomials over finite fields (11T06)

This page was built for publication: Taking \(p\)th roots modulo polynomials over finite fields