Results 61 to 70 of about 1,329 (153)
Beyond-Birthday-Bound Security Based on Tweakable Block Cipher [PDF]
, 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.
openaire +1 more source
Исследование кубических атак с малыми степенями макстермов [PDF]
, 2014 Кубічні атаки – один з нових перспективних методів криптоаналізу, який нині успішно застосовується до різних типів сучасних криптосистем, таких як потокові і блокові системи шифрування та хеш-функції.
Sergienko, Vitaliy +5 more
core
Security Analysis of SKINNY under Related-Tweakey Settings
IACR Transactions on Symmetric Cryptology, 2017 In CRYPTO’16, a new family of tweakable lightweight block ciphers - SKINNY was introduced. Denoting the variants of SKINNY as SKINNY-n-t, where n represents the block size and t represents the tweakey length, the design specifies t ∈ {n, 2n, 3n}. In this
Guozhen Liu, Mohona Ghosh, Ling Song
doaj +1 more source
On hashing with tweakable ciphers [PDF]
, 2009 Cryptographic hash functions are often built on block ciphers in order to reduce the security analysis of the hash to that of the cipher, and to minimize the hardware size. Well known hash constructs are used in international standards like MD5 and SHA-1.
Jean-Philippe Aumasson (7210217) +1 more
core
Higher order differentiation over finite fields with applications to generalising the cube attack [PDF]
, 2016 Higher order differentiation was introduced in a cryptographic context by Lai. Several attacks can be viewed in the context of higher order differentiations, amongst them the cube attack of Dinur and Shamir and the AIDA attack of Vielhaber.
Ana Sălăgean +3 more
core +1 more source
DoveMAC: A TBC-based PRF with Smaller State, Full Security, and High Rate
IACR Transactions on Symmetric Cryptology, 2019 Recent parallelizable message authentication codes (MACs) have demonstrated the benefit of tweakable block ciphers (TBCs) for authentication with high security guarantees. With ZMAC, Iwata et al.
Tony Grochow, Eik List, Mridul Nandi
doaj +1 more source
ESTATE: A Lightweight and Low Energy Authenticated Encryption Mode
IACR Transactions on Symmetric Cryptology, 2020 NIST has recently initiated a standardization project for efficient lightweight authenticated encryption schemes. SUNDAE, a candidate in this project, achieves optimal state size which results in low circuit overhead on top of the underlying block cipher.
Avik Chakraborti +5 more
doaj +1 more source
A Novel Lightweight Block Cipher-Based Mutual Authentication Protocol for Constrained Environments
IEEE Access, 2020 The communication security of constrained objects such as radio frequency identification (RFID) tags and wireless sensor network (WSN) is very challenging because it is not always possible to use the conventional on-the-shelf solutions for them, due to ...
Cuong Trinh +7 more
doaj +1 more source
XHX - A Framework for Optimally Secure Tweakable Block Ciphers from Classical Block Ciphers and Universal Hashing [PDF]
, 2021 Tweakable block ciphers are important primitives for designing cryptographic schemes with high security. In the absence of a standardized tweakable block cipher, constructions built from classical block ciphers remain an interesting research topic in ...
Ashwin Jha +4 more
core
Tweakable ForkCipher from Ideal Block Cipher
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.
openaire +1 more source