位置：成果数据库 > 期刊 > 期刊详情页
对比特搜索生成器的猜测确定攻击
  • ISSN号：1009-5986
  • 期刊名称：电子与信息学报
  • 时间：0
  • 页码：2925-2929
  • 分类：TN918.1[电子电信—通信与信息系统;电子电信—信息与通信工程]
  • 作者机构：[1]西安电子科技大学计算机网络与信息安全教育部重点实验室,西安710071
  • 相关基金：国家自然科学基金（60833008）; 国家973计划项目（2007CB311201）; 广西信息与通讯技术重点实验室基金（20902）资助课题
  • 相关项目：流密码的设计与分析
作者： 贾艳艳|胡予濮|高军涛|
关键词： 流密码, 密码分析学, 比特搜索生成器, 猜测确定攻击, 复杂度分析, Stream cipher, Cryptanalysis, Bit-Search Generator （BSG）, Guess-and-determine attacks, Complexity analysis
中文摘要：

针对具有低重量反馈多项式的比特搜索生成器（BSG）,利用猜测确定攻击的思想提出了一种快速密钥恢复攻击。该算法基于BSG序列的差分构造特点,首先由截获的密钥流恢复出候选差分序列,然后用反馈多项式对候选差分序列进行校验,以此减少需要求解的L维线性方程系统的数量,从而大大减少了算法所需的复杂度。理论分析和仿真结果表明,对于反馈多项式的重量小于10的BSG,该算法明显优于现有的攻击方法。特别地当反馈多项式的重量为3时,该算法能够将最好的攻击结果O（L320.5L）降低到O（L20.5L）。

英文摘要：

For the Bit-Search-Generators （BSG） with a low weight feedback polynomial, a fast key recovery algorithm is presented using the ideas of the guess-and-determine attack. A candidate differential sequence is recovered firstly from the intercepted keystream sequence based on the differential construction of the BSG sequence. Then the feedback polynomial is used to check the candidate differential sequence, which will reduce the number of the linear equation systems of L dimensions thus to reduce significantly the complexity of the algorithm. Theoretical analysis and simulation experiment results show that, when the weight of the feedback polynomial is less than 10, the complexity of the attack is noticeably better than that of the existing methods. Specially, the attack complexity can be significantly reduced from the best known attack complexity O（L320.5L） to O（L20.5L） when the weight is 3.

