Taking pth roots modulo polynomials over finite fields

DOI10.1023/A:1024118322745MaRDI QIDQ1395768zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Taking roots over high extensions of finite fields
• Roots of certain polynomials over finite fields
• Roots and coefficients of polynomials over finite fields
• POLYNOMIAL REPRESENTATIONS FOR n-TH ROOTS IN FINITE FIELDS
• Counting polynomials over finite fields with given root multiplicities
• Irreducibility and deterministic \(r\)-th root finding over finite fields
• scientific article; zbMATH DE number 4093599
• Roots and coefficients of multivariate polynomials over finite fields
• Roots of polynomials in p-adic fields
• On the number of values taken by a polynomial over a finite field

Cited in

(3)

• Short polynomial representations for square roots modulo p
• Taking roots over high extensions of finite fields
• Power roots of polynomials over arbitrary fields

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

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