Results 1 to 10 of about 1,010,918 (180)
Provably Quantum-Secure Tweakable Block Ciphers [PDF]
IACR Transactions on Symmetric Cryptology, 2021 Recent results on quantum cryptanalysis show that some symmetric key schemes can be broken in polynomial time even if they are proven to be secure in the classical setting.
Akinori Hosoyamada, Tetsu Iwata
doaj +7 more sources
The QARMAv2 Family of Tweakable Block Ciphers [PDF]
IACR Transactions on Symmetric Cryptology, 2023 We introduce the QARMAv2 family of tweakable block ciphers. It is a redesign of QARMA (from FSE 2017) to improve its security bounds and allow for longer tweaks, while keeping similar latency and area.
Roberto Avanzi +6 more
doaj +11 more sources
Lecture Notes in Computer Science, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Liskov, Moses +2 more
exaly +8 more sources
Optimally Secure Tweakable Block Ciphers with a Large Tweak from n-bit Block Ciphers [PDF]
IACR Transactions on Symmetric Cryptology, 2023 We consider the design of a tweakable block cipher from a block cipher whose inputs and outputs are of size n bits. The main goal is to achieve 2n security with a large tweak (i.e., more than n bits). Previously, Mennink at FSE’15 and Wang et al.
Yaobin Shen, François-Xavier Standaert
doaj +8 more sources
Efficient Length Doubling From Tweakable Block Ciphers [PDF]
IACR Transactions on Symmetric Cryptology, 2017 We present a length doubler, LDT, that turns an n-bit tweakable block cipher into an efficient and secure cipher that can encrypt any bit string of length [n..2n − 1].
Yu Long Chen +3 more
doaj +9 more sources
Linear Cryptanalysis: Key Schedules and Tweakable Block Ciphers [PDF]
IACR Transactions on Symmetric Cryptology, 2017 This paper serves as a systematization of knowledge of linear cryptanalysis and provides novel insights in the areas of key schedule design and tweakable block ciphers.
Thorsten Kranz +2 more
doaj +6 more sources
Iterative Block Ciphers from Tweakable Block Ciphers with Long Tweaks [PDF]
IACR Transactions on Symmetric Cryptology, 2020 We consider a problem of constructing a secure block cipher from a tweakable block cipher (TBC) with long tweaks. Given a TBC with n-bit blocks and Γn-bit tweaks for Γ ≥ 1, one of the constructions by Minematsu in DCC 2015 shows that a simple iteration ...
Ryota Nakamichi, Tetsu Iwata
doaj +4 more sources
Improved meet-in-the-middle attacks on reduced-round tweakable block ciphers Kiasu-BC and Deoxys-BC
Journal of King Saud University: Computer and Information Sciences, 2023 Tweakable block ciphers Kiasu-BC and Deoxys-BC are both the internal block ciphers of the candidates for the CAESAR authenticated encryption competition.
Zhangjun Ma, Manman Li, Shaozhen Chen
doaj +4 more sources
Efficient Attack Scheme against SKINNY-64 Based on Algebraic Fault Analysis [PDF]
Entropy, 2023 Lightweight block ciphers are normally used in low-power resource-constrained environments, while providing reliable and sufficient security. Therefore, it is important to study the security and reliability of lightweight block ciphers.
Xing Fang +4 more
doaj +2 more sources
Generalized Feistel Structures Based on Tweakable Block Ciphers
IACR Transactions on Symmetric Cryptology, 2022 A generalized Feistel structure (GFS) is a classical approach to construct a block cipher from pseudorandom functions (PRFs). Coron et al. at TCC 2010 instantiated a Feistel structure with a tweakable block cipher (TBC), and presented its provable ...
Kazuki Nakaya, Tetsu Iwata
doaj +3 more sources