Institutional Repository
| on the resistance of boolean functions against fast algebraic attacks | |
| Du Yusong; Zhang Fangguo; Liu Meicheng | |
| 2012 | |
| Conference Name | 14th International Conference on Information Security and Cryptology, ICISC 2011 |
| Source | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Pages | 261-274 |
| Conference Date | November 30, 2011 - December 2, 2011 |
| Conference Place | Seoul, Korea, Republic of |
| Indexed Type | EI |
| ISSN | 0302-9743 |
| ISBN | 9783642319112 |
| Department | (1) School of Information Science and Technology Sun Yat-sen University Guangzhou 510006 China; (2) Key Lab. of Network Security and Cryptology Fujian Normal University Fuzhou 350007 China; (3) State Key Laboratory of Information Security Institute of Software Chinese Academy of Sciences Beijing 100190 China |
| English Abstract | Boolean functions with large algebraic immunity resist algebraic attacks to a certain degree, but they may not resist fast algebraic attacks (FAA's). It is necessary to study the resistance of Boolean functions against FAA's. In this paper, we localize the optimal resistance of Boolean functions against FAA's and introduce the concept of e-fast algebraic immunity (e-FAI) for n-variable Boolean functions against FAA's, where e is a positive integer and . We give the sufficient and necessary condition of e-FAI. With e-FAI the problem of deciding the resistance of an n-variable Boolean function against FAA's can be converted into the problem of observing the properties of one given matrix. An algorithm for deciding e-FAI and the optimal resistance against FAA's is also described. © 2012 Springer-Verlag.; Boolean functions with large algebraic immunity resist algebraic attacks to a certain degree, but they may not resist fast algebraic attacks (FAA's). It is necessary to study the resistance of Boolean functions against FAA's. In this paper, we localize the optimal resistance of Boolean functions against FAA's and introduce the concept of e-fast algebraic immunity (e-FAI) for n-variable Boolean functions against FAA's, where e is a positive integer and . We give the sufficient and necessary condition of e-FAI. With e-FAI the problem of deciding the resistance of an n-variable Boolean function against FAA's can be converted into the problem of observing the properties of one given matrix. An algorithm for deciding e-FAI and the optimal resistance against FAA's is also described. © 2012 Springer-Verlag. |
| Keyword | Algebra Cryptography Optimization Security Of Data |
| Sponsorship | National Security Research Institute (NSRI); Electronics and Telecommunications Research Institute (ETRI); Korea Internet and Security Agency (KISA); Ministry of Public Administration and Security (MOPAS) |
| Language | 英语 |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/15774 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | Du Yusong,Zhang Fangguo,Liu Meicheng. on the resistance of boolean functions against fast algebraic attacks[C],2012:261-274. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment