Results 71 to 80 of about 458 (184)
Automated Differential‐Linear Cryptanalysis for AND‐RX Ciphers
Differential and linear cryptanalysis are two important methods to evaluate the security of block ciphers. Building on these two methods, differential‐linear (DL) cryptanalysis was introduced by Langford and Hellman in 1994. This cryptanalytic method has been not only extensively researched but also proven to be effective.
Wenya Li, Kai Zhang, Bin Hu, Yong Yu
wiley +1 more source
New Practical Attacks on GEA‐1 Based on a New‐Found Weakness
GEA‐1, a proprietary stream cipher, was initially designed and used to protect against eavesdropping general packet radio service (GPRS) between the phone and the base station. Now, a variety of current mobile phones still support this standard cipher.
Zheng Wu +5 more
wiley +1 more source
A new S-box pattern generation based on chaotic enhanced logistic map: case of 5-bit S-box
Cryptography plays consistently an essential role in securing any sort of communications or data broadcast over the network. Since the security of any designed block cipher algorithm is related to its Substitution box (S-box), several efforts have been ...
Ismail El Gaabouri +3 more
doaj +1 more source
Differential Fault Attacks on Privacy Protocols Friendly Symmetric‐Key Primitives: RAIN and HERA
As the practical applications of fully homomorphic encryption (FHE), secure multi‐party computation (MPC) and zero‐knowledge (ZK) proof continue to increase, so does the need to design and analyze new symmetric‐key primitives that can adapt to these privacy‐preserving protocols.
Lin Jiao +4 more
wiley +1 more source
Differential‐linear (DL) cryptanalysis is an important cryptanalytic method in cryptography and has received extensive attention from the cryptography community since its proposal by Langford and Hellman in 1994. At CT‐RSA 2023, Bellini et al. introduced continuous difference propagations of XOR, rotation, and modulo‐addition operations and proposed a ...
Yanyan Zhou +3 more
wiley +1 more source
The powers against the higher-order differential cryptanalysis of the single-SP(substitution-permutation) model and the double-SP model are studied in the type-1 Feistel network by analyzing the growths of algebraic degrees.
ONGLe D, UJiao D, UWen-ling W
doaj +2 more sources
MRHS solver based on linear algebra and exhaustive search
We show how to build a binary matrix from the MRHS representation of a symmetric-key cipher. The matrix contains the cipher represented as an equation system and can be used to assess a cipher’s resistance against algebraic attacks.
Raddum Håvard, Zajac Pavol
doaj +1 more source
Key-Recovery Attacks on Full Kravatte
This paper presents a cryptanalysis of full Kravatte, an instantiation of the Farfalle construction of a pseudorandom function (PRF) with variable input and output length.
Colin Chaigneau +6 more
doaj +1 more source
Algebraic Cryptanalysis of Deterministic Symmetric Encryption
Deterministic symmetric encryption is widely used in many cryptographic applications. The security of deterministic block and stream ciphers is evaluated using cryptanalysis. Cryptanalysis is divided into two main categories: statistical cryptanalysis and algebraic cryptanalysis.
openaire +2 more sources
HHL Algorithm for Tensor-Decomposable Matrices
We use the HHL algorithm to retrieve a quantum state holding the algebraic normal form (ANF) of a Boolean function. Unlike the standard HHL applications, we do not describe the cipher as an exponentially big system of equations.
Cezary Pilaszewicz, Marian Margraf
doaj +1 more source

