部分K值逻辑中完满对称函数集最小覆盖判定的一些结果

根据部分K值逻辑的完备性理论,从二元完满对称关系G2的关系图的特点出发,首先证明了两类保二元的完满对称函数集不属于部分K值逻辑的准完备集之最小覆盖。然后对关系图中边的数目分情况进行讨论,定出了部分K值逻辑中保二元的完满对称函数集在边数小于等于K时的准完备集之最小覆盖成员。     

部分四值逻辑中准完备集的最小覆盖

根据部分K值逻辑的完备性理论以及准完备集之间的相似关系理论,定出了部分四值逻辑的所有准完备集的最小覆盖,从而解决了部分四值逻辑中Sheffer函数的判定问题。     

部分四值逻辑中保三元正则可离关系函数集最小覆盖的确定

Sheffer函数的判定与构造是多值逻辑函数结构理论中的重要问题之一,此问题可归结为定出多值逻辑函数集之准完备集的最小覆盖.本文根据部分K值逻辑的完备性理论以及准完备集之间的相似关系理论,定出部分四值逻辑中保三元正则可离关系的准完备集之最小覆盖的成员.     

满足p次扩散准则的弹性函数的全局雪崩特征*

研究了相关免疫布尔函数和弹性布尔函数的平方和指标和绝对值指标,得到了满足p次扩散准则、次数为d的弹性布尔函数的绝对值指标的一个新的下界．同时,利用最大的Walsh谱值得到了此类函数的非零自相关函数数目的一个下界．     

Px4中保四元正则可离关系最小覆盖之确定

根据部分K值逻辑的完备性理论、正则可离关系以及准完备集之间的相似关系理论,对部分四值逻辑中最小覆盖的确定进行分析,定出了部分四值逻辑中保四元正则可离关系函数集之最小覆盖成员.     

关于满足K次扩散准则的P值逻辑函数

在多值逻辑函数结构理论中有下列四类重要的函数:1)完备性理论中的Sheffer函数,一个Sheffe函数是一个完备系,确定一个泛代数系统[1].2)公开钥密码系统中的单向陷门函数,一个单向陷门函数确定一个公开钥.3)编码系统中的处处非线性函数,它与Costas阵列完全等价[2].4)密码学中的相关免疫函数[3]和满足K次扩散准则函数,当K一1时,是满足严格雪崩准则函数,当K=n,n为偶数时,是Bent函数[4～6].     

部分四值逻辑中Sheffer函数的判定

多值逻辑是指一切逻辑值的取值数大于2的逻辑。Sheffer函数的判定问题是多值逻辑完备性理论中的一个重要问题,此问题的解决依赖于定出多值逻辑函数集中所有准完备集的最小覆盖。在深入研究部分四值逻辑中Sheffer函数的基础上,根据部分四值逻辑中准完备集的最小覆盖,给出了一个部分四值逻辑中Sheffer函数的判定算法。此算法能够判定任意一个函数是不是部分四值逻辑中的Sheffer函数。     

部分二值逻辑中的判定

利用保关系的思想，定出了部分二值逻辑函数中准完备集的最小覆盖。从而给出了部分二值Sheffer函数的最简判定方法。该方法具有重要的理论和实际意义。     

关于部分多值逻辑函数集中准完备集的若干性质

Sheffer函数的最简判定是多值逻辑函数集完备性判定问题中的一个重要的理论和实际问题.文中根据多值逻辑函数理论中“保关系”的系统思想,使用群论和组合数学的工具,研究了部分多值逻辑函数集中准完备类相应关系的若干性质.给出并证明了非空关系Gm是完全关系以及子群H是Gm的对称群的充要条件,定出了部分k值逻辑中完满对称函数类Fs,m中函数集的个数.以上工作为解决部分多值逻辑中Sheffer函数的判定提供了研究基础.     

部分二值逻辑中Sheffer函数的判定

利用保关系的思想,定出了部分二值逻辑函数中准完备集的最小覆盖。从而给出了部分二值Sheffer函数的最简判定方法。该方法具有重要的理论和实际意义。     

满足k次强扩散准则的布尔函数谱特征分析

