Skip to main content
SpringerLink
Log in

Taking pth Roots Modulo Polynomials over Finite Fields

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

In this contribution we show how to find y(x) in the polynomial equation y(x)p ≡ t(x) mod f(x), where t(x), y(x) and f(x) are polynomials over the field GF(p m). The solution of such equations are thought for in many cases, e.g., for p = 2 it is a step in the so-called Patterson Algorithm for decoding binary Goppa codes.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. E. Bach and J. Shallit, Algorithmic number theory, Efficient Algorithms, Vol. I, MIT Press, Cambridge, Massachusetts (1996).

    Google Scholar 

  2. E. R. Berlekamp, Algebraic coding theory, Aegean Park Press (1984).

  3. K. Huber, “Note on decoding binary Goppa codes,” Electronics Letters, Vol. 32, No. 2 (1996) pp. 102–103.

    Google Scholar 

  4. N. J. Patterson, “The algebraic decoding of Goppa codes,” IEEE Trans. on Inf. Theory, Vol. IT-21, No. 2 (1975) pp. 203–207.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ES 21a, Deutsche Telekom AG, T-Systems Nova GmbH, 64276, Darmstadt, Germany

    Klaus Huber

Authors
  1. Klaus Huber
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Huber, K. Taking pth Roots Modulo Polynomials over Finite Fields. Designs, Codes and Cryptography 28, 303–311 (2003). https://doi.org/10.1023/A:1024118322745

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1024118322745

Search

Navigation