Taking \(p\)th roots modulo polynomials over finite fields
type: Item
instance of: scholarly article
title: Taking \(p\)th roots modulo polynomials over finite fields
zbMATH Open document ID: 1126.11345
DOI: 10.1023/A:1024118322745
author: Klaus Huber
published in: Designs, Codes and Cryptography
publication date: 2003-07-01T00:00:00Z
Mathematics Subject Classification ID: 11T06
Mathematics Subject Classification ID: 11T71
zbMATH DE Number: 1944960
zbMATH Keywords: finite fields
zbMATH Keywords: Frobenius mapping
zbMATH Keywords: Patterson algorithm
MaRDI profile type: Publication
full work available at URL: a:1024118322745
OpenAlex ID: W19485423
Recommended article: Taking roots over high extensions of finite fields
Recommended article: Roots of certain polynomials over finite fields
Recommended article: Roots and coefficients of polynomials over finite fields
Recommended article: POLYNOMIAL REPRESENTATIONS FOR n-TH ROOTS IN FINITE FIELDS
Recommended article: Counting polynomials over finite fields with given root multiplicities
Recommended article: Irreducibility and Deterministic r-th Root Finding over Finite Fields
Recommended article: Q3820706
Recommended article: Roots and coefficients of multivariate polynomials over finite fields
Recommended article: Q3464705
Recommended article: On the number of values taken by a polynomial over a finite field
description: scientific article; zbMATH DE number 1944960