Institutional Repository
| cryptanalysis of a generalized unbalanced feistel network structure | |
| Li Ruilin; Sun Bing; Li Chao; Qu Longjiang | |
| 2010 | |
| Conference Name | 15th Australasian Conference on Information Security and Privacy, ACISP 2010 |
| Source | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Pages | 40561 |
| Conference Date | 44017 |
| Conference Place | Sydney, NSW, Australia |
| Indexed Type | EI |
| Publish Place | Germany |
| ISSN | 3029743 |
| ISBN | 3642140807 |
| Department | (1) Department of Mathematics and System Science, Science College, National University of Defense Technology, Changsha, 410073, China; (2) State Key Laboratory of Information Security, Institute of Software, Chinese Academy of Sciences, Beijing, 100190, China; (3) National Mobile Communications Research Laboratory, Southeast University, Nanjing, 210096, China |
| English Abstract | This paper reevaluates the security of GF-NLFSR, a new kind of generalized unbalanced Feistel network structure that was proposed at ACISP 2009. We show that GF-NLFSR itself reveals a very slow diffusion rate, which could lead to several distinguishing attacks. For GF-NLFSR containing n sub-blocks, we find an n2-round integral distinguisher by algebraic methods and further use this integral to construct an (n2+n-2)-round impossible differential distinguisher. Compared with the original (3n-1)-round integral and (2n-1)-round impossible differential, ours are significantly better. Another contribution of this paper is to introduce a kind of non-surjective attack by analyzing a variant structure of GF-NLFSR, whose provable security against differential and linear cryptanalysis can also be provided. The advantage of the proposed non-surjective attack is that traditional non-surjective attack is only applicable to Feistel ciphers with non-surjective (non-uniform) round functions, while ours could be applied to block ciphers with bijective ones. Moreover, its data complexity is O(l) with l the block length. © 2010 Springer-Verlag. |
| Keyword | Algebra Cryptography Lyapunov Methods |
| Sponsorship | iRobot |
| Language | 英语 |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/8714 |
| Collection | 互联网软件技术实验室 |
| Recommended Citation GB/T 7714 | Li Ruilin,Sun Bing,Li Chao,et al. cryptanalysis of a generalized unbalanced feistel network structure[C]. Germany,2010:40561. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| cryptanalysis of a g（303KB） | 开放获取 | -- | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment