Register
 ALL Title Author Keyword Sponsors Type Publication date Submitted Time Subject Conference Name Source Categories KOS Subject Advisor ORCID Advanced
 ISCAS OpenIR  > 软件所图书馆  > 会议论文
 Title: on the resistance of boolean functions against fast algebraic attacks Author: Du Yusong ; Zhang Fangguo ; Liu Meicheng Source: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Conference Name: 14th International Conference on Information Security and Cryptology, ICISC 2011 Conference Date: November 30, 2011 - December 2, 2011 Issued Date: 2012 Conference Place: Seoul, Korea, Republic of Keyword: Algebra ; Cryptography ; Optimization ; Security of data 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 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) 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. 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. Language: 英语 Content Type: 会议论文 URI: http://ir.iscas.ac.cn/handle/311060/15774 Appears in Collections: 软件所图书馆_会议论文

 Files in This Item:

There are no files associated with this item.

 Recommended Citation: Du Yusong,Zhang Fangguo,Liu Meicheng. on the resistance of boolean functions against fast algebraic attacks[C]. 见:14th International Conference on Information Security and Cryptology, ICISC 2011. Seoul, Korea, Republic of. November 30, 2011 - December 2, 2011.
 Service Recommend this item Sava as my favorate item Show this item's statistics Export Endnote File Google Scholar Similar articles in Google Scholar [Du Yusong]'s Articles [Zhang Fangguo]'s Articles [Liu Meicheng]'s Articles CSDL cross search Similar articles in CSDL Cross Search [Du Yusong]‘s Articles [Zhang Fangguo]‘s Articles [Liu Meicheng]‘s Articles Related Copyright Policies Null Social Bookmarking

 您对该条目有什么异议，请填写以下表单，管理员会尽快联系您。 `内 容：` Email： * 单位： 验证码： 刷新
 您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。 `标 题：` * `内 容：` Email： * 验证码： 刷新