algorithms:14

This shows you the differences between two versions of the page.

Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||

algorithms:14 [2015/01/09 16:49] tbertin |
algorithms:14 [2015/04/22 06:38] tbertin |
||
---|---|---|---|

Line 7: | Line 7: | ||

I have performed a first quick analysis of the new GOST Grasshopper algorithm and here are the first observations I have made (of course this analysis needs to be pushed on further): | I have performed a first quick analysis of the new GOST Grasshopper algorithm and here are the first observations I have made (of course this analysis needs to be pushed on further): | ||

- | *Contrary to the GOST 28147-89 algorithm, GOST Grasshopper belongs to the SPN family (Substitution Permutation Network), an block encryption algorithm family which contains the AES (Rijndael). | + | *Contrary to the GOST 28147-89 algorithm, GOST Grasshopper belongs to the SPN family (Substitution Permutation Network), a block encryption algorithm family which contains the AES (Rijndael). |

*The main features are: 128-bit blocks (plaintext, ciphertext), a 256-bit master key from which 10 128-bit subkeys are derived according to highly nonlinear process, 10 rounds. The general structure is then very common to SPN and is sketched as follows | *The main features are: 128-bit blocks (plaintext, ciphertext), a 256-bit master key from which 10 128-bit subkeys are derived according to highly nonlinear process, 10 rounds. The general structure is then very common to SPN and is sketched as follows | ||

+ | {{ :undefined:gost_grasshopper.jpeg?direct&200 |}} | ||

* The statistical analysis of the cipher does not reveal any statistical bias and has passed all the tests (performed with NIST STS SP800-22 revision 1 and L'ecuyer & Simard's TESTU01 suite). Gost Grasshopper seems to have far better algebraic and combinatorial complexities that the existing SPN and especially than the AES (whose relatively weak algebraic complexity has been pinpointed by several cryptographers). Further analyses have to be conducted to confirm this initial result. | * The statistical analysis of the cipher does not reveal any statistical bias and has passed all the tests (performed with NIST STS SP800-22 revision 1 and L'ecuyer & Simard's TESTU01 suite). Gost Grasshopper seems to have far better algebraic and combinatorial complexities that the existing SPN and especially than the AES (whose relatively weak algebraic complexity has been pinpointed by several cryptographers). Further analyses have to be conducted to confirm this initial result. | ||

algorithms/14.txt ยท Last modified: 2016/01/20 18:38 (external edit)