A correspondence of certain irreducible polynomials over finite fields
暂无分享,去创建一个
[1] Arjen K. Lenstra,et al. The XTR Public Key System , 2000, CRYPTO.
[2] Stephen D. Cohen. The reducibility theorem for linearised polynomials over finite fields , 1989, Bulletin of the Australian Mathematical Society.
[3] Leonard M. Adleman,et al. Finding irreducible polynomials over finite fields , 1986, STOC '86.
[4] Hyung-Don Kim,et al. CERTAIN CUBIC POLYNOMIALS OVER FINITE FIELDS , 2009 .
[5] Victor Shoup,et al. New algorithms for finding irreducible polynomials over finite fields , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[6] Melsik K. Kyuregyan. Iterated constructions of irreducible polynomials over finite fields with linearly independent roots , 2004, Finite Fields Their Appl..
[7] Arjen K. Lenstra,et al. Fast Irreducibility and Subgroup Membership Testing in XTR , 2001, Public Key Cryptography.
[8] Stephen D. Cohen. The explicit construction of irreducible polynomials over finite fields , 1992, Des. Codes Cryptogr..