搜索结果: 1-15 共查到“军事学 Trivium”相关记录24条 . 查询时间(0.062 秒)
Observations on the Dynamic Cube Attack of 855-Round TRIVIUM from Crypto'18
Dynamic Cube attack Division Property MILP
2018/11/6
Recently, another kind of dynamic cube attack is proposed by Fu et al. With some key guesses and a transformation in the output bit, they claim that, when the key guesses are correct, the degree of th...
A Refinement of “A Key-recovery Attack on 855-round Trivium" From CRYPTO 2018
Trivium Nullification Technique Polynomial Reduction
2018/11/5
At CRYPTO 2018, we proposed a method to reduce the Boolean polynomial of 855-round Trivium. By multiplying a polynomial reduction factor, the output Boolean polynomial is simplified. Based on this met...
A New Framework for Finding Nonlinear Superpolies in Cube Attacks against Trivium-Like Ciphers
Cube attacks Linearity tests Quadracity tests
2018/3/6
In this paper, we study experimental cube attacks against Trivium-like ciphers and we focus on improving nonlinear superpolies recovery. We first present a general framework in cube attacks to test no...
A Key-recovery Attack on 855-round Trivium
Trivium Nullification Technique Polynomial Reduction
2018/3/5
In this paper, we propose a key-recovery attack on Trivium reduced to 855 rounds. As the output is a complex Boolean polynomial over secret key and IV bits and it is hard to find the solution of the s...
On the Hardness of Trivium and Grain with respect to Generic Time-Memory-Data Tradeoff Attacks
Stream Ciphers Time-Memory-Data Tradeoff Attacks Security Lower Bound Proofs
2017/4/5
Time-Memory-Data tradeoff attacks (TMD-attacks) like those of Babbage, Biryukov and Shamir, and Dunkelman and Keller reduce the security level of keystream generator based-stream ciphers to L/2L/2, wh...
The first output bit of TRIVIUM can be considered to be a boolean function of 80 key and 80 IV
variables. Choose n (n ≤ 30) of the key variables and set the other variables to constant values. This
...
This paper presents an algebraic attack against Trivium that breaks 625 rounds using only 4096 bits of output in an overall time complexity of 242.2 Trivium computations. While other attacks can do be...
New Distinguishers for Reduced Round Trivium and Trivia-SC using Cube Testers
Cryptanalysis Cube Tester Stream Cipher
2016/1/3
In this paper we experiment with cube testers on reduced round Trivium that can act
as a distinguisher. Using heuristics, we obtain several distinguishers for Trivium running more than
800 rounds (m...
Improving Key Recovery to 784 and 799 rounds of Trivium using Optimized Cube Attacks
Trivium Cube attacks Cryptanalysis Moebius Transform
2015/12/31
Dinur and Shamir have described cube attacks at EUROCRYPT ’09 and they have
shown how efficient they are on the stream cipher Trivium up to 767 rounds. These attacks have
been extended to distinguis...
Trivium is a bit-based stream cipher in the final portfolio of the eSTREAM project. In this paper, we apply the approach of Berbain et al. to Trivium-like ciphers and perform new algebraic analyses on...
Corrigendum to: The Cube Attack on Stream Cipher Trivium and Quadraticity Tests
The Cube Attack Stream Cipher Trivium Quadraticity Tests
2011/1/20
In 2008 I. Dinur and A. Shamir presented a new type of algebraic attack on symmetric ciphers named cube attack. The method has been applied to reduced variants of stream ciphers Trivium and Grain- 128...
Corrigendum to: The Cube Attack on Stream Cipher Trivium and Quadraticity Tests
secret-key cryptography / cube attack quadraticity tests
2012/3/30
In 2008 I. Dinur and A. Shamir presented a new type of algebraic attack on symmetric ciphers named cube attack. The method has been applied to reduced variants of stream ciphers Trivium and Grain- 128...
The Cube Attack on Stream Cipher Trivium and Quadraticity Tests
The Cube Attack Stream Cipher Trivium Quadraticity Tests
2010/11/22
In 2008 I. Dinur and A. Shamir presented a new type of algebraic attack on symmetric ciphers named cube attack. The method has been applied to reduced variants of stream ciphers Trivium and Grain- 128...
Improved Algebraic Cryptanalysis of QUAD, Bivium and Trivium via Graph Partitioning on Equation Systems
public-key cryptography algebraic attacks graph partitioning polynomial equations Trivium QUAD
2010/7/14
We present a novel approach for solving systems of polynomial equations via graph partitioning. The concept of a variable-sharing graph of a system of polynomial equations is defined. If such graph is...
On the Design of Trivium
Trivium eSTREAM stream ciphers
2009/9/11
eSTREAM called for new stream ciphers designed for niche areas such as
exceptional performance in software and hardware where resources are restricted. This
project provides an open platform to disc...