Results 131 to 140 of about 650 (169)

Hypercomplex neural networks: Exploring quaternion, octonion, and beyond in deep learning. [PDF]

MethodsX
Devadas RM, Hiremani V, Preethi, T S, R S, Gujjar P.   +5 more
europepmc   +1 more source

Intelligent decision-making framework for selecting optimized substitution boxes in modern block cipher design. [PDF]

Sci Rep
Khan M.
europepmc   +1 more source

ChebIoD: a Chebyshev polynomial-based lightweight authentication scheme for internet of drones environments. [PDF]

Sci Rep
Al-Mekhlafi ZG, Altmemi JMH, Al-Shareeda MA, Al-Hchaimi AAJ, Homod RZ, Mohammed BA, Alshammari G, Al-Dhlan KA, Alrashdi R, Alkhabra YA.   +9 more
europepmc   +1 more source

Cellular automata based key distribution for lightweight hybrid image encryption with elliptic curve cryptography. [PDF]

Sci Rep
Yogi B, Khan AK, Roy S.
europepmc   +1 more source

Assessment of a VoIP steganalysis method based on statistical analysis and deep neural network. [PDF]

Sci Rep
Moghadasi HA, Dehghani H.
europepmc   +1 more source

Research on Development Progress and Test Evaluation of Post-Quantum Cryptography. [PDF]

Entropy (Basel)
Zhang M, Wang J, Lai J, Dong M, Zhu Z, Ma R, Yang J.   +6 more
europepmc   +1 more source

A novel image encryption framework using Wireworld cellular automaton and hybrid chaotic maps for enhanced security. [PDF]

PLoS One
Alabdullah B, Alsolai H, Alhayan F, Ikram A, Almjally A, Shehab M, Albahar MA.   +6 more
europepmc   +1 more source

A Note on Fast Algebraic Attacks and Higher Order Nonlinearities

, 2011
In this note, we deduce a bound between fast algebraic immunity and higher order nonlinearity (it is the first time that a bound between these two cryptographic criteria is given), and find that a Boolean function should have high r-order nonlinearity to resist fast algebraic attacks.
Qichun Wang, Thomas Johansson 0001
core   +3 more sources

On the Resistance of Boolean Functions against Fast Algebraic Attacks

, 2012
Boolean functions with large algebraic immunity resist algebraic attacks to a certain degree, but they may not resist fast algebraic attacks (FAA's). It is necessary to study the resistance of Boolean functions against FAA's. In this paper, we localize the optimal resistance of Boolean functions against FAA's and introduce the concept of e-fast ...
Yusong Du, Fangguo Zhang, Meicheng Liu
openaire   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Results on highly nonlinear Boolean functions with provably good immunity to fast algebraic attacks

Information Sciences, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Meicheng Liu, Dongdai Lin
exaly   +3 more sources