Results 171 to 180 of about 1,200 (188)
Some of the next articles are maybe not open access.
Revised Algorithms for Computing Algebraic Immunity against Algebraic and Fast Algebraic Attacks
2014Given 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
Chosen IV algebraic attack on One.Fivium
2008 3rd International Conference on Intelligent System and Knowledge Engineering, 2008One of the key questions in algebraic attacks is how to effectively reduce the degree of the function. Based on the algebraic attack, this paper presents a new algorithm of attack - chosen IV algebraic attack, which can reduce the function?s degree by choosing appropriate IV.
Zhe Sun, Shi-Wu Zhang, Lei Wang
openaire +1 more source
Algebraic attack on Mini-AES algorithm
AIP Conference Proceedings, 2016Algebraic attack is a potential powerful attack on symmetric key block cipher. It had been applied on two algorithm of AES simplification; there are Simplified AES and Baby Rijndael. In this research, the application of algebraic attack on Mini-AES algorithm was done to get a polynomial equations system of Mini-AES algorithm and its solutions using XL ...
Sundari Tianingrum, Santi Indarjani
openaire +1 more source
Algebraic Attack Against Trivium
2008Trivium 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 +2 more
openaire +1 more source
An Algebraic Broadcast Attack against NTRU
2012In this paper, we propose an algebraic broadcast attack against NTRU, which recovers a single message encrypted multiple times using different NTRU public keys. Namely, when a message is broadcasted, under some reasonable assumptions, our attack can be completed in polynomial time and space.
Ding, Jintai, Pan, Yanbin, Deng, Yingpu
openaire +2 more sources
Attacks on Block Ciphers of Low Algebraic Degree
Journal of Cryptology, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jakobsen, Thomas, Knudsen, Lars R.
openaire +2 more sources
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
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
Algebraic Attacks Using Binary Decision Diagrams
2015Algebraic attacks have been developed against symmetric primitives during the last decade. In this paper we represent equation systems using binary decision diagrams, and explain techniques for solving them. Next, we do experiments with systems describing reduced versions of DES and AES, as well as systems for the problem of determining EA-equivalence.
Håvard Raddum, Oleksandr Kazymyrov
openaire +1 more source
A New Variant of Algebraic Attack
2014Algebraic attack is an important attack strategy against symmetric ciphers, particularly stream ciphers. The most vital issue in this attack is to reduce the degree of the algebraic equations as much as possible in order to obtain a lower time complexity.
Dibyendu Roy +2 more
openaire +1 more source
Algebraic Attacks Using IP-Solvers
2013The 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

