Abstract
Abstract We study matrices over quotient rings modulo univariate polynomials over a two-element field. Lower bounds for the fraction of the invertible matrices among all such matrices of a given size are obtained. An efficient algorithm for calculating the determinant of matrices over these quotient rings and an algorithm for generating random invertible matrices (with uniform distribution on the set of all invertible matrices) are proposed and analyzed. An effective version of the latter algorithm for quotient rings modulo polynomials of form x r − 1 is considered and analyzed. These methods may find practical applications for generating keys of cryptographic schemes based on quasi-cyclic codes such as LEDAcrypt.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
