Abstract | ||
---|---|---|
The last hash function and block cipher standardized by the Russian standardization body (GOST) both use the same S-Box. It is also used by an independent CAESAR candidate. This transformation is only specified as a look up table and the reason behind its choice is unknown. We managed to reverse-engineer this S-Box and describe its unpublished structure. Our decomposition allows a much more efficient hardware implementation but the choice of the components used is puzzling from a cryptographic perspective. This extended abstract does not explain how we found this decomposition. We will describe our process in an extended version of this paper. |
Year | Venue | Field |
---|---|---|
2015 | IACR Cryptology ePrint Archive | S-box,Secret sharing,Block cipher,Computer security,Cryptography,Computer science,Verifiable secret sharing,Hash function,Shamir's Secret Sharing,Homomorphic secret sharing |
DocType | Volume | Citations |
Journal | 2015 | 2 |
PageRank | References | Authors |
0.53 | 3 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Alex Biryukov | 1 | 2385 | 198.94 |
Léo Perrin | 2 | 54 | 9.85 |
Aleksei Udovenko | 3 | 2 | 2.56 |