Taking pth roots modulo polynomials over finite fields

被引:1
|
作者
Huber, K [1 ]
机构
[1] T Syst Nova GmbH, Deutsch Telekom AG, ES 21A, D-64276 Darmstadt, Germany
关键词
finite fields; frobenius mapping; Patterson Algorithm;
D O I
10.1023/A:1024118322745
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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.
引用
收藏
页码:303 / 311
页数:9
相关论文
共 50 条