Taking pth Roots Modulo Polynomials over Finite Fields

被引：0
|
作者：
Klaus Huber
机构：
[1] ES 21a,
[2] Deutsche Telekom AG,undefined
[3] T-Systems Nova GmbH,undefined
来源：
Designs, Codes and Cryptography | 2003年 / 28卷
关键词：
finite fields; frobenius mapping; patterson algorithm;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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(pm). 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.
引用
收藏
页码：303 / 311
页数：8
相关论文
共 50 条
12345