Search
Search Results
-
On the Security of Keyed Hashing Based on Public Permutations
Doubly-extendable cryptographic keyed functions (deck) generalize the concept of message authentication codes (MAC) and stream ciphers in that they...
-
The Exact Multi-user Security of (Tweakable) Key Alternating Ciphers with a Single Permutation
We prove the tight multi-user (mu) security of the (tweakable) key alternating cipher (KAC) for any round r with a single permutation and r-wise...
-
Automatic Search Model for Related-Tweakey Impossible Differential Cryptanalysis
The design and analysis of dedicated tweakable block ciphers constitute a dynamic and relatively recent research field in symmetric cryptanalysis....
-
On the Field-Based Division Property: Applications to MiMC, Feistel MiMC and GMiMC
Recent practical applications using advanced cryptographic protocols such as multi-party computations (MPC) and zero-knowledge proofs (ZKP) have...
-
Randomized Half-Ideal Cipher on Groups with Applications to UC (a)PAKE
An Ideal Cipher (IC) is a cipher where each key defines a random permutation on the domain. Ideal Cipher on a group has many attractive...
-
Twin Column Parity Mixers and Gaston
We introduce a new type of mixing layer for the round function of cryptographic permutations, called circulant twin column parity mixer (CPM), that...
-
Quantum Attacks Without Superposition Queries: The Offline Simon’s Algorithm
In symmetric cryptanalysis, the model of superposition queries has led to surprising results, with many constructions being broken in polynomial...
-
Indifferentiability of Iterated Even-Mansour Ciphers with Non-idealized Key-Schedules: Five Rounds Are Necessary and Sufficient
We prove that the 5-round iterated Even-Mansour (IEM) construction with a non-idealized key-schedule (such as the trivial key-schedule, where all...
-
Multi-scale iterative domain adaptation for specific emitter identification
Specific emitter identification (SEI) is a technology that identifies different emitters through their unique characteristics. Research on...
-
Rotational Cryptanalysis on MAC Algorithm Chaskey
In this paper we generalize the Markov theory with respect to a relation between two plaintexts and not their difference and apply it for rotational...
-
Partition and mix: generalizing the swap-or-not shuffle
Card shuffle algorithms have been studied from a cryptographic point of view with applications to format preserving encryption. In this work, we...
-
New Key Recovery Attacks on Minimal Two-Round Even-Mansour Ciphers
We propose new key recovery attacks on the two minimal two-round n-bit Even-Mansour ciphers that are secure up to...
-
Quantum Key Recovery Attacks on 3-Round Feistel-2 Structure Without Quantum Encryption Oracles
The Feistel-2 (a.k.a, Feistel-KF) structure is a variant of the Feistel structure such that the i-th round function is given by...
-
Forgery Attacks on FlexAE and FlexAEAD
is one of the round-1 candidates in the ongoing NIST Lightweight Cryptography standardization project and an evolution of the previously...
-
The Key-Dependent Message Security of Key-Alternating Feistel Ciphers
Key-Alternating Feistel (KAF) ciphers are a popular variant of Feistel ciphers whereby the round functions are defined as...
-
WEM: A New Family of White-Box Block Ciphers Based on the Even-Mansour Construction
White-box cryptosystems aim at providing security against an adversary that has access to the encryption process. As a countermeasure against code...
-
Quantum attacks on some feistel block ciphers
Post-quantum cryptography has attracted much attention from worldwide cryptologists. However, most research works are related to public-key...
-
BBB Secure Nonce Based MAC Using Public Permutations
In the recent trend of CAESAR competition and NIST light-weight competition, cryptographic community have witnessed the submissions of several...
-
Efficient Detection of High Probability Statistical Properties of Cryptosystems via Surrogate Differentiation
A central problem in cryptanalysis is to find all the significant deviations from randomness in a given n-bit cryptographic primitive. When n is...
-
Sequential Indifferentiability of Confusion-Diffusion Networks
A large proportion of modern symmetric cryptographic building blocks are designed using the Substitution-Permutation Networks (SPNs), or more...