全局雪崩准则的刻画及函数构造

doi:10.3969/j.issn.1000-436x.2014.z2.035

Abstract

Abstract:

Global avalanche characteristics matrix representation method starting from the expression of global avalanche characteristics was proposed and a new tool for research global avalanche characteristics was provided.According to properties of sum-of-square indicator,an odd almost optimal Boolean functions which meet savariety of properties of cryptography was constructed and hold slower sum-of-square indicator via M-M Boolean functions.It is a problem that how to construct a kind of functions satisfying GAC.There is a effecint way that modifying M-M functions with designing new mapping.

Key words: Boolean functions, global avalanche characteristics, matrix, construction algorithm, nonlinearity

Hong-bo YUAN,Xiao-yuan YANG,Li-xian WEI,Long-fei LIU. Description of global avalanche characteristics and constructions of Boolean functions[J]. Journal on Communications, 2014, 35(Z2): 251-255.

Figures/Tables 2

References 19

[1]	ZHANG X M , ZHENG Y L . GAC—the criterion for global avalanche characteristics of cryptographic functions[J]. Journal for Universal Computer Science, 1995,1(5): 316-333.
[2]	ADAMS C M , TAVARES S E . Generating and counting binary bent sequences[J]. IEEE Transactions on Information Theory, 1995,36(5): 1170-1173.
[3]	周宇 . 布尔函数的密码学性质研究[D]. 西安电子科技大学, 2009. ZHOU Y . Research on Cryptographic Properties of Boolean Functions[D]. Xi’an University of Electronic Science and Technology, 2009.
[4]	CARLET C . Generalized partial spreads[J]. IEEE Trasactions on Informatiom Theory, 1995,41(5): 1482-1487.
[5]	BIHAM E , SHAMIR A . Differential cryptanalysis of DES-like cryptosystems[J]. Journal of Cryptology, 1991,4(1): 3-72.
[6]	ZHOU J , CHEN W , GAO F . Best linear approximation and correlation immunity of functions over Zm[J]. IEEE Transaction on Information Theory, 1999,45(1): 303-308.
[7]	ZENG X , CARLET C , SHAN J ,et al. More balanced Boolean functions with optimal algebraic immunity and good nonlinearity and resistance to fast algebraic attacks[J]. IEEE Transactions on Information Theory, 2011. 6310-6320.
[8]	ROTHAUS O S . On `bent' functions[J]. J Combin Theory A, 1976,20: 300-305.
[9]	XIAO G Z , MASSEY J L . A Spectral characterization of correlation immune combining functions[J]. IEEE Transaction on Information Theory, 1988,34(3): 569-571.
[10]	张薇, 杨晓元, 韩益亮 . 密码基础理论与协议[M]. 北京: 清华大学出版社, 2012, 23-27. ZHANG W , YANG X Y , HAN Y L . Cryptography Based Theory and Agreement[M]. Beijing: Tsinghua University Press, 2012, 23-27.
[11]	ZHENG Y , ZHANG X M . Plateaued functions[A]. advances in cryptology-ICIC'99,lecture notes in computer science[C]. Heidelberg,Ed,Springer-verlag,1999, 1726: 284-300.
[12]	常志文, 张杰, 李红霞 . 由已知Bent序列构造新的Bent序列[J]. 哈尔滨理工大学学报, 2010,15: 78-81. CHANG Z W , ZHANG J , LI H X . Constructing Bent sequence form given bent sequence[J]. Journal of Harbin University of Science and Technology, 2010,15: 78-81.
[13]	张恭庆 . 高维哈达玛矩阵理论与应用[M]. 北京: 科学出版社, 2010. 66-92. ZHANG G Q . High-dimensional Hadamard Matrix Theory and Application[M]. Beijing: Science PressPress, 2010. 66-92.
[14]	张卫国 . 密码函数及其构造[D]. 西安电子科技大学, 2006. ZHANG W G . Research on Boolean Function and Construction[D]. Xi’an University of Electronic Science and Technology, 2006.
[15]	MAITRA S . Highly nonlinear balanced Boolean functions with good local and global avalanche characteristics[J]. Inform Process Lett, 2002,83: 281-286.
[16]	LI N , QU L , QI W ,et al. On the construction of Boolean functionswith optimal algebraic immunity[J]. IEEE Transaction on Informations Theory, 2008,54: 1330-1334.
[17]	CARLET C , DALAI D K , GUPTA K C ,et al. Algebraic immunity for cryptographically significant Boolean functions:analysis and construction[J]. IEEE Transactions on Information Theory, 2006,52: 3105-3121.
[18]	DILLON J F . Elementary hardamard difference sets[A]. Proceeding of 6th S E Conference of Combinatorics,Graph Theory,and Computing[C]. Utility Mathematics,Winnipeg, 1975. 237-249.
[19]	MAITRA S , SARKAR P . Modifications of pattterson-wiedemann functions for cryptographic applications[J]. IEEE Transactions on Information Theory, 2002,48(1): 278-284.

Metrics

Recommended 0

No Suggested Reading articles found!

Description of global avalanche characteristics and constructions of Boolean functions

RichHTML

PDF

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 2

References 19

Related Articles 15

Metrics

Recommended 0

n	弹性阶	m	平方和指标
9	1	1	2¹⁹?3×1×2¹³
11	1	6	2²¹?3×6×2¹⁷
13	1	17	2²⁵?3×17×2²⁰
13	2	2	2²⁵?3×2×2²⁰
15	1	32	2²⁹?3×32×2²³
15	2	13	2²⁹?3×13×2²³

[1]	Weijie MAI, Weili LIU, Jinghui ZHONG. Self-adaptive differential evolution algorithm based on population state information [J]. Journal on Communications, 2023, 44(6): 34-46.
[2]	Zhongyong WANG, Zhenghao LI, Kexian GONG, Peng SUN, Qingtao LI. Reconstruction of LDPC code check matrix based on random extraction at high bit error rate [J]. Journal on Communications, 2023, 44(3): 128-137.
[3]	Yuan XIE, Tao1 ZOU, Weijun SUN, Shengli XIE. Algorithm of underdetermined convolutive blind source separation for high reverberation environment [J]. Journal on Communications, 2023, 44(2): 82-93.
[4]	Ao LI, Cong FENG, Yutong NIU, Shibiao XU, Yingtao ZHANG, Guanglu SUN. Multiview clustering method for view-unaligned data [J]. Journal on Communications, 2022, 43(7): 143-152.
[5]	Weiqiong WANG, Haojie XU, Meng CUI, Qiong XIE. Hybrid tabu search algorithm for excellent Boolean function [J]. Journal on Communications, 2022, 43(5): 133-143.
[6]	Baoze MA, Guojun LI, Cuiling XIANG, Yang XU. Underdetermined mixing matrix estimation algorithm based on tensor analysis [J]. Journal on Communications, 2022, 43(11): 35-43.
[7]	Baoze MA, Tianqi ZHANG, Zeliang AN, Pan DENG. Convolutive blind source separation method based on tensor decomposition [J]. Journal on Communications, 2021, 42(8): 52-60.
[8]	Zhaojun WU, Limin ZHANG, Zhaogen ZHONG, Renxin LIU. Reconstruction of sparse check matrix for LDPC at high bit error rate [J]. Journal on Communications, 2021, 42(3): 1-10.
[9]	Houzhen WANG, Xinwei CAI, Yan GUO, Huanguo ZHANG. 5-pass zero-knowledge identity authentication scheme based on matrix completion problem [J]. Journal on Communications, 2021, 42(11): 79-86.
[10]	Baoxing PU,Zhiyi MO. Construction method of double unicast network coding [J]. Journal on Communications, 2020, 41(9): 92-103.
[11]	Feiyue QIU,Bowen CHEN,Tieming CHEN,Guodao ZHANG. Sparsity induced convex nonnegative matrix factorization algorithm with manifold regularization [J]. Journal on Communications, 2020, 41(5): 84-95.
[12]	Ming LI,Xiaopeng YANG,Hui ZHU,Fengwei WANG,Qi LI. Efficient and privacy-preserving online face authentication scheme [J]. Journal on Communications, 2020, 41(5): 205-214.
[13]	Yonghao LI, Liang HU, Ping ZHANG, Wanfu GAO. Multi-label feature selection based on dynamic graph Laplacian [J]. Journal on Communications, 2020, 41(12): 47-59.
[14]	Weijia LEI,Yang ZHOU,Xianzhong XIE,Hongjiang LEI. Design of precoding matrices in MIMO full duplex two-way security communication system [J]. Journal on Communications, 2020, 41(10): 156-171.
[15]	Chenyang ZHAO,Junling WANG. Service recommendation method based on context-embedded support vector machine [J]. Journal on Communications, 2019, 40(9): 61-73.