Results 1 to 10 of about 4,552,353 (162)
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 +5 more sources
Cascading Four Round LRW1 is Beyond Birthday Bound Secure [PDF]
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 +7 more sources
CTET+: A Beyond-Birthday-Bound Secure Tweakable Enciphering Scheme Using a Single Pseudorandom Permutation [PDF]
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 +6 more sources
On Beyond-Birthday-Bound Security: Revisiting the Development of ISO/IEC 9797-1 MACs [PDF]
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 +6 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
exaly +15 more sources
Beyond-Birthday-Bound Security for 4-round Linear Substitution-Permutation Networks [PDF]
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 +4 more sources
Short Variable Length Domain Extenders with Beyond Birthday Bound Security [PDF]
Lecture Notes in Computer Science, 2018 Length doublers are cryptographic functions that transform an n-bit cryptographic primitive into an efficient and secure cipher that length-preservingly encrypts strings of length in \([n,2n-1]\). All currently known constructions are only proven secure up to the birthday bound, and for all but one construction this bound is known to be tight.
Bart Mennink, Mridul Nandi
exaly +6 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 +4 more sources
Beyond Birthday Bound Secure Fresh Rekeying: Application to Authenticated Encryption [PDF]
Lecture Notes in Computer Science, 2020 Fresh rekeying is a well-established method to protect a primitive or mode against side-channel attacks: an easy to protect but cryptographically not so involved function generates a subkey from the master key, and this subkey is then used for the block encryption of a single or a few messages. It is an efficient way to achieve side-channel protection,
Bart Mennink
exaly +5 more sources
Cymric: Short-tailed but Mighty
Transactions on Cryptographic Hardware and Embedded SystemsAuthenticated encryption (AE) is a fundamental tool in today’s secure communication. Numerous designs have been proposed, including well-known standards such as GCM.
Alexandre Adomnicăi +4 more
doaj +2 more sources