Title: fast discrete fourier spectra attacks on stream ciphers
Author: Gong Guang
; Rnjom Sondre
; Helleseth Tor
; Hu Honggang
Keyword: Algebra
; Cryptography
; Discrete Fourier transforms
; Mathematical transformations
; Shift registers
Source: IEEE Transactions on Information Theory
Issued Date: 2011
Volume: 57, Issue: 8, Pages: 5555-5565 Indexed Type: ei
Department: (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
English Abstract: 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. Language: 英语
WOS ID: WOS:000295738500045
Citation statistics:
Content Type: 期刊论文
URI: http://ir.iscas.ac.cn/handle/311060/14033
Appears in Collections: 软件所图书馆_期刊论文
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.
