Revealing Protein–Protein Interactions Using a Graph Theory‐Augmented Deep Learning Approach
This study presents a fast, cost‐efficient approach for classifying protein–protein interactions by integrating graph‐theory parametrization with deep learning (DL). Multiscale features extracted from graph‐encoded polarized‐light microscopy (PLM) images enable accurate prediction of binding strengths.
Bahar Dadfar +5 more
wiley +1 more source
Red Blood Cell Membrane Mechanics Using Discrete Exterior Calculus (DEC) and Optimization
We present a novel DEC approach for calculating RBC shapes applicable to other cell types and membrane problems. We derive an energy minimization equation that can be solved semi‐implicitly, and a Lie derivative method to control node spacing. This novel work should aid computational modeling in many biological situations.
Keith C. Afas, Daniel Goldman
wiley +1 more source
Review of Memristors for In‐Memory Computing and Spiking Neural Networks
Memristors uniquely enable energy‐efficient, brain‐inspired computing by acting as both memory and synaptic elements. This review highlights their physical mechanisms, integration in crossbar arrays, and role in spiking neural networks. Key challenges, including variability, relaxation, and stochastic switching, are discussed, alongside emerging ...
Mostafa Shooshtari +2 more
wiley +1 more source
Balanced Boolean Functions with (more than) Maximum Algebraic Immunity [PDF]
In this correspondence, construction of balanced Boolean functions with maximum possible algebraic (annihilator) immunity (AI) is studied with an additional property which is necessary to resist fast algebraic attack.
Subhamoy Maitra, Deepak Kumar Dalai
core
On Algebraic Immunity of Trace Inverse Functions over Finite Fields with Characteristic Two [PDF]
The trace inverse function $\Tr(\lambda x^{-1})$ over the finite field $\mathbb{F}_{2^n}$ is a class of very important Boolean functions and has be used in many stream ciphers, for example, SFINKS, RAKAPOSHI, the simple counter stream cipher presented by
Guang Gong, Xiutao Feng
core
Almost fully optimized infinite classes of Boolean functions resistant to (fast) algebraic cryptanalysis [PDF]
In this paper the possibilities of an iterative concatenation method towards construction of Boolean functions resistant to algebraic cryptanalysis are investigated.
Pašalić, Enes
core
Vectorial Boolean functions and induced algebraic equations [PDF]
A general mathematical framework behind algebraic cryptanalytic attacks is developed. The framework relates to finding algebraic equations induced by vectorial Boolean functions and, in particular, equations of low algebraic degree.
Jovan Dj. Golic
core
Parameterization of Boolean functions by vectorial functions and associated constructions [PDF]
Despite intensive research on Boolean functions for cryptography for over thirty years, there are very few known general constructions allowing to satisfy all the necessary criteria for ensuring the resistance against all the main known attacks on the ...
Claude Carlet
core
New balanced Boolean functions satisfying all the main cryptographic criteria [PDF]
We study an infinite class of functions which provably achieve an optimum algebraic immunity, an optimum algebraic degree and a good nonlinearity.
Claude Carlet, Keqin Feng
core
A complete study of two classes of Boolean functions for homomorphic-friendly stream ciphers [PDF]
In this paper, we completely study two classes of Boolean functions that are suited for hybrid symmetric-FHE encryption with stream ciphers like FiLIP.
Claude Carlet, Pierrick Méaux
core

