On splitting sets in block designs and finding roots of polynomials

DOI10.1016/0012-365X(90)90274-LzbMath0703.05007OpenAlexW2059116331MaRDI QIDQ915734

Paul C. van Oorschot, Scott A. Vanstone

Publication date: 1990

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(90)90274-l

zbMATH Keywords

factoringcombinatorial block designsroots of polynomials over finite fieldst-splitting sets

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05)

Related Items (1)

Guest editorial: Special issue in honor of Scott A. Vanstone

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A conversion algorithm for logarithms on \(GF(2^n)\)
• Cyclotomy and difference families in elementary Abelian groups
• Improving an algorithm for factoring polynomials over a finite field and constructing large irreducible polynomials
• A Deterministic Algorithm for Factorizing Polynomials of Fq [X]
• Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
• A fast parallel algorithm for the maximal independent set problem
• A simple and fast probabilistic algorithm for computing square roots modulo a prime number (Corresp.)
• Probabilistic Algorithms in Finite Fields
• A New Algorithm for Factoring Polynomials Over Finite Fields
• On the Efficiency of Algorithms for Polynomial Factoring
• A geometric approach to root finding in GT(q/sup m/)
• Un Algorithme De Construction Des Idempotents Primitifs D'Ideaux D'Algebres Sur Fq
• Factoring Polynomials Over Large Finite Fields

This page was built for publication: On splitting sets in block designs and finding roots of polynomials