3 ms·
The maths is way beyond my level, but I think it's rather amazing that they were, given a presumably random permutation, able to figure out the algorithm that g
by userbinator 8y ago
The maths is way beyond my level, but I think it's rather amazing that they were, given a presumably random permutation, able to figure out the algorithm that generated it. I'd like to read more about how that was done --- did they just try different algorithms until they found a match?
This reminds me of the story around the DES s-boxes:
https://en.wikipedia.org/wiki/Data_Encryption_Standard#NSA's_involvement_in_the_design https://en.wikipedia.org/wiki/Data_Encryption_Standard#NSA's...
To me, the possibility of a backdoor in these GOST algorithms seems just as likely as the possibility that the structure was chosen carefully to strengthen them against a type of attack that is still classified.
- blattimwind 8y agoIf you pick a random S-Box you can see that there is an expected value for its nonlinearity. On the other hand, you can also look at the maximum amount of nonlinearity you can have in an S-Box of a given size (and also some other properties). Then you can maximize those. This was done with DES. The S-Boxes used here on the other hand have a whole lot of structure, i.e. linearity, that has been put there intentionally. This is generally the opposite of what you would want to see in a S-Box. It is of course hypothetically possible that these linearity combine with other parts of the algorithm in a way to result in greater non-linearity or specific hardening against specific unknown attacks, but this does sound a bit far-fetched in my ears (I can't think of precedent for this; e.g. in DES the issue that was worked around was related to differential linearity, and it wasn't solved by adding more linearity into the algorithm).
- dfox 8y agoThe actual paper linked from introduction and papers by same authors it cites seems to contain description of though process that went into trying this particular algorithm.