Results 11 to 20 of about 20 (20)
Using Inclusion / Exclusion to find Bent and Balanced Monomial Rotation Symmetric Functions
There are many cryptographic applications of Boolean functions. Recently, research has been done on monomial rotation symmetric (MRS) functions which have useful cryptographic properties.
Reid Elizabeth M.
doaj +1 more source
On the confusion coefficient of Boolean functions
The notion of the confusion coefficient is a property that attempts to characterize confusion property of cryptographic algorithms against differential power analysis. In this article, we establish a relationship between the confusion coefficient and the
Zhou Yu +4 more
doaj +1 more source
On the algebraic immunity of multiplexer Boolean functions
A multiplexer generator is a device that accepts two or more inputs and based on some logic sends one of them as output. In a special case when inputs to a multiplexer generator are 2k{2}^{k} bits and one of them is selected according to the value of a ...
Mishra Prasanna R., Pandey Shashi Kant
doaj +1 more source
On cryptographic properties of (n + 1)-bit S-boxes constructed by known n-bit S-boxes
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
Theory of 3-rotation symmetric cubic Boolean functions
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
Cryptographic properties of monotone Boolean functions
We prove various results on monotone Boolean functions. In particular, we prove a conjecture proposed recently, stating that there are no monotone bent Boolean functions.
Carlet Claude +3 more
doaj +1 more source
Affine equivalence of monomial rotation symmetric Boolean functions: A Pólya’s theorem approach
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
Hypercontractivity on the symmetric group
The hypercontractive inequality is a fundamental result in analysis, with many applications throughout discrete mathematics, theoretical computer science, combinatorics and more.
Yuval Filmus +3 more
doaj +1 more source
Characterizing the upper bound on the transparency order of (n, m)-functions
Transparency order (TO{\mathcal{TO}}) is one of the indicators used to measure the resistance of (n,m)\left(n,m)-function to differential power analysis.
Zhou Yu +4 more
doaj +1 more source
Super-De Morgan functions and free De Morgan quasilattices
Movsisyan Yuri, Aslanyan Vahagn
doaj +1 more source

