代数次数为3的6元3维Bent函数的结构分析

Rothaus在其文章《On Bent Functions》中指出代数次数为3的6元Bent函数只有3个等价类．本文则推导出代数次数为3的6元Bent函数各等价类中函数的具体结构形式,并由此给出了以任意一个代数次数是3的6元Bent函数为分量的多维Bent函数的构造法．     

拟Bent函数的性质和构造

本文将基本2-群中拟Bent函数的概念推广到一般的有限Abel群中,统一了目前几乎所有的Bent函数概念,完全刻画了一类拟Bent函数和Bent函数的本质联系,给出了几种拟Bent函数的构造方法,拟Bent函数和相对差集的一种关系以及一种用拟Bent函数构造Bent函数的方法.最后,利用Galois环和组合集,找到一类拟Bent函数.     

Bent函数的一般构造法

本文用概率方法给出小项表示的布尔函数谱的性质,据此得到了Ｂｅｎｔ函数的特征矩阵的等价刻画,原则上给出了Ｂｅｎｔ函数的一般构造法,并为Ｂｅｎｔ函数的计数问题提供了一个模型。文中还提出了Ｂｅｎｔ矩阵的概念,考察了Ｂｅｎｔ矩阵的性质,并借助Ｂｅｎｔ矩阵得到由已知Ｂｅｎｔ函数构造新的Ｂｅｎｔ函数构造新的Ｂｅｎｔ函数的方法。     

一类新的二次p元Bent函数的构造

设m为正整数,n=2m,p为一奇素数,令d=pm+1/2,e|m,其中a∈F*pn,γ是Fpn中的一非平方元.本文研究了有限域Fpn上的函数F(x)=Tr1n(axpm+e+1-γdxpm+1),利用有限域上的二次型理论,证明了在m/e为奇数的条件下或m/e为偶数但a(pn-1)/(pe+1)≠1的条件下,F(x)为p元弱正则Bent函数.     

递归构造多个具有最优代数免疫度的平衡布尔函数

代数免疫度是针对代数攻击而提出来的一个新的密码学概念.要能够有效地抵抗代数攻击,密码系统中使用的布尔函数必须具有平衡性、较高的代数次数、较高的非线性度和较高的代数免疫度等.为了提高布尔函数的密码学性能,通过布尔函数仿射等价的方法,找出了所有具有最优代数免疫度的三变元布尔函数.由这些具有最优代数免疫度的三变元非线性布尔函数,递归构造了一类代数免疫度最优、代数次数较高的平衡布尔函数.给出了这类布尔函数非线性度的一个下界,偶数变元时,其下界严格大于Lobanov给出的下界.     

环Z2l上广义Bent函数的稳定性

文献「４」为研究密钥流序列的线性复杂度稳定性和使一些流密码能抗ＢＡＡ（最佳仿射逼近）攻击,提出Ｂｅｎｔ函数稳定性概念,文献「７」研究了素域Ｚｐ上广义Ｂｅｎｔ函数的稳定性及其构造,并指出当ｍ是合数时,ｍ值广义Ｂｅｎｔ函数并不都有稳定性,本文进一步在环Ｚ２＾ｌ（ｌ〉１）上提出了广义Ｂｅｎｔ函数稳定性的概念,综合应用谱、概率和代数数论的方法考察了稳定的概率意义,给出了稳定函数的概率判别条件,提供了构造稳     

具有公共小函数的代数体函数的唯一性

该文研究了两个v值代数体函数具有4v+1个公共小代数体函数的唯一性问题,将亚纯函数关于小函数的几个唯一性定理推广到了代数体函数.     

m值逻辑函数的谱分解式及广义Bent函数的递归构造

本文用概率方法得到ｍ值逻辑函数Ｃｈｒｅｓｔｅｎｓｏｎ循环谱的分解式,据此考察了ｍ值广义Ｂｅｎｔ函数一些新的性质,给出了递归构造ｍ（ｍ≠２ｍｏｄ４）值广义Ｂｅｎｔ函数的一般方法．     

