Finding Collisions in the Full SHA-1
From MaRDI portal
Publication:5451016
Recommendations
Cited in
(only showing first 100 items - show all)- Interpreting hash function security proofs
- Collisions for RC4-Hash
- The Impact of Carries on the Complexity of Collision Attacks on SHA-1
- Analysis of Boomerang Differential Trails via a SAT-Based Constraint Solver URSA
- Boomerang distinguishers on MD4-family: first practical results on full 5-pass HAVAL
- Comment on ``Cryptanalysis and improvement of the secure quantum sealed-bid auction with post confirmation
- Does Secure Time-Stamping Imply Collision-Free Hash Functions?
- Structural Attacks on Two SHA-3 Candidates: Blender-n and DCH-n
- Producing Collisions for PANAMA
- Matrix representation of conditions for the collision attack of SHA-1 and its application to the message modification
- Integral distinguishers for reduced-round Stribog
- Experimental verification of super-Sbox analysis -- confirmation of detailed attack complexity
- Quantum algorithm to find invariant linear structure of \(MD\) hash functions
- Digital Signatures Out of Second-Preimage Resistant Hash Functions
- Cryptanalysis of the GOST Hash Function
- Improved (semi-free-start/near-) collision and distinguishing attacks on round-reduced RIPEMD-160
- The phantom of differential characteristics
- A fast pseudorandom number generator with BLAKE hash function
- Automatic search for the best trails in ARX: application to block cipher \textsc{Speck}
- New records of pre-image search of reduced SHA-1 using SAT solvers
- A secure and efficient on-line/off-line group key distribution protocol
- Attacking Reduced Round SHA-256
- Non-linear Reduced Round Attacks against SHA-2 Hash Family
- Collision resistant double-length hashing
- Quantum cryptanalysis of the full AES-256-based Davies-Meyer, Hirose and MJH hash functions
- A (Second) Preimage Attack on the GOST Hash Function
- Second order collision for the 42-step reduced DHA-256 hash function
- Multiobjective evolutionary optimization techniques based hyperchaotic map and their applications in image encryption
- Boomerang attack on step-reduced SHA-512
- Security analysis of SIMD
- Boomerang Distinguisher for the SIMD-512 Compression Function
- Triangulating rebound attack on AES-like hashing
- Analysis of message injection in stream cipher-based hash functions
- Collisions of MMO-MD5 and their impact on original MD5
- Meet-in-the-middle preimage attacks on sponge-based hashing
- Generic attacks on hash combiners
- Distinguishing Attack on the Secret-Prefix MAC Based on the 39-Step SHA-256
- Optimal covering codes for finding near-collisions
- Security of Digital Signature Schemes in Weakened Random Oracle Models
- Information Security and Cryptology - ICISC 2005
- MILP-aided cube-attack-like cryptanalysis on Keccak keyed modes
- Weaknesses in the HAS-V Compression Function
- Automatic verification of differential characteristics: application to reduced Gimli
- Preimage attacks on 4-round Keccak by solving multivariate quadratic systems
- Cryptanalysis of SHA-0 and reduced SHA-1
- Analysis of Reduced-SHAvite-3-256 v2
- Multi-collision Attack on the Compression Functions of MD4 and 3-Pass HAVAL
- Improving smart card security using elliptic curve cryptography over prime field \((F_{p})\)
- Practical Collisions for EnRUPT
- Collision attack on the full extended MD4 and pseudo-preimage attack on RIPEMD
- Finding hash collisions with quantum computers by using differential trails with smaller probability than birthday bound
- The design of keyed hash function based on CNN-MD structure
- Cryptanalysis of the Round-Reduced GOST Hash Function
- A vulnerability in implementations of SHA-3, SHAKE, EdDSA, and other NIST-approved algorithms
- Cryptanalysis of the CRUSH Hash Function
- An Efficient Encapsulation Scheme from Near Collision Resistant Pseudorandom Generators and Its Application to IBE-to-PKE Transformations
- A Novel Elliptic Curve Cryptography Based Approach of Re-watermarking for Cheque Truncation System
- Public Key Authentication with Memory Tokens
- Classification of disturbance vectors for collision attack in SHA-1
- Generic MitM attack frameworks on sponge constructions
- A CDH-Based Strongly Unforgeable Signature Without Collision Resistant Hash Function
- That's not my signature! Fail-stop signatures for a post-quantum world
- Related-Key Attacks on the Py-Family of Ciphers and an Approach to Repair the Weaknesses
- Practical-time related-key attack on GOST with secret S-boxes
- How to Use Merkle-Damgård — On the Security Relations between Signature Schemes and Their Inner Hash Functions
- Analysis of RIPEMD-160: new collision attacks and finding characteristics with MILP
- Efficient Hash Collision Search Strategies on Special-Purpose Hardware
- Second Preimage Attack on 5-Pass HAVAL and Partial Key-Recovery Attack on HMAC/NMAC-5-Pass HAVAL
- Exploring formal methods for cryptographic hash function implementations
- Producing Collisions for Panama, Instantaneously
- Analysis of the Collision Resistance of RadioGatúnUsing Algebraic Techniques
- Colliding Message Pair for 53-Step HAS-160
- Collision Search Attack for 53-Step HAS-160
- Quantum attacks on hash constructions with low quantum random access memory
- New records in collision attacks on SHA-2
- Topics in Cryptology – CT-RSA 2006
- A Novel Approach for Constructing One-Way Hash Function Based on a Message Block Controlled 8D Hyperchaotic Map
- Information Security
- A New Strategy for Finding a Differential Path of SHA-1
- Searching for Messages Conforming to Arbitrary Sets of Conditions in SHA-256
- Quantum and semi-quantum lottery: strategies and advantages
- Dakota – Hashing from a Combination of Modular Arithmetic and Symmetric Cryptography
- Password Recovery on Challenge and Response: Impossible Differential Attack on Hash Function
- Allocating rotational cryptanalysis-based preimage attack on 4-round \textsc{Keccak}-224 for quantum setting
- Collisions for Round-Reduced LAKE
- On the Weak Ideal Compression Functions
- Agile cryptography: a universally composable approach
- Practical Analysis of Reduced-Round Keccak
- Freestart collision for full SHA-1
- New Differential-Algebraic Attacks and Reparametrization of Rainbow
- How to Build a Hash Function from Any Collision-Resistant Function
- A provably secure non-iterative hash function resisting birthday attack
- Security analysis of randomize-hash-then-sign digital signatures
- MD4 is Not One-Way
- Constructing chaos-based hash function via parallel impulse perturbation
- Efficient implementation of SHA-3 hash function on 8-bit AVR-based sensor nodes
- Second Preimage Attack on 3-Pass HAVAL and Partial Key-Recovery Attacks on HMAC/NMAC-3-Pass HAVAL
- A Three-Property-Secure Hash Function
- Attacks on a double length blockcipher-based hash proposal
- Compression from Collisions, or Why CRHF Combiners Have a Long Output
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)
