Evaluation of the maximum proportion of invertible submatrices in invertible binary matrices
Jiayi Hu
Abstract
Open-access reader
Jiayi Hu
Abstract
Open-access reader
The research on all-or-nothing transform in cryptography leads to the problem that, for a given positive integer , what is the density of invertible submatrices of any invertible matrix? For binary matrices, previous work shows that in the case , , where denotes the maximum proportion of invertible submatrices in invertible matrices. In this paper we study the case . It is proved that and an upper bound of is given as well.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The research on all-or-nothing transform in cryptography leads to the problem that, for a given positive integer , what is the density of invertible submatrices of any invertible matrix? For binary matrices, previous work shows that in the case , , where denotes the maximum proportion of invertible submatrices in invertible matrices. In this paper we study the case . It is proved that and an upper bound of is given as well.
Key concepts: Invertible matrix, Block matrix, Mathematics, Binary number, Combinatorics, Integer (computer science), Block (permutation group theory), Matrix (chemical analysis)