Results 11 to 20 of about 1,484 (155)
Tweaking a block cipher: multi-user beyond-birthday-bound security in the standard model [PDF]
In this paper, we present a generic construction to create a secure tweakable block cipher from a secure block cipher. Our construction is very natural, requiring four calls to the underlying block cipher for each call of the tweakable block cipher ...
Cogliati, Benoît-Michel
core +3 more sources
Tweakable Block Ciphers Secure Beyond the Birthday Bound in the Ideal Cipher Model [PDF]
We propose a new construction of tweakable block ciphers from standard block ciphers. Our construction, dubbed XHX2, is the cascade of two independent XHX block ciphers, so it makes two call to the underlying block cipher using tweak-dependent keys.
B Cogliati +15 more
core +2 more sources
Provable Security of (Tweakable) Block Ciphers Based on Substitution-Permutation Networks [PDF]
Substitution-Permutation Networks (SPNs) refer to a family of constructions which build a wn-bit block cipher from n-bit public permutations (often called S-boxes), which alternate keyless and “local” substitution steps utilizing such S-boxes, with keyed
Cogliati, Benoît-Michel +6 more
core +4 more sources
CRAFT: Lightweight Tweakable Block Cipher with Efficient Protection Against DFA Attacks
Traditionally, countermeasures against physical attacks are integrated into the implementation of cryptographic primitives after the algorithms have been designed for achieving a certain level of cryptanalytic security.
Christof Beierle +3 more
doaj +4 more sources
Highly Secure Nonce-based MACs from the Sum of Tweakable Block Ciphers
Tweakable block ciphers (TBCs) have proven highly useful to boost the security guarantees of authentication schemes. In 2017, Cogliati et al. proposed two MACs combining TBC and universal hash functions: a nonce-based MAC called NaT and a deterministic ...
Wonseok Choi +6 more
doaj +3 more sources
In this work, we propose a construction of 2-round tweakable substitutionpermutation networks using a single secret S-box. This construction is based on non-linear permutation layers using independent round keys, and achieves security beyond the birthday
Benoît Cogliati +5 more
doaj +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Liskov, Moses +2 more
openaire +4 more sources
KLEIN: A New Family of Lightweight Block Ciphers [PDF]
Resource-efficient cryptographic primitives become fundamental for realizing both security and efficiency in embedded systems like RFID tags and sensor nodes.
A. Bogdanov +39 more
core +19 more sources
Cascading Four Round LRW1 is Beyond Birthday Bound Secure
In CRYPTO’02, Liskov et al. introduced the concept of a tweakable block cipher, a novel symmetric key primitive with promising applications. They put forth two constructions for designing such tweakable block ciphers from conventional block ciphers ...
Nilanjan Datta +3 more
doaj +1 more source
1, 2, 3, Fork: Counter Mode Variants based on a Generalized Forkcipher
A multi-forkcipher (MFC) is a generalization of the forkcipher (FC) primitive introduced by Andreeva et al. at ASIACRYPT’19. An MFC is a tweakable cipher that computes s output blocks for a single input block, with s arbitrary but fixed.
Elena Andreeva +3 more
doaj +1 more source