同期刊论文项目
流密码的设计与分析
期刊论文 140 会议论文 17 专利 1 著作 1
同项目期刊论文
双系统密码技术下的身份型广播加密方案
多重周期序列二次复杂度的的计算
Linear spans of optimal sets of frequency hopping sequences
Constructions of 1-Resilient Multi-Output Functions
不可能差分分析8轮AES-256
Secondary constructions of bent functions and their enforcement
2-Adic Complexity of Binary m-Sequences
布尔函数的代数攻击
改进的7轮AES-192和8轮AES-256的中间相遇攻击
bent函数和半bent函数的二阶非线性度下界
对一类过滤生成器的攻击
Expected values for the rational complexity of finite binary sequences
On the Nonlinearity of Some T-functions
Improved linear complexities of the frequency hopping sequences in two optimal sets
改进的多步法快速相关攻击及其应用
对Loiss算法的猜测确定分析
Fault analysis of Trivium
Fast discrete Fourier spectra attacks on stream ciphers
On the Value Distributions of Walsh Spectrums of Quadratic Plateaued Functions
7轮AES128的非对称不可能飞来器攻击
Improved Multi-pass Fast Correlation Attacks with Applications
流密码Rabbit 的安全性分析
Linear complexity of sequences produced by Single cycle T-function
Correlation power analysis of DECIMv2
A new correlation attack on nlinear combining generators
Lower Bounds on the Second Order Nonlinearity of Boolean Functions
A resynchronization attack on stream ciphers filtered by Maiorana-McFarland functions
不可能差分攻击AES中的新密钥筛选算法
Correlation power analysis of the software implementation of DECIMv2
On the value distributions of Walsh spectrum of two classes of Plateaued functions
标准模型下可证明安全的基于分级身份签名方案
Distribution properties of compressing sequences derived from primitive sequences over Z/(pe)
三次单项布尔函数的二阶非线性度下界
l-序列的采样元素分布及k-错线性复杂度
有限域上二次Bent 函数的构造
On the k-error linear complexity of l-sequences
布尔函数的二阶非线性度的下界
The linear span of a class of optimal frequency-hopping sequences
2轮Trivium的多线性密码分析
滤波生成器的旋转对称攻击
T函数生成的非线性伪随机序列的自相关性
比特搜索生成器的快速密钥恢复攻击
A new method for meet-in-the-middle attacks reduced AES
Typical primitive polynomials over integer residue rings
对具有高代数免疫度布尔函数的新型代数攻击
Periods of termwise exclusive ors of maximal length FCSR sequences
Autocorrelation and distinctionness of decimations of l-sequences based on primes
On the largest affine sub-families of a family of NFSR sequences
On the distinctness of modular reductions of primitive sequences over Z/(232-1)
On the affine equivalence relation between two classes of Boolean functions with optimal algebraic i
Finding slid pairs in trivium with MiniSat
Correlation power analysis of Trivium
S-盒的Lyapunov指数研究
多重周期序列联合二次复杂度的计算
On the distinctness of binary sequences derived from primitive sequences modulo square-free odd inte
CCA2 Secure Biometric Identity Based Encryption with Constant-size Ciphertext
Remarks on the generalized cyclotomic sequences of length 2pm
A three-valued Walsh transform from decimations of Helleseth-Gong sequences
对广义自缩生成器的区分攻击
Two classes of sequences derived from single cycle T-functions
On the dual of certain ternary weakly regular bent functions
BOMM算法的密码学性质
Guess and Determine Attacks on Filter Generators
完全安全的基于属性的广播加密方案
More Practical Power Analysis Attack on LFSR Based Stream Ciphers
Maiorana-McFarland类Bent函数零化子空间维数
On the Construction of Cryptographically Significant Boolean Functions Using Objects in Projective G
New Constructions of Balanced Boolean Functions with High Nonlinearity and Optimal Algebraic Degree
Constructions of Cryptographically Significant Boolean Permutations
流密码算法Grain的立方攻击
Distribution of one-error linear complexity of binary sequences for arbitrary prime period
剩余类环Z/（pn）上若干类单圈多项式构造
具有短公开参数的基于分级身份的签名方案
针对流密码HC-256＇的区分攻击
抗选择性公开攻击的身份型广播加密方案
流密码Sosemanuk的区分攻击．
7轮AES-128的非对称不可能飞来器攻击
一种新的简化AES中间相遇攻击方法(英文)
单圈T函数生成序列的自相关性(英文)
FASER流密码的安全性分析
有限域上二次Bent函数的构造
具有高阶代数免疫的弹性函数
Maiorana-McFarland’sBent函数零化子空间维数
多个二元序列的二次复杂度研究
对7轮ARIA-192的不可能差分分析
对8轮ARIA算法的差分枚举攻击
基于Biba模型的三权分立分析
应用规律下的BLP模型密级赋值方法
两类最优跳频序列集的线性复杂度
立方攻击成功率分析
高效的基于属性的环签名方案
对5轮IDEA算法的两种攻击
一类最优调频序列的线性复杂度(英文)
环Z／（2^e）上压缩序列ae-1＋η（a0,a1,…,ae-2）的局部保熵性
A resynchronization attack on stream ciphers filtered by Maiorana-McFarland functions
Algebraic attacks on two kinds of special nonlinear filter generators
Fq上q^mp^n-周期序列的线性复杂度与k-错线性复杂度
同步序列密码选择Ⅳ统计分析的新框架
Mickey-128的错误攻击
二元序列线性复杂度谱的进一步研究
二元周期序列的4-错线性复杂度
Correlation power analysis of DECIM^v2
高效的基于属性的签密方案
利用一种SAT问题全解算法求Trivium可滑动对
隐藏访问结构的基于属性加密方案
Galois NFSR和Fibonacci NFSR线性等价的判别
MISTY1算法变形体的滑动攻击
ON THE NONEXISTENCE OF NONTRIVIAL SMALL CYCLES OF THEμ FUNCTION IN 3x ＋ 1 CONJECTURE
改进的10轮3D密码算法的中间相遇攻击
古代筮法产生的随机数研究
双素数Sidel’nikov序列的自相关函数