Finding collisions in the full SHA-1
Xiaoyun Wang,Yiqun Lisa Yin,Hongbo Yu +2 more
- pp 17-36
Reads0
Chats0
TLDR
This is the first attack on the full 80-step SHA-1 with complexity less than the 280 theoretical bound, and it is shown that collisions ofSHA-1 can be found with complexityLess than 269 hash operations.Abstract:
In this paper, we present new collision search attacks on the hash function SHA-1. We show that collisions of SHA-1 can be found with complexity less than 269 hash operations. This is the first attack on the full 80-step SHA-1 with complexity less than the 280 theoretical bound.read more
Citations
More filters
Book ChapterDOI
Chosen-Ciphertext attacks against MOSQUITO
Antoine Joux,Frédéric Muller +1 more
TL;DR: This paper goes further to break the last standing dedicated design of SSSC, i.e. the ECRYPT proposal MOSQUITO, and applies to ΓΥ (an ancestor of MOSquITO) therefore the only secure remaining S SSC are block-cipher-based constructions.
Book ChapterDOI
A Three-Property-Secure Hash Function
Elena Andreeva,Bart Preneel +1 more
TL;DR: In this article, the authors proposed a new hash construction based on the widely used Merkle-Damgard (MD) iteration, which achieves the three basic properties required from a cryptographic hash function: collision (Coll), second preimage (Sec), and preimage security.
Journal ArticleDOI
Hash-chain-based authentication for IoT
António Pinto,Ricardo Costa +1 more
TL;DR: This work proposes a modified hash-chain authentication mechanism that, with the help of a smartphone, can authenticate each interaction of the devices with a REST web-service using One Time Passwords (OTP) while using open wireless networks.
Proceedings ArticleDOI
Inferring OpenVPN State Machines Using Protocol State Fuzzing
TL;DR: This work infer state machines of the server-side implementation of OpenVPN and shows that they can reveal a lot of information about the implementation which is missing from the documentation, and discusses the possibility to include state machines in a formal specification.
One-Time Cookies: Preventing Session Hijacking Attacks with Disposable Credentials
TL;DR: It is demonstrated that one-time cookies can significantly improve the security of web sessions with minimal changes to current infrastructure and be efficient, easy to deploy and resistant to session hijacking.
References
More filters
Book ChapterDOI
How to break MD5 and other hash functions
Xiaoyun Wang,Hongbo Yu +1 more
TL;DR: A new powerful attack on MD5 is presented, which unlike most differential attacks, does not use the exclusive-or as a measure of difference, but instead uses modular integer subtraction as the measure.
Journal Article
Advances in Cryptology - EUROCRYPT 2005: 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques
TL;DR: This paper discusses Cryptography in High Dimensional Tori, a Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers, and reducing Complexity Assumptions for Statistically-Hiding Commitment.
BookDOI
Advances in Cryptology – CRYPTO 2004
TL;DR: A formal statistical framework for block cipher attacks based on this technique is developed and explicit and compact gain formulas for generalized versions of Matsui’s Algorithm 1 and Algorithm 2 are derived.