搜索结果: 1-15 共查到“Boolean”相关记录179条 . 查询时间(0.109 秒)
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：Balanced Boolean Functions with Good Autocorrelation Spectra and Their Applications
自相关谱 平衡 布尔函数
2023/4/26
In this talk we consider the maximum absolute value in the autocorrelation spectrum (not considering the zero point) of balanced Boolean function. The long-standing open question in this area is to ob...
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：Realization of Boolean Control Networks
布尔控制网络 解耦问题 最小实现
2023/4/26
In this talk, we discuss the realization of Boolean control networks (BCNs) and apply obtained results to some decoupling problems. It is proved that the minimum realization (MR) of a BCN exists uniqu...
Faster homomorphic encryption is not enough: improved heuristic for multiplicative depth minimization of Boolean circuits
somewhat homomorphic encryption multiplicative depth Boolean functions
2019/8/27
In somewhat homomorphic encryption schemes (e.g. B/FV, BGV) the size of ciphertexts and the execution performance of homomorphic operations depends heavily on the multiplicative depth. The multiplicat...
Count of rotational symmetric bent Boolean functions
Rotational Symmetric Boolean Function Algebraic Normal Form Bent Boolean Function
2019/8/2
Counting the Boolean functions having specific cryptographic features is an interesting problem in combinatorics and cryptography. Count of bent functions for more than eight variables is unexplored. ...
New non-linearity parameters of Boolean functions
Boolean functions nonlinearity optimal functions bent functions
2019/6/4
The study of non-linearity (linearity) of Boolean function was initiated by Rothaus in 1976. The classical non-linearity of a Boolean function is the minimum Hamming distance of its truth table to tha...
Weights on affine subspaces and some other cryptographic characteristics of Boolean functions of 5 variables
Boolean functions affine classification nonlinearity algebraic degree
2019/5/27
Recently one new key recovery method for a filter generator was proposed. It is based on so-called planar approximations of such a generator. This paper contains the numerical part of the research of ...
Improved Filter Permutators: Combining Symmetric Encryption Design, Boolean Functions, Low Complexity Cryptography, and Homomorphic Encryption, for Private Delegation of Computations
Filter Permutator FLIP Homomorphic Encryption
2019/5/14
Motivated by the application of delegating computation, we revisit the design of filter permutators as a general approach to build stream ciphers that can be efficiently evaluated in a fully homomorph...
Composition of Boolean Functions: An Application to the Secondary Constructions of Bent Functions
Secondary constructions Composition of Boolean functions Bent
2019/4/28
Bent functions are optimal combinatorial objects and have been attracted their research for four decades. Secondary constructions play a central role in constructing bent functions since a complete cl...
Correlation of Quadratic Boolean Functions: Cryptanalysis of All Versions of Full MORUS
Quadratic Boolean function Disjoint quadratic form Correlation attack
2019/3/1
We show that the correlation of any quadratic Boolean function can be read out from its so-called disjoint quadratic form. We further propose a polynomial-time algorithm that can transform an arbitrar...
MArBled Circuits: Mixing Arithmetic and Boolean Circuits with Active Security
MPC Garbled Circuits Secret Sharing
2019/3/1
There are two main ways of performing computation on private data: one method uses linear secret-sharing, in which additions require no communication and multiplications require two secrets to be broa...
A family of boolean functions with good cryptographic properties
Boolean functions linear codes Reed-Solomon codes
2019/2/28
In 2005, [2] Philippe Guillot presented a new construction of Boolean functions using linear codes as an extension of Maiorana-McFarland's construction of bent functions. In this paper, we study a new...
A typical countermeasure against side-channel attacks consists of masking intermediate values with a random number. In symmetric cryptographic algorithms, Boolean shares of the secret are typically us...
Structural Nonlinear Invariant Attacks on T-310: Attacking Arbitrary Boolean Functions
block ciphers Boolean functions non-linearity
2019/1/2
Recent papers show how to construct polynomial invariant attacks for block ciphers, however almost all such results are somewhat weak: invariants are simple and low degree and the Boolean functions te...
Improved upper bound on root number of linearized polynomials and its application to nonlinearity estimation of Boolean functions
Boolean Functions Nonlinearity Linearized Polynomial Root Number
2018/12/3
To determine the dimension of null space of any given linearized polynomial is one of vital problems in finite field theory, with concern to design of modern symmetric cryptosystems. But, the known ge...
Integrative Acceleration of First-Order Boolean Masking for Embedded IoT Devices
side-channel attack mask conversion IoT
2018/11/7
Physical attacks, especially side-channel attacks, are threats to IoT devices which are located everywhere in the field. For these devices, the authentic functionality is important so that the IoT sys...