Results 1 to 10 of about 93,560 (146)
Cascading Four Round LRW1 is Beyond Birthday Bound Secure
IACR Transactions on Symmetric Cryptology, 2023 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 +2 more sources
Constructions of Beyond-Birthday Secure PRFs from Random Permutations, Revisited [PDF]
Entropy, 2021 In CRYPTO 2019, Chen et al. showed how to construct pseudorandom functions (PRFs) from random permutations (RPs), and they gave one beyond-birthday secure construction from sum of Even-Mansour, namely SoEM22 in the single-key setting.
Jiehui Nan, Ping Zhang, Honggang Hu
doaj +2 more sources
GCM-SIV1.5: Optimal Tradeoff between GCM-SIV1 and GCM-SIV2 [PDF]
Entropy, 2023 GCM-SIV2 is a nonce-based beyond-birthday-bound (BBB)-secure authenticated encryption (AE) mode introduced by Iwata and Minematsu at FSE 2017. However, it is built by combining two instances of GCM-SIV1 and needs eight keys, which increases the costs of ...
Ping Zhang
doaj +2 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
Beyond-Birthday-Bound Security for 4-round Linear Substitution-Permutation Networks
IACR Transactions on Symmetric Cryptology, 2020 Recent works of Cogliati et al. (CRYPTO 2018) have initiated provable treatments of Substitution-Permutation Networks (SPNs), one of the most popular approach to construct modern blockciphers.
Yuan Gao +4 more
doaj +3 more sources
Beyond-Birthday-Bound Secure Cryptographic Permutations from Ideal Ciphers with Long Keys
IACR Transactions on Symmetric Cryptology, 2020 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 +3 more sources
On Beyond-Birthday-Bound Security: Revisiting the Development of ISO/IEC 9797-1 MACs
IACR Transactions on Symmetric Cryptology, 2019 ISO/IEC 9797-1 is an international standard for block-cipher-based Message Authentication Code (MAC). The current version ISO/IEC 9797-1:2011 specifies six single-pass CBC-like MAC structures that are capped at the birthday bound security.
Yaobin Shen, Lei Wang
doaj +4 more sources
IACR Transactions on Symmetric Cryptology, 2017 Modular design via a tweakable blockcipher (TBC) offers efficient authenticated encryption (AE) schemes (with associated data) that call a blockcipher once for each data block (of associated data or a plaintext).
Yusuke Naito
doaj +3 more sources
Beyond-Birthday-Bound Security Based on Tweakable Block Cipher [PDF]
Designs, Codes and Cryptography, 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.
Christian Forler +3 more
+8 more sources
GCM Variants with Robust Initialization Vectors
Mathematics, 2023 The complexity and isomerization of communication networks have put forth new requirements for cryptographic schemes to ensure the operation of network security protocols. Robust cryptographic schemes have been gradually favored.
Ping Zhang
doaj +1 more source