[math-fun] Perfect nonlinear functions n=2m
In Nyberg's 1991 paper, she proves that a perfect nonlinear binary S-box must have an input dimension at least twice that of the output dimension. I'm trying to construct the most trivial versions of her theorem: i.e., n=2*m, m=1, 2, 3, etc. Has anyone here done such a thing?
Kaisa Nyberg (1991) on DES attacks is freely on available at https://link.springer.com/content/pdf/10.1007/3-540-46416-6_32.pdf WFL On 1/20/19, Henry Baker <hbaker1@pipeline.com> wrote:
In Nyberg's 1991 paper, she proves that a perfect nonlinear binary S-box must have an input dimension at least twice that of the output dimension.
I'm trying to construct the most trivial versions of her theorem: i.e., n=2*m, m=1, 2, 3, etc.
Has anyone here done such a thing?
_______________________________________________ math-fun mailing list math-fun@mailman.xmission.com https://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun
participants (2)
-
Fred Lunnon -
Henry Baker