具有最多个$2$乘$2$可逆子阵的可逆二元矩阵
Invertible binary matrix with maximum number of $2$-by-$2$ invertible submatrices
摘要:
这个问题与Rivest提出的全或无变换(AONT)有关,AONT是用块密码加密数据的预处理。从那时起,AONT在密码学和安全性方面有各种应用。D'Arco,Esfahani和Stinson提出了关于二元矩阵的构造的问题,其中AONT的期望性质以最大概率保持。也就是说,对于给定的整数$t\le s$,在$s$阶的二进制矩阵中,$t$乘$t$可逆子矩阵的最大数目是多少?对于$t=2$的情况,令$R_2(s)$表示2 × 2可逆子矩阵的最大比例。D'Arco,Esfahani和Stinson证实极限在0.492和0.625之间。我们完全解决的情况下$t=2$显示,$\lim_{s\rightarrow\infty}R_2(s)=0.5$。
英文摘要:
The problem is related to all-or-nothing transforms (AONT) suggested by Rivest as a preprocessing for encrypting data with a block cipher. Since then there have been various applications of AONTs in cryptography and security. D'Arco, Esfahani and Stinson posed the problem on the constructions of binary matrices for which the desired properties of an AONT hold with the maximum probability. That is, for given integers $t\le s$, what is the maximum number of $t$-by-$t$ invertible submatrices in a binary matrix of order $s$? For the case $t=2$, let $R_2(s)$ denote the maximal proportion of 2-by-2 invertible submatrices. D'Arco, Esfahani and Stinson conjectured that the limit is between 0.492 and 0.625. We completely solve the case $t=2$ by showing that $\lim_{s\rightarrow\infty}R_2(s)=0.5$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。