Improved Cryptanalysis on Reduced-Round GOST and Whirlpool Hash Function

Ma, Bing‐Ji; Li, Bao; Hao, Ronglin; Li, Xiaoqian

doi:10.1007/978-3-319-07536-5_18

Cited by 17 publications

(8 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Ma et al describe a preimage attack that finds a single preimage of GOST-512 reduced to 6 rounds in 2 496 time and 2 64 memory or 2 504 time and 2 11 memory. In the same publication, they describe a collision attack with a time complexity of 2 181 and a memory demand of 2 64 [93]. If the message comprises more than 2 259 blocks, Guo et al describe a second preimage attack on full Streebog-512 with a total time complexity corresponding to 2 266 compression function evaluations [94].…”

Section: Streebogmentioning

confidence: 99%

A comprehensive review of the security flaws of hashing algorithms

Sadeghi-Nasab

Rafe

2022

J Comput Virol Hack Tech

View full text Add to dashboard Cite

Hash functions, which were originally designed for use in a few cryptographic schemes with specific security needs, have since become regular fare for many developers and protocol designers, who regard them as black boxes with magical characteristics. Message digesting, password verification, data structures, compiler operation and linking file name and path together are contemporary examples of hash functions applications. Since 2004, we've observed an exponential increase in the number and power of attacks against standard hash algorithms. In this paper, we investigated well known broken hashing algorithms. A hash function is said to be broken when an attack is found, which, by exploiting special details of how the hash function operates, finds a preimage, a second preimage or a collision faster than the corresponding generic attack. We collected information on all broken hashing algorithms, including their features, applications and attacks. To increase background knowledge, we also provide a summary of the types of attacks in this area.

show abstract

Section: Streebogmentioning

confidence: 99%

A comprehensive review of the security flaws of hashing algorithms

Sadeghi-Nasab

Rafe

2022

J Comput Virol Hack Tech

View full text Add to dashboard Cite

show abstract

“…The compression function operates in the Miyaguchi-Preneel mode and employs a 12-round AES-like cipher. Cryptoanalysis of Streebog hash function was a subject of intensive research [13][14][15].…”

Section: Sphincs + With Streebog Hash Functionmentioning

confidence: 99%

SPHINCS$^+$ post-quantum digital signature scheme with Streebog hash function

Kiktenko,

Bulychev,

Karagodin

et al. 2019

Preprint

View full text Add to dashboard Cite

Many commonly used public key cryptosystems will become insecure once a scalable quantum computer is built. New cryptographic schemes that can guarantee protection against attacks with quantum computers, so-called post-quantum algorithms, have emerged in recent decades. One of the most promising candidates for a post-quantum signature scheme is SPHINCS + , which is based on cryptographic hash functions. In this contribution, we analyze the use of the new Russian standardized hash function, known as Streebog, for the implementation of the SPHINCS + signature scheme. We provide a performance comparison with SHA-256-based instantiation and give benchmarks for various sets of parameters.

show abstract

“…Iwamoto presented a limited birthday distinguisher on 7-round whirlpool in 2013 [11]. And Ma et al improved extended the attack to 7.5 and 9 rounds [12]. Furthermore, Guo et al proposed a universal forgery and key recovery attacks on HMAC based on round-reduced Whirlpool, and a distinguishing-H attack on HMAC based on full Whirlpool [13,14].…”

Section: Introductionmentioning

confidence: 99%

Security Analysis of the Whirlpool Hash Function in the Cloud of Things

Li¹,

Gao²,

Gu³

et al. 2016

KSII TIIS

View full text Add to dashboard Cite

With the advancement and deployment of leading-edge telecommunication technologies for sensing and collecting, computing related information, Cloud of Things (CoTs) has emerged as a typical application platform that is envisioned to revolutionize the daily activities of human society, such as intelligent transportation, modern logistics, food safety, environmental monitoring, etc. To avoid any possible malicious attack and resource abuse, employing hash functions is widely recognized as one of the most effective approaches for CoTs to achieve message integrity and data authentication. The Whirlpool hash function has served as part of the joint ISO/IEC 10118-3 International Standard by the International Organization for Standardization (ISO) and the International Electrotechnical Commission (IEC). In this paper, we propose an effective differential fault analysis on Whirlpool in the byte-oriented random fault model. The mathematical analysis and experimental results show that 8 random faults on average are required to obtain the current 512-bit message input of whirlpool and the secret

show abstract

Improved Cryptanalysis on Reduced-Round GOST and Whirlpool Hash Function

Cited by 17 publications

References 24 publications

A comprehensive review of the security flaws of hashing algorithms

A comprehensive review of the security flaws of hashing algorithms

SPHINCS$^+$ post-quantum digital signature scheme with Streebog hash function

Security Analysis of the Whirlpool Hash Function in the Cloud of Things

Contact Info

Product

Resources

About