Results 191 to 200 of about 1,704 (217)

Attacks on Block Ciphers of Low Algebraic Degree

Journal of Cryptology, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Thomas Jakobsen, Lars R. Knudsen
openaire   +2 more sources

Establishing Equations: The Complexity of Algebraic and Fast Algebraic Attacks Revisited

2015
Algebraic and fast algebraic attacks have posed serious threats to some deployed LFSR-based stream ciphers. Previous works on this topic focused on reducing the time complexity by lowering the degree of the equations, speeding up the substitution step by Fast Fourier Transform and analysis of Boolean functions exhibiting the optimal algebraic immunity.
Lin Jiao, Bin Zhang, Mingsheng Wang
openaire   +1 more source

Algebraic Attacks over GF(q)

2004
Recent algebraic attacks on LFSR-based stream ciphers and S-boxes have generated much interest as they appear to be extremely powerful. Theoretical work has been developed focusing around the Boo- lean function case. In this paper, we generalize this theory to arbitrary finite fields and extend the theory of annihilators and ideals introduced at ...
openaire   +1 more source

Revised Algorithms for Computing Algebraic Immunity against Algebraic and Fast Algebraic Attacks

2014
Given a Boolean function with n variables, a revised algorithm for computing the algebraic immunity d against conventional algebraic attacks in O(D 2±e ) complexity is described for \(D=\sum _{i = 0}^d {n \choose i}\) and a small e, which corrects and clarifies the most efficient algorithm so far at Eurocrypt 2006.
Lin Jiao, Bin Zhang, Mingsheng Wang
openaire   +1 more source

Algebraic Attacks Using IP-Solvers

2013
The main task for carrying out a successful algebraic attack on a cipher (or for examining the security of a cipher) is to solve a multivariate polynomial system over a finite field. We study recent suggestions of using IP-solvers for this task. After formulating the solution of a system of polynomial equations as a mixed integer linear programming ...
openaire   +1 more source

Algebraic attacks on cipher systems

2004 IEEE Africon. 7th Africon Conference in Africa (IEEE Cat. No.04CH37590), 2005
Recently, algebraic attacks have emerged as a new type of cryptographic attack on block ciphers. These attacks involve the formulation of a system of nonlinear equations that describe the secret keybits in terms of the input and output bits of the block cipher, which is then solved.
openaire   +1 more source

Probabilistic algebraic attack on plantlet lightweight stream cipher

Sadhana - Academy Proceedings in Engineering Sciences, 2023
Dheeraj Kumar Sharma, Tapas Chatterjee, Pandey Rajoo   +2 more
exaly  

Algebraic Meet-in-the-Middle Attack on LowMC

Lecture Notes in Computer Science, 2023
Fukang Liu, Liu Fukang, Isobe Takanori   +2 more
exaly  

Algebraic Meet-in-the-Middle Attack on LowMC

2022
Fukang Liu, Santanu Sarkar 0001, Gaoli Wang, Willi Meier, Takanori Isobe 0001   +4 more
openaire   +2 more sources

Algebraic Attack Against Trivium

2008
Trivium is a synchronous stream cipher designed to provide a flexible trade-off between speed and gate count in hardware, and reasonably efficient software implementation. It was designed in 2005 by C. De Cannière and B. Preneel for the European project eSTREAM.
Simonetti, Ilaria, Faugère, Jean-Charles, Perret, Ludovic   +2 more
openaire   +1 more source