We prove several cases of the following theorem: Every free group word which is not a proper power can represent every permutation of an infinite set. The remaining cases will be proved in a ...
Differentially 4-uniform permutations have emerged as a cornerstone in the design of secure substitution boxes (S-boxes) for modern block ciphers. These functions are characterised by their ability to ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback