A geometric approach to root finding in GF(qm)
暂无分享,去创建一个
[1] E. Berlekamp. Factoring polynomials over large finite fields* , 1970, SYMSAC '71.
[2] T. Itoh,et al. A Fast Algorithm for Computing Multiplicative Inverses in GF(2^m) Using Normal Bases , 1988, Inf. Comput..
[3] D. Cantor,et al. A new algorithm for factoring polynomials over finite fields , 1981 .
[4] Michael O. Rabin,et al. Probabilistic Algorithms in Finite Fields , 1980, SIAM J. Comput..
[5] Alfred Menezes,et al. Some Computational Aspects of Root Finding in GF(qm) , 1988, ISSAC.
[6] Neal Zierler. A conversion algorithm for logarithms on GF(2n) , 1974 .
[7] Elwyn R. Berlekamp,et al. On the Solution of Algebraic Equations over Finite Fields , 1967, Inf. Control..
[8] Michael Ben-Or,et al. Probabilistic algorithms in finite fields , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[9] Ian F. Blake,et al. Low complexity normal bases , 1989, Discret. Appl. Math..
[10] Paul C. van Oorschot,et al. On splitting sets in block designs and finding roots of polynomials , 1990, Discret. Math..
[11] Ronald C. Mullin,et al. Optimal normal bases in GF(pn) , 1989, Discret. Appl. Math..