The Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields

This publication has 29 references indexed in Scilit:

• Dynamical sources in information theory: A general analysis of trie structures
  Algorithmica, 2001
• Analytic Combinatorics of Chord Diagrams
  Published by Springer Nature ,2000
• Toward a theory of Pollard's rho method
  Information and Computation, 1991
• Singularity Analysis of Generating Functions
  SIAM Journal on Discrete Mathematics, 1990
• A knapsack-type public key cryptosystem based on arithmetic in finite fields
  IEEE Transactions on Information Theory, 1988
• Théorèmes de densité dans $F_q[X]$
  Acta Arithmetica, 1987
• Probabilistic algorithms in finite fields
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1981
• A new algorithm for factoring polynomials over finite fields
  Mathematics of Computation, 1981
• The Arithmetic of Polynomials in a Galois Field
  American Journal of Mathematics, 1932
• Abriss einer Theorie der höhern Congruenzen in Bezug auf einen reellen Primzahl-Modulus.
  Journal für die reine und angewandte Mathematik (Crelles Journal), 1857