Results 71 to 80 of about 449 (128)
Cryptanalysis of Round-Reduced Fantomas, Robin and iSCREAM
In this work, we focus on LS-design ciphers Fantomas, Robin, and iSCREAM. LS-designs are a family of bitslice ciphers aimed at efficient masked implementations against side-channel analysis.
Ashutosh Dhar Dwivedi +3 more
doaj +1 more source
A Survey on Applications of H-Technique: Revisiting Security Analysis of PRP and PRF. [PDF]
Jha A, Nandi M.
europepmc +1 more source
GCM-SIV1.5: Optimal Tradeoff between GCM-SIV1 and GCM-SIV2. [PDF]
Zhang P.
europepmc +1 more source
Multiplex: TBC-Based Authenticated Encryption with Sponge-Like Rate
Authenticated Encryption (AE) modes of operation based on Tweakable Block Ciphers (TBC) usually measure efficiency in the number of calls to the underlying primitive per message block. On the one hand, many existing solutions reach a primitive-rate of 1,
Yaobin Shen +2 more
doaj +1 more source
Efficient Implementation of NIST LWC ESTATE Algorithm Using OpenCL and Web Assembly for Secure Communication in Edge Computing Environment. [PDF]
Park B, Seo SC.
europepmc +1 more source
Weak Tweak-Key Analysis of Blink via Superbox
This work presents the first third-party cryptanalysis of Blink, a recent tweakable block cipher built on the Three-Hash Framework with a long-key design.
Shiyao Chen, Jian Guo, Tianyu Zhang
doaj +1 more source
Weak-keys and key-recovery attack for [Formula: see text]. [PDF]
Dutta P, Rajasree MS, Sarkar S.
europepmc +1 more source
An earlier paper by the same author (IACR Eprint 2008/473) suggested combining a block cipher and a stream cipher to get a strong hybrid cipher. This paper proposes a specific cipher based on those ideas, using the HC-128 stream cipher and a tweakable ...
Sandy Harris
core
Generic Attack on Iterated Tweakable FX Constructions
International audienceTweakable block ciphers are increasingly becoming a common primitive to build new resilient modes as well as a concept for multiple dedicated designs.
Sibleyras, Ferdinand +1 more
core +1 more source
Tweakable Blockciphers with Asymptotically Optimal Security? [PDF]
. We consider tweakable blockciphers with beyond the birth-day bound security. Landecker, Shrimpton, and Terashima (CRYPTO 2012) gave the first construction with security up to O(22n/3) adversar-ial queries (n denotes the block size in bits of the ...
Yannick Seurin, Rodolphe Lampe
core

