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
Johansson, Thomas, +2 more
core +3 more sources
Evaluating the Resistance of Stream Ciphers with Linear Feedback Against Fast Algebraic Attacks [PDF]
, 2006 In this paper we evaluate the resistance of stream ciphers with linear feedback against fast algebraic attacks. We summarize the current knowledge about fast algebraic attacks, develop new and more efficient algorithms to evaluate the resistance against ...
An Braeken +5 more
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.
Zhang Fangguo, Du Yusong, Liu Meicheng
core +3 more sources
Notion of Algebraic Immunity and Its evaluation Related to Fast Algebraic Attacks [PDF]
IACR Cryptol. ePrint Arch., 2006 It has been noted recently that algebraic (annihilator) immunity alone does not provide sufficient resistance against algebraic attacks. In this regard, given a Boolean function $f$, just checking the minimum degree annihilators of $f, 1+f$ is not enough
Subhamoy Maitra +2 more
core +3 more sources
On the Existence of Boolean Functions with Optimal Resistance against Fast Algebraic Attacks [PDF]
IACR Cryptol. ePrint Arch., 2012 It has been pointed out that an $n$-variable Boolean function $f$ has optimal resistance against fast algebraic attacks if and only if there does not exist a nonzero $n$-variable Boolean function $g$ of degree lower than $\frac{n}{2}$ such that $fg=h ...
Fangguo Zhang, Yusong Du
core +3 more sources
On the Resistance of Prime-variable Rotation Symmetric Boolean Functions against Fast Algebraic Attacks [PDF]
IACR Cryptol. ePrint Arch., 2015 Boolean functions used in stream ciphers should have many cryptographic properties in order to help resist different kinds of cryptanalytic attacks. The resistance of Boolean functions against fast algebraic attacks is an important cryptographic property.
Baodian Wei +3 more
core +3 more sources
Algebraic Description and Simultaneous Linear Approximations of Addition in Snow 2.0. [PDF]
, 2008 In this paper we analyse the algebraic properties over the field GF(2) of the addition modulo 2pn. We look at implicit quadratic equations describing this operation, and at probabilistic conditional linear equations.
Nicolas T. Courtois +3 more
core +1 more source
Generating highly nonlinear resilient Boolean functions resistance against algebraic and fast algebraic attacks [PDF]
Security and Communication Networks, 2014 ABSTRACTBoolean functions play an important role in the design of stream ciphers. In this paper, a simulated annealing algorithm is designed to obtain Boolean functions satisfying all the needed criteria: high nonlinearity, 1‐resiliency, optimal algebraic degree, optimal (or suboptimal) algebraic immunity, and good immunity to fast algebraic attacks ...
Jun-Po Yang, Wei-Guo Zhang
openaire +2 more sources
S-Box on Subgroup of Galois Field
Cryptography, 2019 In substitution−permutation network as a cryptosystem, substitution boxes play the role of the only nonlinear part. It would be easy for adversaries to compromise the security of the system without them.
Tariq Shah, Ayesha Qureshi
doaj +1 more source
On the security of the LILI family of stream ciphers against algebraic attacks [PDF]
, 2007 In this paper, we present an algebraic analysis of the LILI family of stream ciphers, and in particular LILI-II, and investigate the security provided against both standard and fast algebraic attacks.
Matt Henricksen +7 more
core +1 more source