7 papers
Quaternionic Perfect Sequences and Hadamard Matrices
Aidan Bennett, Curtis Bright, Paul Colinot +1
A finite sequence of numbers is perfect if it has zero periodic autocorrelation after a nontrivial cyclic shift. In this work, we study quaternionic perfect sequences having a one-…
Orthogonal Latin Squares of Order Ten with Two Relations: A SAT Investigation
Curtis Bright, Amadou Keita, Brett Stevens
A -net() is a combinatorial design equivalent to mutually orthogonal Latin squares of order . A relation in a net is a linear dependency over in the i…
Queen Domination by SAT Solving
Taha Rostami, Curtis Bright
The queen domination problem asks for the minimum number of queens required to attack all squares on an chessboard. Once this optimal number is known, determining the…
Symbolic Sets for Proving Bounds on Rado Numbers
Tanbir Ahmed, Lamina Zaman, Curtis Bright
Given a linear equation of the form where , , are positive integers, the -colour Rado number is the smallest positive integer $…
Myrvold's Results on Orthogonal Triples of Latin Squares: A SAT Investigation
Curtis Bright, Amadou Keita, Brett Stevens
Ever since E. T. Parker constructed an orthogonal pair of Latin squares in 1959, an orthogonal triple of Latin squares has been one of the most sought-aft…
New Results on Periodic Golay Pairs
Tyler Lumsden, Ilias Kotsireas, Curtis Bright
In this paper, we provide algorithmic methods for conducting exhaustive searches for periodic Golay pairs. Our methods enumerate several lengths beyond the currently known state-of…
SHA-256 Collision Attack with Programmatic SAT
Nahiyan Alamgir, Saeed Nejati, Curtis Bright
Cryptographic hash functions play a crucial role in ensuring data security, generating fixed-length hashes from variable-length inputs. The hash function SHA-256 is trusted for dat…