Results 1 to 10 of about 36 (36)
Abstract We report on two preliminary evaluations of a group intervention, targeting vulnerable infants and their mothers within the first 6‐months postpartum. The Mother–Baby Nurture® program aims to strengthen the developing infant–mother attachment relationship by increasing maternal mentalizing.
Sharon Cooke +2 more
wiley +1 more source
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
Bent and generalized bent Boolean functions [PDF]
Mathematics Subject Classification (2000) 94A60 · 94C10 · 06E30The article of record as published may be found at http://dx.doi.org/10.1007/s10623-012-9622-5;In this paper, we investigate the properties of generalized bent functions defined on Zn2 with ...
Thor Martinsen +7 more
core +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
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
Leakage squeezing: Optimal implementation and security evaluation
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
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
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

