Finding Collisions in the Full SHA-1
From MaRDI portal
Publication:5451016
DOI10.1007/11535218_2zbMATH Open1145.94454DBLPconf/crypto/WangYY05aOpenAlexW1656731780WikidataQ30053158 ScholiaQ30053158MaRDI QIDQ5451016FDOQ5451016
Authors: Xiaoyun Wang, Yiqun Lisa Yin, Hongbo Yu 
Publication date: 17 March 2008
Published in: Advances in Cryptology – CRYPTO 2005 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11535218_2
Recommendations
Cited In (only showing first 100 items - show all)
- One-key compression function based MAC with security beyond birthday bound
- The rebound attack and subspace distinguishers: application to Whirlpool
- Verifiable Multi-secret Sharing Schemes for Multiple Threshold Access Structures
- A SAT-based preimage analysis of reduced \textsc{Keccak} hash functions
- Cryptanalysis of GOST R hash function
- How to Fill Up Merkle-Damgård Hash Functions
- A Three-Property-Secure Hash Function
- Efficient implementation of SHA-3 hash function on 8-bit AVR-based sensor nodes
- New proofs for NMAC and HMAC: security without collision resistance
- Compression from Collisions, or Why CRHF Combiners Have a Long Output
- Speeding up Collision Search for Byte-Oriented Hash Functions
- The Delicate Issues of Addition with Respect to XOR Differences
- Another step towards realizing random oracles: non-malleable point obfuscation
- On the ring-LWE and polynomial-LWE problems
- The first collision for full SHA-1
- MD4 is Not One-Way
- Practical free-start collision attacks on 76-step SHA-1
- Freestart collision for full SHA-1
- Practical Near-Collisions and Collisions on Round-Reduced ECHO-256 Compression Function
- Linear-XOR and Additive Checksums Don’t Protect Damgård-Merkle Hashes from Generic Attacks
- Second Preimage Attack on 3-Pass HAVAL and Partial Key-Recovery Attacks on HMAC/NMAC-3-Pass HAVAL
- Survey of information security
- Cryptanalysis of Grindahl
- Hash Functions from Sigma Protocols and Improvements to VSH
- Algebraic Attacks on Round-Reduced Keccak
- A provably secure short signature scheme based on discrete logarithms
- A fingerprint encryption scheme based on irreversible function and secure authentication
- New Differential-Algebraic Attacks and Reparametrization of Rainbow
- Advances in Cryptology – CRYPTO 2004
- Verifiable shuffles: a formal model and a Paillier-based three-round construction with provable security
- Multi-property Preserving Combiners for Hash Functions
- On Free-Start Collisions and Collisions for TIB3
- Topics in Cryptology – CT-RSA 2005
- Robust multi-property combiners for hash functions
- Rotational rebound attacks on reduced Skein
- Cryptanalysis of full \texttt{RIPEMD-128}
- New second-preimage attacks on hash functions
- A structure-based chaotic hashing scheme
- Security of NMAC and HMAC Based on Non-malleability
- Collisions of SHA-0 and Reduced SHA-1
- On the impossibility of highly-efficient blockcipher-based hash functions
- Collisions for 70-Step SHA-1: On the Full Cost of Collision Search
- Efficient Collision Search Attacks on SHA-0
- Finding SHA-1 Characteristics: General Results and Applications
- Security analysis of randomize-hash-then-sign digital signatures
- Attacks on a double length blockcipher-based hash proposal
- Chaotic hash function based on the dynamic S-box with variable parameters
- Cryptanalysis of a Hash Function Based on Quasi-cyclic Codes
- Concurrent signature without random oracles
- Collision attack on \({\mathtt Grindahl}\)
- Constructing keyed hash algorithm using enhanced chaotic map with varying parameter
- Practical Analysis of Reduced-Round Keccak
- A provably secure non-iterative hash function resisting birthday attack
- A synthetic indifferentiability analysis of some block-cipher-based hash functions
- Cryptanalysis on HMAC/NMAC-MD5 and MD5-MAC
- A characterization of chameleon hash functions and new, efficient designs
- Improved cryptanalysis of AES-like permutations
- Open problems in hash function security
- Constructing chaos-based hash function via parallel impulse perturbation
- Partial-collision attack on the round-reduced compression function of Skein-256
- Internal differential collision attacks on the reduced-round Grøstl-0 hash function
- How to Build a Hash Function from Any Collision-Resistant Function
- Hash Functions and RFID Tags: Mind the Gap
- MJH: a faster alternative to MDC-2
- Chaotic hash function based on circular shifts with variable parameters
- Finding SHA-2 characteristics: searching through a minefield of contradictions
- Hash function requirements for Schnorr signatures
- Memoryless near-collisions via coding theory
- New collision attacks on SHA-1 based on optimal joint local-collision analysis
- Herding Hash Functions and the Nostradamus Attack
- On Randomizing Hash Functions to Strengthen the Security of Digital Signatures
- New Key-Recovery Attacks on HMAC/NMAC-MD4 and NMAC-MD5
- Classification and generation of disturbance vectors for collision attacks against SHA-1
- An efficient ring signature scheme from pairings
- Practical collisions for SHAMATA-256
- A (Second) Preimage Attack on the GOST Hash Function
- Preimage attacks on 4-round Keccak by solving multivariate quadratic systems
- Cryptanalysis of the GOST Hash Function
- Weaknesses in the HAS-V Compression Function
- Quantum cryptanalysis of the full AES-256-based Davies-Meyer, Hirose and MJH hash functions
- Optimal covering codes for finding near-collisions
- Attacking Reduced Round SHA-256
- Non-linear Reduced Round Attacks against SHA-2 Hash Family
- Second order collision for the 42-step reduced DHA-256 hash function
- Practical Collisions for EnRUPT
- The Impact of Carries on the Complexity of Collision Attacks on SHA-1
- Comment on ``Cryptanalysis and improvement of the secure quantum sealed-bid auction with post confirmation
- Boomerang Distinguisher for the SIMD-512 Compression Function
- A Mathematical Problem for Security Analysis of Hash Functions and Pseudorandom Generators
- Cryptanalysis of SHA-0 and reduced SHA-1
- Improving smart card security using elliptic curve cryptography over prime field \((F_{p})\)
- A vulnerability in implementations of SHA-3, SHAKE, EdDSA, and other NIST-approved algorithms
- Meet-in-the-middle preimage attacks on sponge-based hashing
- Analysis of Reduced-SHAvite-3-256 v2
- Analysis of Boomerang Differential Trails via a SAT-Based Constraint Solver URSA
- Collisions for RC4-Hash
- Does Secure Time-Stamping Imply Collision-Free Hash Functions?
- Digital Signatures Out of Second-Preimage Resistant Hash Functions
- Cryptanalysis of the Round-Reduced GOST Hash Function
- Collision resistant double-length hashing
This page was built for publication: Finding Collisions in the Full SHA-1
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5451016)
