FACTORIZATION OF POLYNOMIALS AND SOME LINEAR-ALGEBRA PROBLEMS OVER FINITE-FIELDS

被引:35
作者
NIEDERREITER, H
机构
[1] A-1010 Vienna
关键词
D O I
10.1016/0024-3795(93)90247-L
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The recently developed algorithm of Niederreiter for the factorization of polynomials over finite fields provides a ''linearization'' of the factorization problem via differential equations in rational function fields. We show that the range of applicability of this algorithm can be extended by various techniques, such as the application of normal bases and the use of Hasse-Teichmuller derivatives. We also discuss topics from pseudorandom vector generation and combinatorial linear algebra that lead to interesting linear algebra problems over finite fields.
引用
收藏
页码:301 / 328
页数:28
相关论文
共 23 条
[1]  
[Anonymous], 1992, RANDOM NUMBER GENERA
[2]  
Berlekamp E. R., 1967, BELL SYST TECH J, V46, P1853
[3]  
BERLEKAMP ER, 1968, ALGEBRAIC CODING THE
[4]  
BLAKE I, 1993, APPLICATIONS FINITE
[5]  
Brent R.P., 1980, J ALGORITHMS, V1, P259
[6]  
COPPERSMITH D, 1992, SOLVING HOMOGENEOUS
[7]  
GOTTFERT R, THESIS U VIENNA
[8]  
Hasse H, 1936, J REINE ANGEW MATH, V175, P50
[9]  
Lidl Rudolf, 1983, FINITE FIELDS
[10]  
MILLER VS, 1992, FACTORIZATION METHOD