Results 11 to 20 of about 258 (108)
New Conditional Cube Attack on Keccak Keyed Modes [PDF]
The conditional cube attack on round-reduced Keccak keyed modes was proposed by Huang et al. at EUROCRYPT 2017. In their attack, a conditional cube variable was introduced, whose diffusion was significantly reduced by certain key bit conditions.
Zheng Li +5 more
doaj +6 more sources
Conditional Cube Attack on Round-Reduced ASCON
This paper evaluates the secure level of authenticated encryption Ascon against cube-like method. Ascon submitted by Dobraunig et al. is one of 16 survivors of the 3rd round CAESAR competition. The cube-like method is first used by Dinur et al.
Zheng Li, Xiaoyang Dong, Xiaoyun Wang
doaj +7 more sources
Conditional Cube Key Recovery Attack on Round-Reduced Xoodyak [PDF]
Since the announcement of the NIST call for a new lightweight cryptographic standard, a lot of schemes have been proposed in response. Xoodyak is one of these schemes and is among the finalists of the NIST competition with a sponge structure very similar to the Keccak hash function – the winner of the SHA3 NIST competition.
Vaziri, Mohammad, Velichkov, Vesselin
exaly +7 more sources
Resistance of Ascon Family Against Conditional Cube Attacks in Nonce-Misuse Setting
Ascon family is one of the finalists of the National Institute of Standards and Technology (NIST) lightweight cryptography standardization process. The family includes three Authenticated Encryption with Associated Data (AEAD) schemes: Ascon-128 (primary)
Donghoon Chang +3 more
doaj +5 more sources
Improved Conditional Cube Attacks on Ascon AEADs in Nonce-Respecting Settings
The best-known distinguisher on 7-round Ascon-128 and Ascon-128a AEAD uses a 60-dimensional cube where the nonce bits are set to be equal in the third and fourth rows of the Ascon state during initialization (Rohit et al. ToSC 2021/1).
Kai Hu
doaj +6 more sources
Practical Cube Attack against Nonce-Misused Ascon
Ascon is a sponge-based Authenticated Encryption with Associated Data that was selected as both one of the winners of the CAESAR competition and one of the finalists of the NIST lightweight cryptography standardization effort.
Jules Baudrin +2 more
doaj +3 more sources
Cube Attacks with Elimination Strategy: Key Recovery Attacks on Trivium
In this paper, we present a novel framework for cube attacks named cube attacks with elimination strategy. The core idea is to find specific key conditions and cubes such that their superpolies under these key conditions can be efficiently computed.
Haoran Li +4 more
doaj +2 more sources
Cube and Integral Attacks on ChiLow-32
The protection of executable code in embedded systems requires efficient mechanisms that ensure confidentiality and integrity. Belkheyar et al.
Shuo Peng +8 more
doaj +2 more sources
Cube-Based Cryptanalysis of Subterranean-SAE
Subterranean 2.0 designed by Daemen, Massolino and Rotella is a Round 2 candidate of the NIST Lightweight Cryptography Standardization process. In the official document of Subterranean 2.0, the designers have analyzed the state collisions in unkeyed ...
Fukang Liu, Takanori Isobe, Willi Meier
doaj +1 more source
Finding Ordinary Cube Variables for Keccak-MAC with Greedy Algorithm [PDF]
In this paper, we introduce an alternative method to find ordinary cube variables for Keccak-MAC by making full use of the key-independent bit conditions.
Fukang Liu, Zhenfu Cao, Gaoli Wang
core +1 more source

