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
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
Field inversion and point halving revisited
IEEE Transactions on Computers
On the distribution of irreducible trinomials over F3
Finite Fields and Their Applications
Software Implementation of Arithmetic in
WAIFI '07 Proceedings of the 1st international workshop on Arithmetic of Finite Fields
Efficient pth root computations in finite fields of characteristic p
Designs, Codes and Cryptography
Another look at square roots (and other less common operations) in fields of even characteristic
SAC'07 Proceedings of the 14th international conference on Selected areas in cryptography
Formulas for cube roots in F3m using shifted polynomial basis
Information Processing Letters
| Hi-index | 0.04 |
We determine the number of nonzero coefficients (called the Hamming weight) in the polynomial representation of x^1^/^3 in F"3"^"m=F"3[x]/(f), where f@?F"3[x] is an irreducible trinomial.