New Low-Complexity Bit-Parallel Finite Field Multipliers Using Weakly Dual Bases
IEEE Transactions on Computers
Bit-Parallel Finite Field Multiplier and Squarer Using Polynomial Basis
IEEE Transactions on Computers
On Complexity of Polynomial Basis Squaring in F2m
SAC '00 Proceedings of the 7th Annual International Workshop on Selected Areas in Cryptography
Low Complexity Bit-Parallel Finite Field Arithmetic Using Polynomial Basis
CHES '99 Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems
Primitive Polynomials Over GF(2) of Degree up to 660 with Uniformly Distributed Coefficients
Journal of Electronic Testing: Theory and Applications
Elliptic and hyperelliptic curves on embedded μP
ACM Transactions on Embedded Computing Systems (TECS)
A Twin for Euler's φ Function in $\mathbb{F}_2[X]$
WAIFI '07 Proceedings of the 1st international workshop on Arithmetic of Finite Fields
An extension of TYT inversion algorithm in polynomial basis
Information Processing Letters
Random number generators with period divisible by a Mersenne prime
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartI
Hardware performance characterization of block cipher structures
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
A note on the reducibility of binary affine polynomials
Designs, Codes and Cryptography
On the distribution of irreducible trinomials over F3
Finite Fields and Their Applications
Factorization of Trinomials over Galois Fields of Characteristic 2
Finite Fields and Their Applications
| Hi-index | 0.01 |