论文信息 - Formulas for cube roots in F3m - 字舞流文

Formulas for cube roots in F3m

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 [email protected]?F"3[x] is an irreducible trinomial.

Alfred Menezes | Darrel Hankerson | Omran Ahmadi

[1] Omran Ahmadi,et al. On the distribution of irreducible trinomials over F3 , 2007, Finite Fields Their Appl..

[2] Nigel P. Smart,et al. Software Implementation of Finite Fields of Characteristic Three, for Use in Pairing-based Cryptosystems , 2002 .

[3] Dan Page,et al. Hardware Acceleration of the Tate Pairing in Characteristic Three , 2005, CHES.

[4] Alfred Menezes,et al. Field inversion and point halving revisited , 2004, IEEE Transactions on Computers.

[5] Iwan M. Duursma,et al. Tate Pairing Implementation for Hyperelliptic Curves y2 = xp-x + d , 2003, ASIACRYPT.

[6] Paulo S. L. M. Barreto. A note on efficient computation of cube roots in characteristic 3 , 2004, IACR Cryptol. ePrint Arch..

[7] Joachim von zur Gathen,et al. Polynomial and Normal Bases for Finite Fields , 2005, Journal of Cryptology.

[8] Paulo S. L. M. Barreto,et al. Efficient Algorithms for Pairing-Based Cryptosystems , 2002, CRYPTO.

[9] Paulo S. L. M. Barreto,et al. Efficient pairing computation on supersingular Abelian varieties , 2007, IACR Cryptol. ePrint Arch..

[10] Nigel P. Smart,et al. Hardware Implementation of Finite Fields of Characteristic Three , 2002, CHES.

[11] Steven D. Galbraith,et al. Implementing the Tate Pairing , 2002, ANTS.

[12] Paulo S. L. M. Barreto,et al. Efficient Hardware for the Tate Pairing Calculation in Characteristic Three , 2005, CHES.

[13] A. Menezes,et al. Applications of Finite Fields , 1992 .