[图书][B] Cryptographic applications of analytic number theory: complexity lower bounds and pseudorandomness
I Shparlinski - 2013 - books.google.com
The book introduces new techniques that imply rigorous lower bounds on the com plexity of
some number-theoretic and cryptographic problems. It also establishes certain attractive …
some number-theoretic and cryptographic problems. It also establishes certain attractive …
[图书][B] Further constructions of resilient Boolean functions with very high nonlinearity
One well known method of generating key stream sequences for stream ciphers is to
combine the outputs of several Linear Feedback Shift Registers (LFSR) using a combining …
combine the outputs of several Linear Feedback Shift Registers (LFSR) using a combining …
Evolving Boolean functions satisfying multiple criteria
Many desirable properties have been identified for Boolean functions with cryptographic
applications. Obtaining optimal tradeoffs among such properties is hard. In this paper we …
applications. Obtaining optimal tradeoffs among such properties is hard. In this paper we …
Constructions of almost optimal resilient Boolean functions on large even number of variables
WG Zhang, GZ Xiao - IEEE Transactions on Information Theory, 2009 - ieeexplore.ieee.org
In this paper, a technique on constructing nonlinear resilient Boolean functions is described.
By using several sets of disjoint spectra functions on a small number of variables, an almost …
By using several sets of disjoint spectra functions on a small number of variables, an almost …
Heuristic optimization of Boolean functions and substitution boxes for cryptography
LD Burnett - 2005 - eprints.qut.edu.au
Fundamental to the electronic security of information and communication systems, is the
correct use and application of appropriate ciphers. The strength of these ciphers, particularly …
correct use and application of appropriate ciphers. The strength of these ciphers, particularly …
Analysis of affine equivalent Boolean functions for cryptography
JE Fuller - 2003 - eprints.qut.edu.au
Boolean functions are an important area of study for cryptography. These functions,
consisting merely of one's and zero's, are the heart of numerous cryptographic systems and …
consisting merely of one's and zero's, are the heart of numerous cryptographic systems and …
New constructions of resilient Boolean functions with maximal nonlinearity
Y Tarannikov - Fast Software Encryption: 8th International Workshop …, 2002 - Springer
In this paper we develop a technique that allows to obtain new effective constructions of
highly resilient Boolean functions with high nonlinearity. In particular, we prove that the …
highly resilient Boolean functions with high nonlinearity. In particular, we prove that the …
Construction of nonlinear resilient boolean functions using" small" affine functions
In this correspondence, we use affine functions on a small number of variables to construct
resilient functions on a large number of variables. We show that by properly combining these …
resilient functions on a large number of variables. We show that by properly combining these …
New constructions of resilient functions with strictly almost optimal nonlinearity via non-overlap spectra functions
The design of n-variable t-resilient functions with strictly almost optimal (SAO) nonlinearity (>
2 n− 1− 2 n 2, n even) appears to be a rather difficult task. The known construction methods …
2 n− 1− 2 n 2, n even) appears to be a rather difficult task. The known construction methods …
[HTML][HTML] A Maiorana–McFarland type construction for resilient Boolean functions on n variables (n even) with nonlinearity> 2n-1-2n/2+ 2n/2-2
In this paper, we present a construction method of m-resilient Boolean functions with very
high nonlinearity for low values of m. The construction only considers functions in even …
high nonlinearity for low values of m. The construction only considers functions in even …