共查询到16条相似文献,搜索用时 109 毫秒
1.
级联构造作为布尔函数的主要构造方法之一,具有结构简单、实现快速灵活等优点,被广泛用于构造实用的布尔函数。文中给出了一种通过迭代来构造密码学性质好的布尔函数的级联方法,详细测试了这类函数主要的密码学性质及代数正规型项数,并从理论上分析了构造的这类函数能够具有平衡性、最优的代数次数、高非线性度、高的代数免疫阶等多种好的密码性质。文中的结果表明,提出的级联构造方法能够用于构造密码学性质良好的布尔函数。 相似文献
2.
3.
4.
5.
布尔函数的非线性度是衡量及其密码学意义的重要标志,而非线性度和其它密码学强度指标,如代数次数,扩散性,相关免疫性等存在着制约关系,本文研究了高非线性度布尔函数的构造,讨论非线性度和其它密码学准则之间的折关系,给出高非线性度,高代数次数,高非线性平衡相关免疫以及具有较好扩散性的高非线性度布尔函数的几种构造方法。 相似文献
6.
次数最大的平衡相关免疫函数的构造 总被引:1,自引:0,他引:1
Maitra和Sarkar于1999年提出了一种递归构造n元平衡相关免疫布尔函数的方法。该文给出了一种新的递归构造方法,构造出非线性度很高的n元m阶n- m-1次的平衡相关免疫函数。与原构造方法相比,该文构造方法得到的函数性质相同,数量更大。 相似文献
7.
8.
9.
级联函数的密码学性质 总被引:2,自引:0,他引:2
构造具有好的密码学性质的布尔函数一直是布尔函数的研究热点.在构造具有好的密码学性质的布尔函数的方法中,级联构造方法是一种重要的研究方法,利用级联构造方法可以构造密码学性质好的布尔函数.本文利用级联构造了布尔函数f1‖f3‖f3‖f2,并且在文中详细讨论了这类级联布尔函数的密码学性质:相关免疫性、扩散性、线性结构、代数免疫阶等.通过我们的讨论发现,在布尔函数f1,f2,f3的密码学性质较好的前提下,级联布尔函数f1‖f3‖f3‖f2的密码学性质也较好. 相似文献
10.
偶数变元代数免疫最优布尔函数的构造方法 总被引:1,自引:0,他引:1
提出了构造偶数变元代数免疫最优的布尔函数的方法,这是一个二阶的递归构造方法.分析表明,利用该方法构造而得到的布尔函数具有优良的密码学特性,比如具有较好的平衡性,较高的代数次数和非线性度等.最后,还对该构造方法进行了推广,进一步导出了递归构造偶数变元代数免疫最优布尔函数的一类方法. 相似文献
11.
将导数和自定义的e-导数结合在一起作为新的研究工具,而这两者(导数和e-导数)结合在一起能直接明确反映布尔函数的重量,深入到布尔函数取值的内部结构中去,讨论相关免疫H布尔函数的代数免疫阶、代数次数等问题,即严格雪崩性质、相关免疫性、代数免疫性及最高代数次数的相容性问题,得出Hamming重量为2n-1+2n-2这类H布尔函数的最低代数次数和最高代数次数、最优代数免疫等结果。同时,也给出了一些求布尔函数代数次数和最优代数免疫的方法。 相似文献
12.
13.
14.
Algebraic immunity for cryptographically significant Boolean functions: analysis and construction 总被引:13,自引:0,他引:13
Carlet C. Dalai D.K. Gupta K.C. Maitra S. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2006,52(7):3105-3121
Recently, algebraic attacks have received a lot of attention in the cryptographic literature. It has been observed that a Boolean function f used as a cryptographic primitive, and interpreted as a multivariate polynomial over F/sub 2/, should not have low degree multiples obtained by multiplication with low degree nonzero functions. In this paper, we show that a Boolean function having low nonlinearity is (also) weak against algebraic attacks, and we extend this result to higher order nonlinearities. Next, we present enumeration results on linearly independent annihilators. We also study certain classes of highly nonlinear resilient Boolean functions for their algebraic immunity. We identify that functions having low-degree subfunctions are weak in terms of algebraic immunity, and we analyze some existing constructions from this viewpoint. Further, we present a construction method to generate Boolean functions on n variables with highest possible algebraic immunity /spl lceil/n/2/spl rceil/ (this construction, first presented at the 2005 Workshop on Fast Software Encryption (FSE 2005), has been the first one producing such functions). These functions are obtained through a doubly indexed recursive relation. We calculate their Hamming weights and deduce their nonlinearities; we show that they have very high algebraic degrees. We express them as the sums of two functions which can be obtained from simple symmetric functions by a transformation which can be implemented with an algorithm whose complexity is linear in the number of variables. We deduce a very fast way of computing the output to these functions, given their input. 相似文献
15.
Algebraic immunity is an important cryptographic property of Boolean functions. In this paper, odd-variable balanced Boolean functions with optimal algebraic immunity are obtained by m-sequence and consequently, we get bases with special constructions of vector space. Furthermore, through swapping some vectors of these two bases, we establish all kinds of odd-variable balanced Boolean functions with optimal algebraic immunity. 相似文献
16.
From the motivation of algebraic attacks on stream and block ciphers,the concept of algebraic immunity(AI) of a Boolean function was introduced and studied extensively.High algebraic immunity is a necessary condition for resisting algebraic attacks.In this paper,we give some lower bounds on the algebraic immunity of Boolean functions.The results are applied to give lower bounds on the AI of symmetric Boolean functions and rotation symmetric Boolean functions.Some balanced rotation symmetric Boolean functions with their AI near the maximum possible value「n/2」are constructed. 相似文献