Constructive problems for irreducible polynomials over finite fields
Proceedings of the third Canadian workshop on Information theory and applications
Construction and distribution problems for irreducible trinomials over finite fields
Applications of finite fields
Efficient Algorithms for Pairing-Based Cryptosystems
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
Hardware Implementation of Finite Fields of Characteristic Three
CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
Irreducible trinomials over finite fields
Mathematics of Computation
Polynomial and Normal Bases for Finite Fields
Journal of Cryptology
Hardware acceleration of the tate pairing in characteristic three
CHES'05 Proceedings of the 7th international conference on Cryptographic hardware and embedded systems
Efficient hardware for the tate pairing calculation in characteristic three
CHES'05 Proceedings of the 7th international conference on Cryptographic hardware and embedded systems
Formulas for cube roots in F3m
Discrete Applied Mathematics
Swan-like results for binomials and trinomials over finite fields of odd characteristic
Designs, Codes and Cryptography
| Hi-index | 0.00 |
We present some results about irreducible polynomials over finite fields and use them to prove a conjecture of von zur Gathen concerning the distribution of irreducible trinomials over F"3.