Efficient parallel exponentiation in GF(2n) using normal basis representations
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Irreducible trinomials over finite fields
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Finite Field Multiplier Using Redundant Representation
IEEE Transactions on Computers
Reconfigurable Implementation of Elliptic Curve Crypto Algorithms
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Irreducible trinomials over finite fields
Mathematics of Computation
Fast arithmetic with general Gauß periods
Theoretical Computer Science - Algebraic and numerical algorithm
Efficient parallel exponentiation in GF(qn) using normal basis representations
Journal of Algorithms
Efficient Algorithms and Architectures for Field Multiplication Using Gaussian Normal Bases
IEEE Transactions on Computers
Efficient Computation of Roots in Finite Fields
Designs, Codes and Cryptography
Probabilistic algorithm for finding roots of linearized polynomials
Designs, Codes and Cryptography
Efficient Multiplication Using Type 2 Optimal Normal Bases
WAIFI '07 Proceedings of the 1st international workshop on Arithmetic of Finite Fields
Subset-Restricted Random Walks for Pollard rho Method on ${\mathbf{F}_{p^m}}$
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
A Non-abelian Group Based on Block Upper Triangular Matrices with Cryptographic Applications
AAECC-18 '09 Proceedings of the 18th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Fast encoding and decoding of Gabidulin codes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Efficient parallel exponentiation in GF(qn) using normal basis representations
Journal of Algorithms
A bit-serial word-parallel finite field multiplier using redundant basis in F2M
AsiaCSN '07 Proceedings of the Fourth IASTED Asian Conference on Communication Systems and Networks
Type-II optimal polynomial bases
WAIFI'10 Proceedings of the Third international conference on Arithmetic of finite fields
Extension of Barreto-Voloch root extraction method
ICICS'11 Proceedings of the 13th international conference on Information and communications security
Gauss periods as constructions of low complexity normal bases
Designs, Codes and Cryptography
Elliptic periods for finite fields
Finite Fields and Their Applications
Low complexity normal bases in F2n
Finite Fields and Their Applications
Abelian Groups, Gauss Periods, and Normal Bases
Finite Fields and Their Applications
| Hi-index | 0.01 |