Partially APN Boolean functions and classes of functions that are not APN infinitely often [PDF]
, 2019 In this paper we define a notion of partial APNness and find various characterizations and constructions of classes of functions satisfying this condition.
Budaghyan, Lilya +4 more
core +3 more sources
On cryptographic properties of (n + 1)-bit S-boxes constructed by known n-bit S-boxes
Journal of Mathematical Cryptology, 2020 S-box is the basic component of symmetric cryptographic algorithms, and its cryptographic properties play a key role in security of the algorithms.
Zhou Yu, Mu Daoguang, Dong Xinfeng
doaj +1 more source
A NOVEL CRITERION FOR GUARANTEED COST CONTROL FOR UNCERTAIN SWITCHED RECURRENT NEURAL NETWORKS
, 2014 This paper studies the problem of guaranteed cost control for a class of uncertain switched recurrent delayed neural networks. The time delay is a continuous function belonging to a given interval, but not necessary to be differentiable.
G. Rajchakit
semanticscholar +1 more source
International Journal of Mathematics and Mathematical Sciences, Volume 26, Issue 11, Page 679-684, 2001., 2001 For an arbitrary undirected graph G, we are designing a logical model for the Hamiltonian Cycle Problem (HCP), using tools of Boolean algebra only. The obtained model is a logic formulation of the conditions for the existence of the Hamiltonian cycle, and uses m Boolean variables, where m is the number of the edges of a graph.
Anatoly D. Plotnikov
wiley +1 more source
Algorithms and formulas for conversion between system signatures and reliability functions [PDF]
, 2015 The concept of signature is a useful tool in the analysis of semicoherent systems with continuous and i.i.d. component lifetimes, especially for the comparison of different system designs and the computation of the system reliability.
Marichal, Jean-Luc
core +2 more sources
Leakage squeezing: Optimal implementation and security evaluation
Journal of Mathematical Cryptology, 2014 Hardware devices can be protected against side-channel attacks by introducing one random mask per sensitive variable. The computation throughout is unaltered if the shares (masked variable and mask) are processed concomitantly, in two distinct registers.
Carlet Claude +3 more
doaj +1 more source
Cryptographic properties of Boolean functions defining elementary cellular automata [PDF]
, 2011 In this work, the algebraic properties of the local transition functions of elementary cellular automata (ECA) were analysed. Specifically, a classification of such cellular automata was done according to their algebraic degree, the balancedness, the ...
A. de la Villa Cuenca +20 more
core +2 more sources
Affine equivalence of monomial rotation symmetric Boolean functions: A Pólya’s theorem approach
Journal of Mathematical Cryptology, 2016 Two Boolean functions are affine equivalent if one can be obtained from the other by applying an affine transformation to the input variables. For a long time, there have been efforts to investigate the affine equivalence of Boolean functions. Due to the
Cusick Thomas W. +2 more
doaj +1 more source
Joint signature of two or more systems with applications to multistate systems made up of two-state components [PDF]
, 2017 The structure signature of a system made up of $n$ components having continuous and i.i.d. lifetimes was defined in the eighties by Samaniego as the $n$-tuple whose $k$-th coordinate is the probability that the $k$-th component failure causes the system ...
Marichal, Jean-Luc +3 more
core +5 more sources
Theory of 3-rotation symmetric cubic Boolean functions
Journal of Mathematical Cryptology, 2015 Rotation symmetric Boolean functions have been extensively studied in the last 15 years or so because of their importance in cryptography and coding theory.
Cusick Thomas W., Cheon Younhwan
doaj +1 more source