on the resistance of boolean functions against fast algebraic attacks

ISCAS OpenIR

	on the resistance of boolean functions against fast algebraic attacks
	Du Yusong; Zhang Fangguo; Liu Meicheng
	2012
会议名称	14th International Conference on Information Security and Cryptology, ICISC 2011
会议录名称	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
页码	261-274
会议日期	November 30, 2011 - December 2, 2011
会议地点	Seoul, Korea, Republic of
收录类别	EI
ISSN	0302-9743
ISBN	9783642319112
部门归属	(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
摘要	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.
关键词	Algebra Cryptography Optimization Security Of Data
主办者	National Security Research Institute (NSRI); Electronics and Telecommunications Research Institute (ETRI); Korea Internet and Security Agency (KISA); Ministry of Public Administration and Security (MOPAS)
语种	英语
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/15774
专题	中国科学院软件研究所
推荐引用方式 GB/T 7714	Du Yusong,Zhang Fangguo,Liu Meicheng. on the resistance of boolean functions against fast algebraic attacks[C],2012:261-274.