New types of cryptanalytic attacks using related keys
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Truncated Differentials of SAFER
Proceedings of the Third International Workshop on Fast Software Encryption
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
A (Second) Preimage Attack on the GOST Hash Function
Fast Software Encryption
Cryptanalysis of the GOST Hash Function
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Reflection Cryptanalysis of Some Ciphers
INDOCRYPT '08 Proceedings of the 9th International Conference on Cryptology in India: Progress in Cryptology
256 bit standardized crypto for 650 GE: GOST revisited
CHES'10 Proceedings of the 12th international conference on Cryptographic hardware and embedded systems
A single-key attack on the full GOST block cipher
FSE'11 Proceedings of the 18th international conference on Fast software encryption
First differential attack on full 32-round GOST
ICICS'11 Proceedings of the 13th international conference on Information and communications security
Differential cryptanalysis of PP-1 cipher
Annales UMCS, Informatica - Cryptography and data protection
On the strength evaluation of lesamnta against differential cryptanalysis
ICSI'10 Proceedings of the First international conference on Advances in Swarm Intelligence - Volume Part II
A related-key attack on block ciphers with weak recurrent key schedules
FPS'11 Proceedings of the 4th Canada-France MITACS conference on Foundations and Practice of Security
FSE'07 Proceedings of the 14th international conference on Fast Software Encryption
FSE'12 Proceedings of the 19th international conference on Fast Software Encryption
| Hi-index | 0.00 |
The block cipher GOST was proposed in former Soviet Union in 1989. In this paper we present the first result of differential cryptanalysis of GOST with reduced number of rounds. By introducing the idea of using a set of differential characteristics, which is a partitioning type, we can reduce the influence of the key value upon the probability as well as get high differential probability. Using 251 chosen plaintexts the key of 13-round GOST can be obtained. Next this differential cryptanalysis is expanded with combining related-key attack. Using 256 chosen plaintexts the key of 21 rounds of GOST can be obtained.