首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Taking pth Roots Modulo Polynomials over Finite Fields
Authors:Klaus Huber
Institution:(1) ES 21a, Deutsche Telekom AG, T-Systems Nova GmbH, 64276 Darmstadt, Germany
Abstract:In this contribution we show how to find y(x) in the polynomial equation y(x) p equiv 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.
Keywords:finite fields  frobenius mapping  patterson algorithm
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号