Search
Search Results
-
Meet-in-the-Middle Preimage Attacks on Sponge-Based Hashing
The Meet-in-the-Middle (MitM) attack has been widely applied to preimage attacks on Merkle-Damgård (MD) hashing. In this paper, we introduce a...
-
Practical Homomorphic Evaluation of Block-Cipher-Based Hash Functions with Applications
Fully homomorphic encryption (FHE) is a powerful cryptographic technique allowing to perform computation directly over encrypted data. Motivated by...
-
Automatic Classical and Quantum Rebound Attacks on AES-Like Hashing by Exploiting Related-Key Differentials
Collision attacks on AES-like hashing (hash functions constructed by plugging AES-like ciphers or permutations into the famous PGV modes or their...
-
Comprehensive Preimage Security Evaluations on Rijndael-Based Hashing
The Meet-in-the-Middle (MITM) attack is one of the most powerful cryptanalysis techniques, as seen by its use in preimage attacks on MD4, MD5, Tiger,...
-
Diving Deep into the Preimage Security of AES-Like Hashing
Since the seminal works by Sasaki and Aoki, Meet-in-the-Middle (MITM) attacks are recognized as an effective technique for preimage and collision...
-
Simplified MITM Modeling for Permutations: New (Quantum) Attacks
Meet-in-the-middle (MITM) is a general paradigm where internal states are computed along two independent paths (‘forwards’ and ‘backwards’) that are...
-
Constructing Compression Functions
We have seen that cryptographic hash functions that can process arbitrarily long inputs can be built from fixed-input-length compression functions...
-
Automated Meet-in-the-Middle Attack Goes to Feistel
Feistel network and its generalizations (GFN) are another important building blocks for constructing hash functions, e.g., Simpira v2, Areion, and...
-
Automatic Search of Meet-in-the-Middle Preimage Attacks on AES-like Hashing
The Meet-in-the-Middle (MITM) preimage attack is highly effective in breaking the preimage resistance of many hash functions, including but not...
-
Cryptanalysis of hash functions based on blockciphers suitable for IoT service platform security
It is well-known that blockcipher-based hash functions may be attacked when adopting blockciphers having related-key differential properties....
-
Non-Uniform Bounds in the Random-Permutation, Ideal-Cipher, and Generic-Group Models
The random-permutation model (RPM) and the ideal-cipher model (ICM) are idealized models that offer a simple and intuitive way to assess the...
-
Security of Truncated Permutation Without Initial Value
Indifferentiability is a powerful notion in cryptography. If a construction is proven to be indifferentiable from an ideal object, it can under...
-
Fog Computing in the IoT Environment: Principles, Features, and Models
Internet of ThingsInternet of Things , abbreviated as IoTIoT , is a distributed computing environment that is full of promise, hel** to shape the...
-
Building indifferentiable compression functions from the PGV compression functions
Preneel, Govaerts and Vandewalle (PGV) analysed the security of single-block-length block cipher based compression functions assuming that the...
-
Fast Message Franking: From Invisible Salamanders to Encryptment
Message franking enables cryptographically verifiable reporting of abusive messages in end-to-end encrypted messaging. Grubbs, Lu, and Ristenpart...
-
Truncated differential based known-key attacks on round-reduced SIMON
At Crypto 2015, Blondeau, Peyrin and Wang proposed a truncated-differential-based known-key attack on full PRESENT, a nibble oriented lightweight...
-
An Efficient Construction of a Compression Function for Cryptographic Hash
A cryptographic hash \(\left( \text {CH}\right) \) is...
-
On the Impact of Known-Key Attacks on Hash Functions
Hash functions are often constructed based on permutations or blockciphers, and security proofs are typically done in the ideal permutation or cipher...
-
Improved preimage attacks on hash modes of 8-round AES-256
We observe the slow diffusion of the AES key schedule for 256-bit keys and find weakness which can be used in the preimage attack on its Davies-Meyer...
-
Open problems in hash function security
A cryptographic hash function compresses arbitrarily long messages to digests of a short and fixed length. Most of existing hash functions are...
