Results 21 to 30 of about 74 (48)
SPEEDY is a family of ultra-lightweight block ciphers designed by Leander et al. at CHES 2021. There are three recommended variants denoted as SPEEDY-$r$-192 with $r$∈{5,6,7}. All of them support the 192-bit block and the 192-bit key.
Bart Preneel +5 more
core
On the Key-Commitment Properties of Forkcipher-based AEADs [PDF]
Forkcipher-based AEADs have emerged as lightweight and efficient cryptographic modes, making them suitable for resource-constrained environments such as IoT devices and distributed decryption through MPC.
Mostafizar Rahman +2 more
core +1 more source
Optimizing Rectangle Attacks: A Unified and Generic Framework for Key Recovery [PDF]
The rectangle attack has shown to be a very powerful form of cryptanalysis against block ciphers. Given a rectangle distinguisher, one expects to mount key recovery attacks as efficiently as possible.
Danping Shi +6 more
core
Autoguess: A Tool for Finding Guess-and-Determine Attacks and Key Bridges [PDF]
The guess-and-determine technique is one of the most widely used techniques in cryptanalysis to recover unknown variables in a given system of relations.
Hosein Hadipour, Maria Eichlseder
core
Mind the TWEAKEY Schedule: Cryptanalysis on SKINNYe-64-256 [PDF]
Designing symmetric ciphers for particular applications becomes a hot topic. At EUROCRYPT 2020, Naito, Sasaki and Sugawara invented the threshold implementation friendly cipher SKINNYe-64-256 to meet the requirement of the authenticated encryption ...
Anyu Wang +4 more
core
Sonikku: Gotta Speed, Keed! A Family of Fast and Secure MACs [PDF]
A message authentication code (MAC) is a symmetric-key cryptographic function used to authenticate a message by assigning it a tag. This tag is a short string that is difficult to reproduce without knowing the key.
Amit Singh Bhati +3 more
core
Probabilistic Extensions: A One-Step Framework for Finding Rectangle Attacks and Beyond [PDF]
In differential-like attacks, the process typically involves extending a distinguisher forward and backward with probability 1 for some rounds and recovering the key involved in the extended part.
Jian Weng +4 more
core
Multiforked Iterated Even-Mansour and a Note on the Tightness of IEM Proofs [PDF]
The Iterated Even-Mansour (IEM) construction was introduced by Bogdanov et al. at EUROCRYPT 2012 and can be seen as an abstraction or idealization of blockciphers like AES.
Amit Singh Bhati +2 more
core
A Note on Related-Tweakey Impossible Differential Attacks [PDF]
In this short note we review the technique proposed at ToSC 2018 by Sadeghi et al. for attacks built upon several related-tweakey impossible differential trails.
Virginie Lallemand, Xavier Bonnetain
core
Cryptanalysis of Tweakable Block Ciphers and Forkciphers [PDF]
INTERNSHIP REPORTInternational ...
Bariant, Augustin
core +1 more source

