摘要
In order to answer a question motivated by constructing substitution boxes in block ciphers we will exhibit an infinite family of full-rank factorizations of elementary 2-groups into two factors having equal sizes.
In order to answer a question motivated by constructing substitution boxes in block ciphers we will exhibit an infinite family of full-rank factorizations of elementary 2-groups into two factors having equal sizes.
作者
Sá
ndor Szabó
Sándor Szabó(Institute of Mathematics and Informatics, University of Pécs, Pécs, Hungary)
