Results 11 to 20 of about 449 (128)
Lecture Notes in Computer Science, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Moses Liskov +2 more
exaly +7 more sources
Tweakable TWINE: Building a Tweakable Block Cipher on Generalized Feistel Structure
Lecture Notes in Computer Science, 2019 Tweakable block cipher (TBC) is an extension of conventional block cipher. We study how to build a TBC based on generalized Feistel structure (GFS), a classical block cipher construction. While known dedicated TBC proposals are based on substitution-permutation network (SPN), GFS has not been used for building TBC.
KŌSEI Sakamoto +2 more
exaly +3 more sources
Tweakable enciphering schemes using only the encryption function of a block cipher [PDF]
Information Processing Letters, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Palash Sarkar
exaly +5 more sources
Beyond-Birthday-Bound Security Based on Tweakable Block Cipher [PDF]
Lecture Notes in Computer Science, 2009 This paper studies how to build a 2n-bit block cipher which is hard to distinguish from a truly random permutation against attacks with q ≈ 2 n/2 queries, i.e., birthday attacks. Unlike previous approaches using pseudorandom functions, we present a simple and efficient proposal using a tweakable block cipher as an internal module.
Kazuhiko Minematsu, Minematsu Kazuhiko
exaly +4 more sources
Counter-in-Tweak: Authenticated Encryption Modes for Tweakable Block Ciphers [PDF]
Lecture Notes in Computer Science, 2016 We propose the Synthetic Counter-in-Tweak $$\mathsf {SCT}$$ mode, which turns a tweakable block cipher into a nonce-based authenticated encryption scheme with associated data. The $$\mathsf {SCT}$$ mode combines in a SIV-like manner a Wegman-Carter MAC inspired from $$\mathsf {PMAC}$$ for the authentication part and a new counter-like mode for the ...
Thomas Peyrin +2 more
exaly +5 more sources
IACR Transactions on Symmetric Cryptology, 2021 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 +4 more sources
Tweakable ForkCipher from Ideal Block Cipher [PDF]
IACR Communications in CryptologyIn ASIACRYPT 2019, Andreeva et al. introduced a new symmetric key primitive called the forkcipher, designed for lightweight applications handling short messages. A forkcipher is a keyed function with a public tweak, featuring fixed-length input and fixed-length (expanding) output.
Sougata Mandal
core +5 more sources
CRAFT: Lightweight Tweakable Block Cipher with Efficient Protection Against DFA Attacks [PDF]
IACR Transactions on Symmetric Cryptology, 2019 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
Provable Security of (Tweakable) Block Ciphers Based on Substitution-Permutation Networks [PDF]
, 2018 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 and “global” permutation steps which are non-cryptographic.
COGLIATI, Benoît-Michel +6 more
openaire +4 more sources
Meet‐in‐the‐middle attacks on round‐reduced tweakable block cipher Deoxys‐BC
IET Information Security, 2019 Deoxys‐BC is a tweakable block cipher designed by Jean et al . at ASIACRYPT 2014 within the TWEAKEY framework. Then Deoxys‐BC is used in the CAESAR finalist Deoxys. In this study, the authors consider the security of Deoxys‐BC against meet‐in‐the‐middle attack in the single‐key setting. Using
Chenhui Jin
exaly +2 more sources