sequence of functions

sequence of functions的基本解释

-

函数序列

与sequence of functions相关的网络例句 [注：此内容来源于网络，仅供参考]

The main contributions of the second part of this dissertation are focused on the cryptographic properties of logical functions over finite field, with the help of the properties of trace functions, and that of p-polynomials, as well as the permutation theory over finite field: The new definition of Chrestenson linear spectrum is given and the relation between the new Chrestenson linear spectrum and the Chrestenson cyclic spectrum is presented, followed by the inverse formula of logical function over finite field; The distribution for linear structures of the logical functions over finite field is discussed and the complete construction of logical functions taking on all vectors as linear structures is suggested, which leads to the conception of the extended affine functions over finite field, whose cryptographic properties is similar to that of the affine functions over field GF (2) and prime field F〓; The relationship between the degeneration of logical functions and the linear structures, the degeneration of logical functions and the support of Chrestenson spectrum, as well as the relation between the nonlinearity and the linear structures are discussed; Using the relation of the logical functions over finite field and the vector logical functions over its prime field, we reveal the relationship between the perfect nonlinear functions over finite field and the vector generalized Bent functions over its prime field; The existence or not of the perfect nonlinear functions with any variables over any finite fields is offered, and some methods are proposed to construct the perfect nonlinear functions by using the balanced p-polynomials over finite field.

重新定义了有限域上逻辑函数的Chrestenson线性谱，考察了新定义的Chrestenson线性谱和原来的Chrestenson循环谱的关系，并利用一组对偶基给出了有限域上逻辑函数的反演公式；给出了有限域上随机变量联合分布的分解式，并利用随机变量联合分布的分解式对有限域上逻辑函数的密码性质进行了研究；给出了有限域上逻辑函数与相应素域上向量逻辑函数的关系，探讨了它们之间密码性质的联系，如平衡性，相关免疫性，扩散性，线性结构以及非线性度等；讨论了有限域上逻辑函数各类线性结构之间的关系，并给出了任意点都是线性结构的逻辑函数的全部构造，由此引出了有限域上的"泛仿射函数"的概念；考察了有限域上逻辑函数的退化性与线性结构的关系、退化性与Chrestenson谱支集的关系；给出了有限域逻辑函数非线性度的定义，利用有限域上逻辑函数的非线性度与相应素域上向量逻辑函数非线性度的关系，考察了有限域上逻辑函数的非线性度与线性结构的关系；利用有限域上逻辑函数与相应素域上向量逻辑函数的关系，揭示了有限域上的广义Bent函数与相应素域上的广义Bent函数的关系，以及有限域上的完全非线性函数与相应素域上向量广义Bent函数之间的关系；给出了任意有限域上任意n元完全非线性函数存在性与否的完整证明，并利用有限域上平衡的p-多项式的性质给出了有限域上完全非线性函数的一些基本构造方法。

It introduces partial fractions of meromorphic functions, product developments of entire functions, Hadamard's theorem, Riemann Zeta functions, Poisson-Jensen's formula; elliptic functions, including simply periodic functions and doubly periodic functions; algebraic functions and algebroid functions, Riemann surface, Nevanlinna theory, including characteristic functions, the first and second fundamental theorems, growth orders, etc; complex differential equations and complex functional equations, etc.

具体为：亚纯函数的部分分式、整函数的无穷乘积展开、Hadamard定理、Riemann Zeta函数、Poisson-Jensen公式；椭圆函数，包括单周期函数、双周期函数；代数函数和代数体函数、Riemann曲面简介；Nevanlinna理论简介，包括特征函数、第一和第二基本定理、增长级等；复微分方程和复函数方程，等等。在教学内容上充分体现基础性、新颖性。

Using the concept of Boolean functions and combinatorics theory comprehensively, we investigate the construction on annihilators of Boolean functions and the algebraic immunity of symmetric Boolean functions in cryptography:Firstly, we introduce two methods of constructing the annihilators of Boolean functions, Construction I makes annihilators based on the minor term expression of Boolean function, meanwhile we get a way to judge whether a Boolean function has low degree annihilators by feature matrix. In Construction II, we use the subfunctions to construct annihilators, we also apply Construction II to LILI-128 and Toyocrypt, and the attacking complexity is reduced greatly. We study the algebraic immunitiy of (5,1,3,12) rotation symmetric staturated best functions and a type of constructed functions, then we prove that a new class of functions are invariants of algebraic attacks, and this property is generalized in the end.Secondly, we present a construction on symmetric annihilators of symmetric Boolean functions.

本文主要利用布尔函数的相关概念并结合组合论的相关知识，对密码学中布尔函数的零化子构造问题以及对称布尔函数代数免疫性进行了研究，主要包括以下两方面的内容：首先，给出两种布尔函数零化子的构造方法，构造Ⅰ利用布尔函数的小项表示构造零化子，得到求布尔函数f代数次数≤d的零化子的算法，同时得到通过布尔函数的特征矩阵判断零化子的存在性：构造Ⅱ利用布尔函数退化后的子函数构造零化子，将此构造方法应用于LILI-128，Toyocrypt等流密码体制中，使得攻击的复杂度大大降低；通过研究(5，1，3，12)旋转对称饱和最优函数的代数免疫和一类构造函数的代数免疫，证明了一类函数为代数攻击不变量，并对此性质作了进一步推广。

与sequence of functions相关的网络解释 [注：此内容来源于网络，仅供参考]

sequence of functions：函数序列

sequence of distinct points 一一序列 | sequence of functions 函数序列 | sequence of iterations 迭代序列

uniformly bounded sequence of functions：一致有界函数序列

一致有界的 uniformly bounded | 一致有界函数序列 uniformly bounded sequence of functions | 一致有界级数 uniformly bounded series

uniformly convergent sequence of functions：一致收敛函数序列

一致收敛的 uniformly convergent | 一致收敛函数序列 uniformly convergent sequence of functions | 一致凸的 uniformly convex

sequence of real-valued functions：实值函数序列

sequence of random variables 随机变量序列 | sequence of real-valued functions 实值函数序列 | sequence of repeated trials 重复试验序列