中国科学院软件研究所机构知识库
Register
Email:
Passwd
验 证:
换一张
Have you forgotten your password? Log In
Advanced  
  Communities
  Subjects
  All Items
ISCAS OpenIR  > 软件所图书馆  > 期刊论文
题名:
fast discrete fourier spectra attacks on stream ciphers
作者: Gong Guang ; Rnjom Sondre ; Helleseth Tor ; Hu Honggang
关键词: Algebra ; Cryptography ; Discrete Fourier transforms ; Mathematical transformations ; Shift registers
刊名: IEEE Transactions on Information Theory
发表日期: 2011
卷: 57, 期:8, 页:5555-5565
收录类别: ei
部门归属: (1) Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, ON N2L 3G1, Canada; (2) School of Information Science and Technology, University of Science and Technology of China, Hefei, 230026, China; (3) State Key Laboratory of Information Security, Institute of Software, Chinese Academy of Sciences, Beijing, 100190, China; (4) NSM, Rdskiferveien 20, 1352 Brum, Norway; (5) Selmer Center, Department of Informatics, University of Bergen, PB 7803, N-5020 Bergen, Norway
英文摘要: In this paper, some new results are presented on the selective discrete Fourier spectra attack introduced first as the RnjomHelleseth attack and the modifications due to Rnjom, Gong, and Helleseth. The first part of this paper fills some gaps in the theory of analysis in terms of the discrete Fourier transform (DFT). The second part introduces the new fast selective DFT attacks, which are closely related to the fast algebraic attacks in the literature. However, in contrast to the classical view that successful algebraic cryptanalysis of LFSR-based stream cipher depends on the degree of certain annihilators, the analysis in terms of the DFT spectral properties of the sequences generated by these functions is far more refined. It is shown that the selective DFT attack is more efficient than known methods for the case when the number of observed consecutive bits of a filter generator is less than the linear complexity of the sequence. Thus, by utilizing the natural representation imposed by the underlying LFSRs, in certain cases, the analysis in terms of DFT spectra is more efficient and has more flexibility than classical and fast algebraic attacks. Consequently, the new attack imposes a new criterion for the design of cryptographic strong Boolean functions, which is defined as the spectral immunity of a sequence or a Boolean function. © 2011 IEEE.
语种: 英语
WOS记录号: WOS:000295738500045
Citation statistics:
内容类型: 期刊论文
URI标识: http://ir.iscas.ac.cn/handle/311060/14033
Appears in Collections:软件所图书馆_期刊论文

Files in This Item:
File Name/ File Size Content Type Version Access License
Fast Discrete Fourier Spectra Attacks on Stream Ciphers.pdf（257KB）----限制开放-- 联系获取全文

Recommended Citation:
Gong Guang,Rnjom Sondre,Helleseth Tor,et al. fast discrete fourier spectra attacks on stream ciphers[J]. IEEE Transactions on Information Theory,2011-01-01,57(8):5555-5565.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Gong Guang]'s Articles
[Rnjom Sondre]'s Articles
[Helleseth Tor]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Gong Guang]‘s Articles
[Rnjom Sondre]‘s Articles
[Helleseth Tor]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放，请您登录
您对该条目有什么异议，请填写以下表单，管理员会尽快联系您。
内 容：
Email：  *
单位：
验证码：   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题：
  * 
内 容：
Email：  *
验证码：   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 
Valid XHTML 1.0!
Copyright © 2007-2019  中国科学院软件研究所 - Feedback
Powered by CSpace