This is continuation-question based on: If PRESENT had different permutations s would that protect it against Statistical Saturation Attack? Can we protect PRESENT from Statistical Saturation Attacks by using:
- unique perms for each round or just some rounds? (In this case, how many might some have to be?)
- random, key-dependent (say), perms for some or all rounds?
Moreover, if these ideas can indeed protect PRESENT against SS attacks:
- Could we use fewer than 31 rounds without causing vulnerabilities to other attacks?