Results 1 to 10 of about 1,010 (133)
On Large Tweaks in Tweakable Even-Mansour with Linear Tweak and Key Mixing
In this paper, we provide the first analysis of the Iterated Tweakable Even-Mansour cipher with linear tweak and key (or tweakey) mixing, henceforth referred as TEML, for an arbitrary tweak(ey) size kn for all k ≥ 1, and arbitrary number of rounds r ≥ 2.
Benoît Cogliati +3 more
doaj +1 more source
Indifferentiable hash functions in the standard model
Indifferentiability of iterated hash functions is seen as evidence that there are no structural flaws in the iteration structure of the algorithm. However, it is often overlooked that such considerations only hold in the random oracle model and do not ...
Juha Partala
doaj +1 more source
New indifferentiability security proof of MDPH hash function
MDPH is a double‐block‐length hash function proposed by Naito at Latincrypt 2019. This is a combination of Hirose's compression function and the domain extender called Merkle–Damgård with permutation.
Chun Guo +2 more
doaj +1 more source
Indifferentiability of the Sponge Construction with a Restricted Number of Message Blocks
The sponge construction is a popular method for hashing. Quickly after its introduction, the sponge was proven to be tightly indifferentiable from a random oracle up to ≈ 2c/2 queries, where c is the capacity.
Charlotte Lefevre
doaj +1 more source
Beyond-Birthday-Bound Secure Cryptographic Permutations from Ideal Ciphers with Long Keys
Coron et al. showed a construction of a 3-round 2n-bit cryptographic permutation from three independent n-bit ideal ciphers with n-bit keys (TCC 2010).
Ryota Nakamichi, Tetsu Iwata
doaj +1 more source
Chosen-Key Secure Even-Mansour Cipher from a Single Permutation
At EUROCRYPT 2015, Cogliati and Seurin proved that the 4-round Iterated Even-Mansour (IEM) cipher with Independent random Permutations and no key schedule EMIP4(k, u) = k⊕p4 ( k⊕p3 ( k⊕p2 (k⊕p1 (k⊕u)))) is sequentially indifferentiable from an ideal ...
Shanjie Xu, Qi Da, Chun Guo
doaj +1 more source
Errata to Sound Hashing Modes of Arbitrary Functions, Permutations, and Block Ciphers
In ToSC 2018(4), Daemen et al. performed an in-depth investigation of sound hashing modes based on arbitrary functions, permutations, or block ciphers. However, for the case of invertible primitives, there is a glitch.
Aldo Gunsing, Joan Daemen, Bart Mennink
doaj +1 more source
Crooked Indifferentiability Revisited
In CRYPTO 2018, Russell et al introduced the notion of crooked indifferentiability to analyze the security of a hash function when the underlying primitive is subverted. They showed that the $n$-bit to $n$-bit function implemented using enveloped XOR construction (\textsf{EXor}) with $3n+1$ many $n$-bit functions and $3n^2$-bit random initial vectors ...
Bhattacharyya, Rishiraj +2 more
openaire +2 more sources
A Novel Hash Function Based on a Chaotic Sponge and DNA Sequence
Many chaos-based hash functions have convoluted designs that are not based on proper design principles, complicating the verification of security claims.
Moatsum Alawida +5 more
doaj +1 more source
Indifferentiable Authenticated Encryption [PDF]
We study Authenticated Encryption with Associated Data (AEAD) from the viewpoint of composition in arbitrary (single-stage) environments. We use the indifferentiability framework to formalize the intuition that a "good" AEAD scheme should have random ciphertexts subject to de-cryptability.
Barbosa, Manuel, Farshim, Pooya
openaire +3 more sources

