Cryptanalysis of the GOST Hash Function
From MaRDI portal
Publication:3600219
DOI10.1007/978-3-540-85174-5_10zbMath1183.94042WikidataQ60360197 ScholiaQ60360197MaRDI QIDQ3600219
Norbert Pramstaller, Marcin Kontak, Christian Rechberger, Florian Mendel, Janusz Szmidt
Publication date: 10 February 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-85174-5_10
94A60: Cryptography
Related Items
Analysis of the Kupyna-256 Hash Function, Некоторые методы анализа функций хэширования и их применение к алгоритму ГОСТ Р 34.11-94, StriBob: аутентифицированное шифрование с помощью подстановки LPS из ГОСТ Р 34.11-2012, Стойкость ГОСТ Р 34.11-2012 к атаке поиска прообраза и к атаке поиска коллизий, CRYPTANALYSIS OF GOST IN THE MULTIPLE-KEY SCENARIO, Practical-time related-key attack on GOST with secret S-boxes, A single-key attack on the full GOST block cipher, Cryptanalysis of MD2, Distinguisher on full-round compression function of GOST R, Aggregated differentials and cryptanalysis of PP-1 and GOST, Integral distinguishers for reduced-round Stribog, Impossible Differential Properties of Reduced Round Streebog, A Single-Key Attack on the Full GOST Block Cipher, Structural Attacks on Two SHA-3 Candidates: Blender-n and DCH-n, Cryptanalysis of the Round-Reduced GOST Hash Function
Cites Work
- Unnamed Item
- Unnamed Item
- Some observations on the theory of cryptographic hash functions
- Key-Schedule Cryptanalysis of IDEA, G-DES, GOST, SAFER, and Triple-DES
- Cryptanalysis of the Tiger Hash Function
- A (Second) Preimage Attack on the GOST Hash Function
- Advances in Cryptology – CRYPTO 2004
- Multi-block Collisions in Hash Functions Based on 3C and 3C+ Enhancements of the Merkle-Damgård Construction
- Cryptanalysis of the Hash Functions MD4 and RIPEMD
- How to Break MD5 and Other Hash Functions
- Known-Key Distinguishers for Some Block Ciphers
- Chosen-Prefix Collisions for MD5 and Colliding X.509 Certificates for Different Identities
- Finding Collisions in the Full SHA-1
- Collisions for 70-Step SHA-1: On the Full Cost of Collision Search
- Linear-XOR and Additive Checksums Don’t Protect Damgård-Merkle Hashes from Generic Attacks
- Finding SHA-1 Characteristics: General Results and Applications
- Fast Software Encryption
- Fast Software Encryption