利用概率方法和频谱理论,给出布尔函数满足强扩散准则的一个新的等价判别条件,并根据强扩散准则与扩散准则之间的关系,得到满足k次强扩散准则的布尔函数的2种构造方法。结合具有平衡性和相关免疫性的布尔函数的谱特征,给出缸欺骗免疫秘密共享定义函数的谱判别条件。     

Spectral characterization of cryptographic Boolean functions satisfying the (extended) propagation criterion of degree l and order k

The (extended) propagation criterion was defined in cryptography in order to analyze the security of cryptographic components with respect to differential cryptanalysis. In this paper, we obtain the spectral characterization of functions satisfying the (extended) propagation criterion of degree l and order k. This important problem was left open since the introduction of these functions more than ten years ago.     

一种平衡相关免疫函数的构造

利用部分Bent函数的定义和性质,通过使用自对偶码的知识构造出平衡且具有k次扩散准则的相关免疫的函数。     

The autocorrelation distribution of balanced Boolean function

The global avalanche characteristics (the sum-of-squares indicator and the absolute indicator) measure the overall avalanche characteristics of a cryptographic Boolean function. Sung et al. (1999) gave the lower bound on the sum-of-squares indicator for a balanced Boolean function satisfying the propagation criterion with respect to some vectors. In this paper, if balanced Boolean functions satisfy the propagation criterion with respect to some vectors, we give three necessary and sufficient conditions on the auto-correlation distribution of these functions reaching the minimum the bound on the sum-of-squares indicator. And we also find all Boolean functions with 3-variable, 4-variable, and 5-variable reaching the minimum the bound on the sum-of-squares indicator.     

多输出布尔函数的k阶严格雪崩准则

首次将k阶严格雪崩准则的概念扩展到多输出布尔函数上,首先研究了多输出函数的严格雪崩准则、扩散准则,给出了多输出函数满足k阶严格雪崩准则的两个充分必要条件,证明了多输出布尔函数满足高阶严格雪崩准则时一定满足低阶严格雪崩准则。然后根据对称函数的特性,应用数论的知识,研究了多输出对称布尔函数的严格雪崩准则、扩散准则和k阶严格雪崩性质,给出了相应准则的充分必要条件,特别给出了两个k阶严格雪崩准则的组合判别公式。     

Construction of highly nonlinear resilient Boolean functions satisfying strict avalanche criterion

Boolean functions with high nonlinearity, high resiliency and strict avalanche criterion （SAC） play an important role in the designs of conventional cryptographic systems. In this paper, a method is proposed to construct resilient Boolean functions on n variables （n even） satisfying SAC with nonlinearity 〉 2n-1 -2n/2. A large class of cryptographic Boolean functions that were not known earlier were obtained.     

On Cryptographic Propagation Criteria for Boolean Functions

We determine the functions on GF(2)ⁿ which satisfy the propagation criterion of degree n−2, PC(n−2). We study subsequently the propagation criterion of degree ℓ and order k and its extended version EPC. We determine those Boolean functions on GF(2)ⁿ which satisfy PC(ℓ) of order kn−ℓ−2. We show that none of them satisfies EPC(ℓ) of the same order. We finally give a general construction of nonquadratic functions satisfying EPC(ℓ) of order k. This construction uses the existence of nonlinear, systematic codes with good minimum distances and dual distances (e.g., Kerdock codes and Preparata codes).     

Synthesis of continuous-valued logic functions defined in tabular form

The choice table provides one of the techniques for the representation of functions in continuous-valued logic [1]. The need to synthesize functions from choice tables arise in the design of hybrid [2] and analog [3] computers, and also in other applications of continuous-valued logic that are surveyed in [4]. The structure of the original table is determined by the external specification of the device or unit being designed. Algorithms are available for the synthesis of continuous-valued logic functions from choice tables of a special form, for instance, from ordered choice tables [ It is noted in [ that a general algorithm to synthesize a continuous-valued logic function from an arbitrary choice table is still unknown. In the present article, we derive a criterion that decides whether a given choice table defmes some continuous-valued logic function and construct a simple algorithm to synthesize the function from the table. Translated from Kibernetika i Sistemnyi Analiz, No. 2, pp. 42–49, March–April, 1998.