Results 41 to 50 of about 26,341 (261)

Construction of the optimal algebraic immunity Boolean functions with correlation immunity from transformation RSBFs

open access: yesMATEC Web of Conferences, 2016
In this paper, we discuss the effect of the cryptographic properties of translation transformation rotation symmetric Boolean functions. On construction of rotation symmetric Boolean functions with the optimal algebraic immunity, we construct correlation
Huang Jinglian
doaj   +1 more source

Locally monotone Boolean and pseudo-Boolean functions [PDF]

open access: yesDiscrete Applied Mathematics, 2012
We propose local versions of monotonicity for Boolean and pseudo-Boolean functions: say that a pseudo-Boolean (Boolean) function is p-locally monotone if none of its partial derivatives changes in sign on tuples which differ in less than p positions. As it turns out, this parameterized notion provides a hierarchy of monotonicities for pseudo-Boolean ...
Miguel Couceiro   +2 more
openaire   +4 more sources

Boolean Logic‐Based Control Over Recombinant Protein Biomaterial Degradability and Therapeutic Delivery

open access: yesAdvanced Materials, EarlyView.
Fully recombinant protein‐based biomaterials execute complex Boolean logic for user‐programmable material degradation and concomitant therapeutic cargo release. Biologics, such as growth factors, can be incorporated within the crosslinkers as “drugamers”, while encapsulated cells can be released according to nested YES/OR/AND‐type logical operations ...
Murial L. Ross   +3 more
wiley   +1 more source

Low-Latency Boolean Functions and Bijective S-boxes

open access: yesIACR Transactions on Symmetric Cryptology, 2022
In this paper, we study the gate depth complexity of (vectorial) Boolean functions in the basis of {NAND, NOR, INV} as a new metric, called latency complexity, to mathematically measure the latency of Boolean functions.
Shahram Rasoolzadeh
doaj   +1 more source

Optoelectronic Nanofluidic Neural Networks for Ionic Computing

open access: yesAdvanced Materials, EarlyView.
An ion‐based optoelectronic nanofluidic memristor enables neuromorphic computing in aqueous environments. With tunable ionic memory and multimodal synaptic plasticity, it realizes densely connected ionic neural networks capable of image classification, motion prediction, logic computation, and real‐time in‐sensor computing, advancing fully connected ...
Yaxin Huang   +10 more
wiley   +1 more source

A Graph Theoretic Approach to Construct Desired Cryptographic Boolean Functions

open access: yesAxioms, 2019
In this paper, we present four product operations to construct cryptographic boolean functions from smaller ones with predictable Walsh spectrum. A lot of cryptographic properties of boolean functions can be presented by their Walsh spectrum.
Modjtaba Ghorbani   +3 more
doaj   +1 more source

On generalized Boolean functions i

open access: yesDiscrete Mathematics, 1981
AbstractIn this paper we introduce the concept of generalized Boolean function. Such a function has its arguments and values in a Boolean algebra and can be written in a manner similar to the canonical disjunctive form, but instead of the product of simple or complemented variables, the product of values of certain functions is used.
openaire   +2 more sources

From Fiber Bundles to Architected Membranes: Triply Periodic Minimal Surface Architectures for Biohybrid Artificial Lungs

open access: yesAdvanced Materials, EarlyView.
Additively manufactured triply periodic minimal surface (TPMS) membranes offer an architecture‐driven alternative to hollow fiber bundles in artificial lungs. Multiphysics simulations and endothelialized prototypes show that the 3D‐printable membrane architecture improves gas exchange, blood flow distribution, and hemocompatibility, enabling ...
Michael Pflaum   +14 more
wiley   +1 more source

A Lower Bound of Fast Algebraic Immunity of a Class of 1-Resilient Boolean Functions

open access: yesIEEE Access, 2019
Boolean functions should possess high fast algebraic immunity when used in stream ciphers in order to stand up to fast algebraic attacks. However, in previous research, the fast algebraic immunity of Boolean functions was usually calculated by the ...
Yindong Chen   +3 more
doaj   +1 more source

Classification of All t-Resilient Boolean Functions with t + 4 Variables

open access: yesIACR Transactions on Symmetric Cryptology, 2023
We apply Siegenthaler’s construction, along with several techniques, to classify all (n−4)-resilient Boolean functions with n variables, for all values of n ≥ 4, up to the extended variable-permutation equivalence.
Shahram Rasoolzadeh
doaj   +1 more source

Home - About - Disclaimer - Privacy