Results 21 to 30 of about 1,481 (204)

Fast Algebraic Immunity of Boolean Functions and LCD Codes [PDF]

open access: yesIEEE Transactions on Information Theory, 2021
Nowadays, the resistance against algebraic attacks and fast algebraic attacks are considered as an important cryptographic property for Boolean functions used in stream ciphers. Both attacks are very powerful analysis concepts and can be applied to symmetric cryptographic algorithms used in stream ciphers.
Sihem Mesnager, Chunming Tang 0001
openaire   +4 more sources

An algorithm for constructing S-boxes for block symmetric encryption

open access: yesUniversal Journal of Mathematics and Applications, 2018
This article presents an algorithm for the generation of S-boxes with the maximum algebraic immunity and high nonlinearity. The algorithm is founded method of the permutation of output element of S-box. On basis of the proposed method, $S(8\times 8)$-box
Alijon Bozorbayevicha Sattarov   +1 more
doaj   +1 more source

Hybrid multi-criteria decision-making technique for the selection of best cryptographic multivalued Boolean function

open access: yesComplex & Intelligent Systems, 2023
Robustness of modern information confidentiality algorithm depends on its individual components. Modern block ciphers highly depend on two components namely confusion and diffusion.
Nabilah Abughazalah   +2 more
doaj   +1 more source

Constructing Higher Nonlinear Odd-Variable RSBFs With Optimal AI and Almost Optimal FAI

open access: yesIEEE Access, 2019
Rotation symmetric Boolean functions (RSBFs) are nowadays studied a lot because of its easy operations and good performance in cryptosystem. This paper constructs a new class of odd-variable RSBFs with optimal algebraic immunity (AI). The nonlinearity of
Yindong Chen   +5 more
doaj   +1 more source

A Substitution Box for Lightweight Ciphers to Secure Internet of Things

open access: yesJournal of King Saud University: Computer and Information Sciences, 2023
The Internet of Things is a resource-constrained device that demands lightweight cryptographic solutions to achieve high performance and optimal security.
V. Panchami, Mahima Mary Mathews
doaj   +1 more source

Fast Algebraic Immunity of $2^m+2$ & $2^m+3$ Variables Majority Function

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

New bound of algebraic immunity of a class of Boolean function

open access: yesTongxin xuebao, 2016
Algebraic immunity quantified the resistance of a Boolean function to the algebraic attack.Recently,Mesnager,et al showed that there were direct linked between the annihilators used in algebraic attacks and the coding theory.They showed that the lower ...
Ye TIAN   +3 more
doaj   +2 more sources

Fast algebraic immunity of Boolean functions

open access: yesAdvances in Mathematics of Communications, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mesnager, Sihem, Cohen, Gérard
openaire   +3 more sources

Boolean functions with restricted input and their robustness; application to the FLIP cipher

open access: yesIACR Transactions on Symmetric Cryptology, 2017
We study the main cryptographic features of Boolean functions (balancedness, nonlinearity, algebraic immunity) when, for a given number n of variables, the input to these functions is restricted to some subset E ...
Claude Carlet   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy