Searching for primitive roots in finite fields
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Constructing normal bases in finite fields
Journal of Symbolic Computation
A fast deterministic algorithm for factoring polynomials over finite fields of small characteristic
ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Practical factorization of univariate polynomials over finite fields
ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Subquadratic-time factoring of polynomials over finite fields
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Full Cryptanalysis of LPS and Morgenstern Hash Functions
SCN '08 Proceedings of the 6th international conference on Security and Cryptography for Networks
Improving the berlekamp algorithm for binomials xn-a
WAIFI'12 Proceedings of the 4th international conference on Arithmetic of Finite Fields
Hi-index | 0.89 |