Finding Collisions in the Full SHA-1
From MaRDI portal
Publication:5451016
Recommendations
Cited in
(only showing first 100 items - show all)- Classification and generation of disturbance vectors for collision attacks against SHA-1
- Practical collisions for SHAMATA-256
- New Key-Recovery Attacks on HMAC/NMAC-MD4 and NMAC-MD5
- One-key compression function based MAC with security beyond birthday bound
- A SAT-based preimage analysis of reduced \textsc{Keccak} hash functions
- Cryptanalysis of GOST R hash function
- Colliding Message Pair for 53-Step HAS-160
- Collision Search Attack for 53-Step HAS-160
- The rebound attack and subspace distinguishers: application to Whirlpool
- An Efficient Encapsulation Scheme from Near Collision Resistant Pseudorandom Generators and Its Application to IBE-to-PKE Transformations
- Verifiable Multi-secret Sharing Schemes for Multiple Threshold Access Structures
- Cryptanalysis of the CRUSH Hash Function
- Preimage attacks on 4-round Keccak by solving multivariate quadratic systems
- A (Second) Preimage Attack on the GOST Hash Function
- Efficient implementation of SHA-3 hash function on 8-bit AVR-based sensor nodes
- A New Strategy for Finding a Differential Path of SHA-1
- How to Fill Up Merkle-Damgård Hash Functions
- New proofs for NMAC and HMAC: security without collision resistance
- A Three-Property-Secure Hash Function
- Cryptanalysis of the GOST Hash Function
- On the Weak Ideal Compression Functions
- Weaknesses in the HAS-V Compression Function
- Quantum cryptanalysis of the full AES-256-based Davies-Meyer, Hirose and MJH hash functions
- Compression from Collisions, or Why CRHF Combiners Have a Long Output
- Another step towards realizing random oracles: non-malleable point obfuscation
- Speeding up Collision Search for Byte-Oriented Hash Functions
- Optimal covering codes for finding near-collisions
- Practical-time related-key attack on GOST with secret S-boxes
- The Delicate Issues of Addition with Respect to XOR Differences
- Second order collision for the 42-step reduced DHA-256 hash function
- Attacking Reduced Round SHA-256
- Non-linear Reduced Round Attacks against SHA-2 Hash Family
- Second Preimage Attack on 5-Pass HAVAL and Partial Key-Recovery Attack on HMAC/NMAC-5-Pass HAVAL
- Analysis of the Collision Resistance of RadioGatúnUsing Algebraic Techniques
- Practical Collisions for EnRUPT
- On the ring-LWE and polynomial-LWE problems
- The first collision for full SHA-1
- The Impact of Carries on the Complexity of Collision Attacks on SHA-1
- MD4 is Not One-Way
- Freestart collision for full SHA-1
- Practical free-start collision attacks on 76-step 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
- Comment on ``Cryptanalysis and improvement of the secure quantum sealed-bid auction with post confirmation
- Cryptanalysis of SHA-0 and reduced SHA-1
- Agile cryptography: a universally composable approach
- Boomerang Distinguisher for the SIMD-512 Compression Function
- Improving smart card security using elliptic curve cryptography over prime field \((F_{p})\)
- Cryptanalysis of Grindahl
- Quantum attacks on hash constructions with low quantum random access memory
- Hash Functions from Sigma Protocols and Improvements to VSH
- A vulnerability in implementations of SHA-3, SHAKE, EdDSA, and other NIST-approved algorithms
- A provably secure short signature scheme based on discrete logarithms
- A fingerprint encryption scheme based on irreversible function and secure authentication
- Topics in Cryptology – CT-RSA 2006
- Algebraic Attacks on Round-Reduced Keccak
- Quantum and semi-quantum lottery: strategies and advantages
- A CDH-Based Strongly Unforgeable Signature Without Collision Resistant Hash Function
- Analysis of Reduced-SHAvite-3-256 v2
- Analysis of Boomerang Differential Trails via a SAT-Based Constraint Solver URSA
- New Differential-Algebraic Attacks and Reparametrization of Rainbow
- Meet-in-the-middle preimage attacks on sponge-based hashing
- How to Use Merkle-Damgård — On the Security Relations between Signature Schemes and Their Inner Hash Functions
- Dakota – Hashing from a Combination of Modular Arithmetic and Symmetric Cryptography
- Password Recovery on Challenge and Response: Impossible Differential Attack on Hash Function
- Collisions for Round-Reduced LAKE
- 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
- A Novel Approach for Constructing One-Way Hash Function Based on a Message Block Controlled 8D Hyperchaotic Map
- Collisions for RC4-Hash
- Does Secure Time-Stamping Imply Collision-Free Hash Functions?
- Digital Signatures Out of Second-Preimage Resistant Hash Functions
- Producing Collisions for Panama, Instantaneously
- Related-Key Attacks on the Py-Family of Ciphers and an Approach to Repair the Weaknesses
- Robust multi-property combiners for hash functions
- Rotational rebound attacks on reduced Skein
- Topics in Cryptology – CT-RSA 2005
- Cryptanalysis of the Round-Reduced GOST Hash Function
- Cryptanalysis of full \texttt{RIPEMD-128}
- New second-preimage attacks on hash functions
- A structure-based chaotic hashing scheme
- Searching for Messages Conforming to Arbitrary Sets of Conditions in SHA-256
- Multiobjective evolutionary optimization techniques based hyperchaotic map and their applications in image encryption
- MILP-aided cube-attack-like cryptanalysis on Keccak keyed modes
- Security analysis of SIMD
- Analysis of message injection in stream cipher-based hash functions
- Collisions of MMO-MD5 and their impact on original MD5
- Collision resistant double-length hashing
- On the impossibility of highly-efficient blockcipher-based hash functions
- Multi-collision Attack on the Compression Functions of MD4 and 3-Pass HAVAL
- Security of NMAC and HMAC Based on Non-malleability
- Attacks on a double length blockcipher-based hash proposal
- Collisions of SHA-0 and Reduced SHA-1
- Security analysis of randomize-hash-then-sign digital signatures
- Collisions for 70-Step SHA-1: On the Full Cost of Collision Search
- Efficient Collision Search Attacks on SHA-0
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)
