Algebraic Cryptanalysis of 58-Round SHA-1

Sugita, Makoto; Kawazoe, Mitsuru; Perret, Ludovic; Imai, Hideki

doi:10.1007/978-3-540-74619-5_22

Cited by 18 publications

(13 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The first collision attack (of complexity about 2 69 ) on SHA-1 appeared in 2005, together with a series of collision attacks on other hash functions with Xiaoyun Wang as the dominating character. Cryptanalytic results and other observations on SHA-1 appear in [17,30,51,52,80,129,158,159,169,201,215,221].…”

Section: Sha-1mentioning

confidence: 86%

Cryptographic Hash Functions

Gauravaram¹,

Knudsen²

2010

Encyclopedia of Information Assurance

View full text Add to dashboard Cite

Section: Sha-1mentioning

confidence: 86%

Cryptographic Hash Functions

Gauravaram¹,

Knudsen²

2010

Encyclopedia of Information Assurance

View full text Add to dashboard Cite

“…However, for stream ciphers, algebraic attacks [4,14] seem to work fine, as for some public key systems [22,23] and other primitives [37]. We want to note that even round reduced variants of Trivium has escaped all efforts to be broken by purely algebraic methods.…”

Section: Related Workmentioning

confidence: 99%

Advanced Algebraic Attack on Trivium

Quedenfeld

Wolf

2016

Mathematical Aspects of Computer and Information Sciences

View full text Add to dashboard Cite

Abstract. This paper presents an algebraic attack against Trivium that breaks 625 rounds using only 4096 bits of output in an overall time complexity of 2 42.2 Trivium computations. While other attacks can do better in terms of rounds (799), this is a practical attack with a very low data usage (down from 2 40 output bits) and low computation time (down from 2 62 ). From another angle, our attack can be seen as a proof of concept: how far can algebraic attacks can be pushed when several known techniques are combined into one implementation? All attacks have been fully implemented and tested; our figures are therefore not the result of any potentially error-prone extrapolation, but results of practical experiments.

show abstract

“…They demonstrate that this technique can be used to solve the hard case of inverting a popular secure hash function and were able to invert MD4 up to 2 rounds and 7 steps in less than 8 hours. In [24], Sugita et al used the Gröbner basis to improve the attack on the 58-round SHA-1 hash function to 2 31 computations instead of 2 34 in Wang's method [25].…”

Section: Modern Algebraic Tools and Their Applications To Cryptographymentioning

confidence: 99%

A Comparison between Two Off-the-Shelf Algebraic Tools for Extraction of Cryptographic Keys from Corrupted Memory Images

Kamal

Zahno²,

Youssef³

2013

Security Engineering and Intelligence Informatics

View full text Add to dashboard Cite

Abstract.Cold boot attack is a class of side channel attacks which exploits the data remanence property of random access memory (RAM) to retrieve its contents which remain readable shortly after its power has been removed. Specialized algorithms have been previously proposed to recover cryptographic keys of several ciphers from decayed memory images. However, these techniques were cipher-dependent and certainly uneasy to develop and fine tune. On the other hand, for symmetric ciphers, the relations that have to be satisfied between the subround key bits in the key schedule always correspond to a set of nonlinear Boolean equations. In this paper, we investigate the use of an off-the-shelf SAT solver (CryptoMiniSat), and an open source Gröbner basis tool (PolyBoRi) to solve the resulting system of equations. We also provide the pros and cons of both approaches and present some simulation results for the extraction of AES and Serpent keys from decayed memory images using these tools.

show abstract

Algebraic Cryptanalysis of 58-Round SHA-1

Cited by 18 publications

References 12 publications

Cryptographic Hash Functions

Cryptographic Hash Functions

Advanced Algebraic Attack on Trivium

A Comparison between Two Off-the-Shelf Algebraic Tools for Extraction of Cryptographic Keys from Corrupted Memory Images

Contact Info

Product

Resources

About