一类广义Bent型S-Box的构造

S-box是密码理论与实践中十分重要的一种装置 ,它的密码性能由其分量函数所决定 .于是 ,选择适当的分量函数来构造 S-box就成了一个重要的研究课题 .在一定意义上 ,Bent函数是最优良的密码函数 .本文通过函数序列半群和置换群来构造其任何非零线性组合为 Bent函数与线性函数之和的函数组 ,从而可由 Bent函数构造出具有高度非线性度和其他良好性状的 S-box     

关于Bent序列构造的一点注记

本文讨论文献[4]给出的构造bent序列的方法,指出该方法可以通过对级联序列进行下标变换实现,从而大大增加了[4]中给出的由两个已知bent序列构造出的bent序列的个数。     

Constructions of p-ary Quadratic Bent Functions

Bent functions have many applications in the fields of coding theory, communications and cryptography. This paper studies the constructions of bent functions having the form for odd n and for even n, over the finite field of odd characteristic p, where . Based on the irreducibility of some polynomials on , we focus on characterizing the bent functions for n=p ^v q ^r and n=2p ^v q ^r , where is an odd prime and p a primitive root modulo q ². Moreover, the enumerations of those functions are also considered. Partially supported by the NSF of China under Grants No. 60603012 and No. 60573053.     

Bent Functions, Partial Difference Sets, and Quasi-Frobenius Local Rings

Bent functions andpartial difference sets have been constructed from finite principalideal local rings. In this paper, the constructions are generalizedto finite quasi-Frobenius local rings. Let R bea finite quasi-Frobenius local ring with maximal ideal M.Bent functions and certain partial difference sets on M } M are extended to R } R.     

Mahler型函数值代数无关性的p-adic度量

本文给出Mahler型函数值代数无关性的p-adic度量.     

Mahler型函数值的代数无关度量

利用初等的结式方法研究满足多项式形式的函数方程组的Mahler型函数的零点估计,给出了满足非线性函数方程组的Mahler型函数在代数点值的代效无关度量．     

Constructing new differentially 4-uniform permutations from the inverse function

Two new families of differentially 4-uniform permutations over ${\mathbb{F}}_{2^{2m}}$ are constructed by modifying the values of the inverse function on some subfield of ${\mathbb{F}}_{2^{2m}}$ and by applying affine transformations on the function. The resulted 4-uniform permutations have high nonlinearity and algebraic degree. A family of differentially 6-uniform permutations with high nonlinearity and algebraic degree is also constructed by making the modification on an affine subspace of ${\mathbb{F}}_{2^{2m}}$.     

Basic Theory in Construction of Boolean Functions with Maximum Possible Annihilator Immunity

So far there is no systematic attempt to construct Boolean functions with maximum annihilator immunity. In this paper we present a construction keeping in mind the basic theory of annihilator immunity. This construction provides functions with the maximum possible annihilator immunity and the weight, nonlinearity and algebraic degree of the functions can be properly calculated under certain cases. The basic construction is that of symmetric Boolean functions and applying linear transformation on the input variables of these functions, one can get a large class of non-symmetric functions too. Moreover, we also study several other modifications on the basic symmetric functions to identify interesting non-symmetric functions with maximum annihilator immunity. In the process we also present an algorithm to compute the Walsh spectra of a symmetric Boolean function with O(n²) time and O(n) space complexity. We use the term “Annihilator Immunity” instead of “Algebraic Immunity” referred in the recent papers [3–5, 9, 18, 19]. Please see Remark 1 for the details of this notational change     

Non-Existence of Some Generalized Bent Functions

Several new results on the non-existence of some generalized bent functions are proved by using properties of the decomposition law of primes in cyclotomic fields and properties of the solutions of some special Diophantine equations.