Results 171 to 180 of about 1,611 (184)
Some of the next articles are maybe not open access.
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
Algebraic Attacks on Stream Ciphers with Gröbner Bases
2009Stream ciphers efficiently encrypt data streams of arbitrary length and are widely deployed in practice, e.g., in mobile phones. Consequently, the development of new mechanisms to design and analyze stream ciphers is one of the major topics in modern cryptography.
Armknecht, Frederik, Ars, Gwénolé
openaire +2 more sources

