搜索结果: 1-15 共查到“Trivium”相关记录27条 . 查询时间(0.125 秒)
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...
简化版Trivium算法的线性逼近研究
流密码 Trivium算法 多线性密码分析 线性逼近
2016/7/13
针对初始化轮数为288个时钟的简化版Trivium算法（又称2轮Trivium）进行了线性逼近研究，设计了搜索最佳线性近似式算法，并通过对第1轮关于密钥、初始化向量和密钥流比特的表达式做非线性逼近，结合该算法，在同等条件下给出了2轮Trivium 16个偏差为的线性近似式，使通过多线性攻击去识别2轮Trivium的一个具有特定比特的密钥所需要的数据量降为 个选择IV，为Turan方案所需数据量的 ...
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...
Trivium流密码的基于自动推导的差分分析
密码分析 差分分析 Trivium 流密码
2017/1/12
Trivium是欧洲eSTREAM工程评选出的7个最终胜出的流密码算法之一.本文提出了针对Trivium的基于自动推导的差分分析技术，利用该技术可以得到任意轮Trivium算法的差分传递链.将该技术应用于轮数为288的简化版Trivium算法，提出了一个有效的区分攻击，仅需226个选择IV，区分优势为0.999665，攻击结果远优于已有的线性密码分析和多线性密码分析.将该技术应用于更多轮的Triv...
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...