scientific article; zbMATH DE number 1024070
From MaRDI portal
Publication:4341762
zbMath0877.94039MaRDI QIDQ4341762
René Govaerts, Bart Preneel, Joos Vandewalle
Publication date: 18 June 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (68)
Blockcipher-Based Double-Length Hash Functions for Pseudorandom Oracles ⋮ Construction of one-way hash functions with increased key space using adaptive chaotic maps ⋮ The Whirlpool Secure Hash Function ⋮ New criterion for diffusion property and applications to improved GFS and EGFN ⋮ Cryptanalysis of Reduced-Round Whirlwind ⋮ Characterizing collision and second-preimage resistance in Linicrypt ⋮ An analysis of the blockcipher-based hash functions from PGV ⋮ Security analysis of randomize-hash-then-sign digital signatures ⋮ Towards Understanding the Known-Key Security of Block Ciphers ⋮ Security analysis of Even-Mansour structure hash functions ⋮ Open problems in hash function security ⋮ Cryptanalysis of Grindahl ⋮ Indifferentiability of the confusion-diffusion network and the cascade block cipher ⋮ Known-key distinguishers on type-1 Feistel scheme and near-collision attacks on its hashing modes ⋮ Meet-in-the-middle preimage attacks on sponge-based hashing ⋮ Randomized half-ideal cipher on groups with applications to UC (a)PAKE ⋮ Superposition meet-in-the-middle attacks: updates on fundamental security of AES-like hashing ⋮ Block-cipher-based tree hashing ⋮ How (Not) to Efficiently Dither Blockcipher-Based Hash Functions? ⋮ The universality of iterated hashing over variable-length strings ⋮ Security of truncated permutation without initial value ⋮ Automatic classical and quantum rebound attacks on AES-like hashing by exploiting related-key differentials ⋮ Collision attack on \({\mathtt Grindahl}\) ⋮ Simplified MITM modeling for permutations: new (quantum) attacks ⋮ \textsc{Poseidon}2: a faster version of the \textsc{Poseidon} hash function ⋮ \texttt{Horst} meets \textit{Fluid}-SPN: Griffin for zero-knowledge applications ⋮ Beyond birthday bound secure fresh rekeying: application to authenticated encryption ⋮ A simple variant of the Merkle-Damgård scheme with a permutation ⋮ Security of permutation-based compression function {\textsf{lp}}231 ⋮ A new black box analysis of hash functions based on block ciphers ⋮ How to Build a Hash Function from Any Collision-Resistant Function ⋮ New Constructions for Secure Hash Functions ⋮ MJH: a faster alternative to MDC-2 ⋮ Analysis of Message Injection in Stream Cipher-Based Hash Functions ⋮ Collisions of MMO-MD5 and Their Impact on Original MD5 ⋮ On the Security of Hash Functions Employing Blockcipher Postprocessing ⋮ Meet-in-the-Middle Preimage Attacks on AES Hashing Modes and an Application to Whirlpool ⋮ Known-Key Distinguishers on 11-Round Feistel and Collision Attacks on Its Hashing Modes ⋮ Optimal collision security in double block length hashing with single length key ⋮ Truncated differential based known-key attacks on round-reduced SIMON ⋮ Collision Resistant Double-Length Hashing ⋮ Interpreting Hash Function Security Proofs ⋮ Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers ⋮ Pseudorandom-Function Property of the Step-Reduced Compression Functions of SHA-256 and SHA-512 ⋮ Building indifferentiable compression functions from the PGV compression functions ⋮ 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 ⋮ MJH: A Faster Alternative to MDC-2 ⋮ Expedient Non-malleability Notions for Hash Functions ⋮ Cryptanalysis of the Authenticated Encryption Algorithm COFFE ⋮ Speeding up Collision Search for Byte-Oriented Hash Functions ⋮ A synthetic indifferentiability analysis of some block-cipher-based hash functions ⋮ On Randomizing Hash Functions to Strengthen the Security of Digital Signatures ⋮ Salvaging Merkle-Damgård for Practical Applications ⋮ Optimised probabilistic active learning (OPAL) ⋮ A New Double-Block-Length Hash Function Using Feistel Structure ⋮ Automatic search of meet-in-the-middle preimage attacks on AES-like hashing ⋮ Distinguishers for Ciphers and Known Key Attack against Rijndael with Large Blocks ⋮ Security of Practical Cryptosystems Using Merkle-Damgård Hash Function in the Ideal Cipher Model ⋮ Cryptanalysis of Tweaked Versions of SMASH and Reparation ⋮ A Scheme to Base a Hash Function on a Block Cipher ⋮ On the impossibility of highly-efficient blockcipher-based hash functions ⋮ Linicrypt: A Model for Practical Cryptography ⋮ Structural Attacks on Two SHA-3 Candidates: Blender-n and DCH-n ⋮ Preimage resistance of \(\mathsf{LP}mkr\) with \(r=m-1\) ⋮ Integrality Authentication Scheme of Bluetooth Baseband Packet Header Based on Key Stream ⋮ Faster Multicollisions ⋮ Quantum cryptanalysis of the full AES-256-based Davies-Meyer, Hirose and MJH hash functions
This page was built for publication:
