搜索结果: 1-15 共查到“军事学 Boolean Functions”相关记录95条 . 查询时间(0.078 秒)
Count of rotational symmetric bent Boolean functions
Rotational Symmetric Boolean Function Algebraic Normal Form Bent Boolean Function
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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...
A family of boolean functions with good cryptographic properties
Boolean functions linear codes Reed-Solomon codes
font style='font-size:12px;'>
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...
Structural Nonlinear Invariant Attacks on T-310: Attacking Arbitrary Boolean Functions
block ciphers Boolean functions non-linearity
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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...
On Hardware Implementation of Tang-Maitra Boolean Functions
Boolean Functions Bent Functions Cryptology
font style='font-size:12px;'>
2018/7/16
In this paper, we investigate the hardware circuit complexity of the class of Boolean functions recently introduced by Tang and Maitra (IEEE-TIT 64(1): 393 402, 2018). While this class of functions ha...
Hadamard Matrices, d-Linearly Independent Sets and Correlation-Immune Boolean Functions with Minimum Hamming Weights
Boolean functions Correlation-immune Minimum-weight
font style='font-size:12px;'>
2018/3/26
It is known that correlation-immune (CI) Boolean functions used in the framework of side channel attacks need to have low Hamming weights. In 2013, Bhasin et al. studied the minimum Hamming weight of ...
Constructing low-weight dth-order correlation-immune Boolean functions through the Fourier-Hadamard transform
Correlation-immune Fourier-Hadamard transform Low Hamming weight
font style='font-size:12px;'>
2018/1/27
The correlation immunity of Boolean functions is a property related to cryptography, to error correcting codes, to orthogonal arrays (in combinatorics, which was also a domain of interest of S. Golomb...
The Multiplicative Complexity of 6-variable Boolean Functions
Affine equivalence Boolean functions Circuit complexity
font style='font-size:12px;'>
2018/1/12
The multiplicative complexity of a Boolean function is the minimum number of AND gates that are necessary and sufficient to implement the function over the basis (AND, XOR, NOT). Finding the multiplic...
A Review of Existing 4-bit Crypto S-box cryptanalysis Techniques and Two New Techniques with 4-bit Boolean Functions for Cryptanalysis of 4-bit Crypto S-boxes
public-key cryptography BFs
font style='font-size:12px;'>
2017/12/1
4-bit Linear Relations play an important role in Cryptanalysis of 4-bit Bijective Crypto S-boxes. 4-bit finite differences also a major part of cryptanalysis of 4-bit substitution boxes. Count of exis...
Boolean functions with restricted input and their robustness; application to the FLIP cipher
FLIP Boolean function balance
font style='font-size:12px;'>
2017/2/20
We study the main cryptographic features of Boolean functions (balancedness, nonlinearity, algebraic immunity) when, for a given number nn of variables, the input to these functions is restricted to s...