Results 11 to 20 of about 36 (36)
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
Disjointed sum of products by a novel technique of orthogonalizing ORing
This work presents a novel combining method called ‘orthogonalizing ORing ◯∨$\bigcirc\!\!\!\!\!\!\vee $’ which enables the building of the union of two conjunctions whereby the result consists of disjointed conjunctions.
Can Yavuz
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
A minimum dimensional class of simple games
Simple games, Hypergraphs, Boolean algebra, Dimension, Codimension, 05C65, 91A12, 94C10,
Josep Freixas, Dorota Marciniak
core +1 more source
Piecewise linear and Boolean models of chemical reaction networks. [PDF]
Veliz-Cuba A, Kumar A, Josić K.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Post's functional completeness theorem.
Notre Dame Journal of Formal Logic, 1990Francis Jeffry Pelletier
exaly
Higher-order nonlinearity of Kasami functions
International Journal of Computer Mathematics, 2012Manish Garg
exaly
Dictator functions maximize mutual information
Annals of Applied Probability, 2018Georg Pichler +2 more
exaly

