Abstract: In a recent work, Beierle, Brinkmann and Leander presented a recursive tree search for finding APN permutations with linear self-equivalences in small dimensions. In this paper, we describe ...
(a) Dense matrices. Variables are often encoded as dense numerical arrays M i,j = M[i,j]. This representation is convenient and well-supported, but also puts a heavy load on the memories of our ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results