Results 71 to 80 of about 1,200 (193)
Partly-Pseudo-Linear Cryptanalysis of Reduced-Round Speck [PDF]
Sarah A. Alzakari, Poorvi L. Vora
openalex +1 more source
Generating Graphs Packed with Paths Estimation of Linear Approximations and Differentials
When designing a new symmetric-key primitive, the designer must show resistance to known attacks. Perhaps most prominent amongst these are linear and differential cryptanalysis. However, it is notoriously difficult to accurately demonstrate e.g.
Mathias Hall-Andersen, Philip S. Vejre
doaj +1 more source
Security against differential and linear cryptanalysis for general SPT models
To use SP network in stream ciphers safely and efficiently,the ability against differential and linear cryptanalysis of SPT models was studied,where S and T denote different layers for substitution,in which compression could be achieved,and P denotes the
Feng-mei LIU +4 more
doaj +2 more sources
Differential and Linear Cryptanalysis Using Mixed-Integer Linear Programming
Differential and linear cryptanalysis are two of the most powerful techniques to analyze symmetric-key primitives. For modern ciphers, resistance against these attacks is therefore a mandatory design criterion. In this paper, we propose a novel technique to prove security bounds against both differential and linear cryptanalysis.
Mouha, Nicky +3 more
openaire +2 more sources
XSL Block Ciphers’ Key-schedules with Resistance to Differential Cryptanalysis
The paper discusses the resistance of XSL block ciphers to differential cryptanalysis. AES-like block ciphers with alternative key-schedules (increased performance and density) are given as an example.
Marina Aleksandrovna Pudovkina +1 more
doaj
Algebraic Techniques in Linear Cryptanalysis
Linear cryptanalysis is a statistical analysis method. Linear cryptanalysis constructs probabilistic patterns first and then distinguishes the cipher from a random permutation using lots of plaintext-ciphertext pairs. Linear cryptanalysis has a big data complexity. Algebraic attack attempts to exploit the algebraic structure of the cipher by expressing
Hong Ru Wei, Ya Fei Zheng
openaire +2 more sources
SAT‐Based Security Evaluation for WARP against Linear Cryptanalysis [PDF]
Jiali Shi, Guoqiang Liu, Chao Li
openalex +1 more source
Improved Slender-Set Linear Cryptanalysis [PDF]
In 2013, Borghoff et al. introduced a slender-set linear cryptanalysis on PRESENT-like ciphers with key-dependent secret S-boxes. In this paper, we propose an improved slender-set linear attack to PRESENT-like ciphers with secret S-boxes. We investigate three new cryptanalytic techniques, and use them to recover the secret S-boxes efficiently.
Guo-Qiang Liu, Chen-Hui Jin, Chuan-Da Qi
openaire +1 more source
Problems with the linear cryptanalysis of DES using more than one active S-box per round [PDF]
Uwe Blöcher, Markus Dichtl
openalex +1 more source
Differential-Linear Cryptanalysis of Serpent [PDF]
Serpent is a 128-bit SP-Network block cipher consisting of 32 rounds with variable key length (up to 256 bits long). It was selected as one of the 5 AES finalists. The best known attack so far is a linear attack on an 11-round reduced variant.
Eli Biham, Orr Dunkelman, Nathan Keller
openaire +1 more source

