A basis of the conjunctively polynomial-like Boolean functions.
A chaos-based secure cluster protocol for wireless sensor networks
Security mechanisms for wireless sensor networks (WSN) face a great challenge due to the restriction of their small sizes and limited energy. Hence, many protocols for WSN are not designed with the consideration of security. Chaotic cryptosystems have the advantages of high security and little cost of time and space, so this paper proposes a secure cluster routing protocol based on chaotic encryption as well as a conventional symmetric encryption scheme. First, a principal-subordinate chaotic function...
A Functional Approach to the Theory of Prime Implicants
A generalization of the propositional calculus for purposes of the theory of logical nets with probabilistic elements
A large family of Boolean functions
In a series of papers many Boolean functions with good cryptographic properties were constructed using number-theoretic methods. We construct a large family of Boolean functions by using polynomials over finite fields, and study their cryptographic properties: maximum Fourier coefficient, nonlinearity, average sensitivity, sparsity, collision and avalanche effect.
A logical model of HCP.
A perturbation-based model for rectifier circuits.
A simple proof for the existence of exponentially balanced Gray codes.
Algorithmes de plus courts chemins pour traiter des données floues
An Enumerative Problem in Threshold Logic
Application of certain properties of matrices over GF(2) to the description of linear switching networks
Arithmetic unit based on impulse counting