On splitting sets in block designs and finding roots of polynomials

[1]  S. Lang.  Number Theory III , 1991 .

[2]  Paul C. van Oorschot,et al.  A geometric approach to root finding in GF(qm) , 1989, IEEE Trans. Inf. Theory.

[3]  P. V. Oorschot.  Combinatorial and computational issues related to finding roots of polynomials over finite fields , 1988 .

[4]  R. McEliece.  Finite Fields for Computer Scientists and Engineers , 1986 .

[5]  René C. Peralta,et al.  A simple and fast probabilistic algorithm for computing square roots modulo a prime number , 1986, IEEE Trans. Inf. Theory.

[6]  T. V. Lakshman,et al.  Efficient decentralized consensus protocols , 1986, IEEE Transactions on Software Engineering.

[7]  Richard M. Karp,et al.  A fast parallel algorithm for the maximal independent set problem , 1985, JACM.

[8]  R. Schoof.  Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p , 1985 .

[9]  T. Beth,et al.  Design Theory: Bibliography , 1999 .

[10]  Paul Camion.  Improving an algorithm for factoring polynomials over a finite field and constructing large irreducible polynomials , 1983, IEEE Trans. Inf. Theory.

[11]  Paul Camion.  A Deterministic Algorithm for Factorizing Polynomials of Fq [X] , 1983 .

[12]  Paul Camion.  Un Algorithme De Construction Des Idempotents Primitifs D'Ideaux D'Algebres Sur Fq , 1982 .

[13]  Michael Ben-Or,et al.  Probabilistic algorithms in finite fields , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[14]  D. Cantor,et al.  A new algorithm for factoring polynomials over finite fields , 1981 .

[15]  Michael O. Rabin,et al.  Probabilistic Algorithms in Finite Fields , 1980, SIAM J. Comput..

[16]  Leonard M. Adleman,et al.  Two theorems on random polynomial time , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[17]  Gary L. Miller,et al.  On taking roots in finite fields , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[18]  Robert T. Moenck,et al.  On the efficiency of algorithms for polynomial factoring , 1977 .

[19]  Neal Zierler.  A conversion algorithm for logarithms on GF(2n) , 1974 .

[20]  Richard M. Wilson,et al.  Cyclotomy and difference families in elementary abelian groups , 1972 .

[21]  E. Berlekamp.  Factoring polynomials over large finite fields* , 1970, SYMSAC '71.