One Way Hash Functions and DES
From MaRDI portal
Recommendations
Cited in
(81)- On the impossibility of highly-efficient blockcipher-based hash functions
- Domain extender for collision resistant hash functions: Improving upon Merkle-Damgård iteration
- On the ring-LWE and polynomial-LWE problems
- New second preimage attacks on dithered hash functions with low memory complexity
- A practical anonymous payment scheme for electronic commerce
- Simple hash function using discrete-time quantum walks
- Cryptanalysis of SHA-0 and reduced SHA-1
- Specification governor for fault tolerant control of large-scale manufacturing systems
- Instantiation of quantum point obfuscation
- A quantum hash function with grouped coarse-grained boson sampling
- Collision-resistant and pseudorandom function based on Merkle-Damgård hash function
- Subquadratic SNARGs in the random oracle model
- \textsf{TEDT2} -- highly secure leakage-resilient TBC-based authenticated encryption
- A note on quantum collision resistance of double-block-length compression functions
- Layering quantum-resistance into classical digital signature algorithms
- Improved (semi-free-start/near-) collision and distinguishing attacks on round-reduced RIPEMD-160
- Generic attacks on hash combiners
- Cryptanalysis of MD2
- Hash function based on quantum walks
- The rebound attack and subspace distinguishers: application to Whirlpool
- On the security of RFID anti-counting security protocol (ACSP)
- Collision analysis of one kind of chaos-based hash function
- On the collision and preimage security of MDC-4 in the ideal cipher model
- Improved collision detection of MD5 with additional sufficient conditions
- Indifferentiability security of the fast wide pipe hash: breaking the birthday barrier
- Cryptanalysis of reduced-round Whirlwind
- A new non-Merkle-Damgård structural hash function with provable security
- Cryptanalysis of full \texttt{RIPEMD-128}
- A structure-based chaotic hashing scheme
- A provably secure non-iterative hash function resisting birthday attack
- Cryptanalysis of Grindahl
- How (Not) to Efficiently Dither Blockcipher-Based Hash Functions?
- Dakota – Hashing from a Combination of Modular Arithmetic and Symmetric Cryptography
- On the Strength of the Concatenated Hash Combiner When All the Hash Functions Are Weak
- New Techniques for Cryptanalysis of Hash Functions and Improved Attacks on Snefru
- Vortex: A New Family of One-Way Hash Functions Based on AES Rounds and Carry-Less Multiplication
- Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
- Keyed hash function based on a chaotic map
- A simple variant of the Merkle-Damgård scheme with a permutation
- New Constructions for Secure Hash Functions
- Modeling random oracles under unpredictable queries
- Concurrent signature without random oracles
- A new cipher scheme based on one-way Hash function and IDEA
- Some methods of hash functions analysis with application to the GOST P 34.11-94 algorithm
- MJH: a faster alternative to MDC-2
- Collapseability of tree hashes
- Streebog compression function as PRF in secret-key settings
- A digital signature scheme \(\text{mCFS}^{\text{QC-LDPC}}\) based on QC-LDPC codes
- How to Build a Hash Function from Any Collision-Resistant Function
- Boosting Merkle-Damgård Hashing for Message Authentication
- Extended Multi-Property-Preserving and ECM-Construction
- An Update on the Side Channel Cryptanalysis of MACs Based on Cryptographic Hash Functions
- A New Mode of Operation for Block Ciphers and Length-Preserving MACs
- Linear-XOR and Additive Checksums Don’t Protect Damgård-Merkle Hashes from Generic Attacks
- Hash Functions and RFID Tags: Mind the Gap
- An analysis of the blockcipher-based hash functions from PGV
- Related-key attacks on the compression function of Streebog
- Keyed Streebog is a secure PRF and MAC
- Randomized half-ideal cipher on groups with applications to UC (a)PAKE
- Block-cipher-based tree hashing
- Automatic classical and quantum rebound attacks on AES-like hashing by exploiting related-key differentials
- Double-block-length hash function for minimum memory size
- Simplified MITM modeling for permutations: new (quantum) attacks
- Zero-history confidential chains with zero-knowledge contracts: a new normal for decentralized ledgers?
- Constant-round arguments from one-way functions
- KIVR: committing authenticated encryption using redundancy and application to GCM, CCM, and more
- About ``\(k\)-bit security of MACs based on hash function Streebog
- New records in collision attacks on SHA-2
- Constant-round arguments for batch-verification and bounded-space computations from one-way functions
- New collision attacks on round-reduced \textsf{SHA-512}
- Generalized indifferentiable sponge and its application to Polygon Miden VM
- Breaking HWQCS: a code-based signature scheme from high weight QC-LDPC codes
- Quantum hash function scheme via continuous time quantum walks employing alternate Hamiltonian in evolution operator
- Improving tightness gap of GGM construction and its applications
- The first practical collision for 31-step SHA-256
- Quantum security of Trojan message attacks on Merkle-Damgård hash construction
- Sandwich BUFF: achieving non-resignability using iterative hash functions
- Novel CRT-based asymptotically ideal disjunctive hierarchical secret sharing scheme
- New records in collision attacks on SHA-2
- Increasing the flexibility of the herding attack
- Open problems in hash function security
This page was built for publication: One Way Hash Functions and DES
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6080285)
