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 …
[图书][B] Modern Cryptography Protect your data with fast block CIPHERS
N Goots, B Izotov, A Moldovyan, N Moldovyan - 2003 - books.google.com
Covering the specific issues related to developing fast block ciphers using software and
hardware implementation, this book provides a general picture of modern cryptography …
hardware implementation, this book provides a general picture of modern cryptography …
Bent rectangles
S Agievich - Boolean Functions in Cryptology and Information …, 2008 - ebooks.iospress.nl
We study generalized regular bent functions using a representation by bent rectangles, that
is, a particular class of matrices with certain rows and columns. We characterize affine …
is, a particular class of matrices with certain rows and columns. We characterize affine …
On relationships among avalanche, nonlinearity, and correlation immunity
Y Zheng, XM Zhang - Advances in Cryptology—ASIACRYPT 2000: 6th …, 2000 - Springer
We establish, for the first time, an explicit and simple lower bound on the nonlinearity N f of a
Boolean function f of n variables satisfying the avalanche criterion of degree p, namely, N f≥ …
Boolean function f of n variables satisfying the avalanche criterion of degree p, namely, N f≥ …
Low order approximation of cipher functions
W Millan - International Conference on Cryptography: Policy and …, 1995 - Springer
We present an algorithm allowing the rapid identification of low order nonlinear Boolean
functions. An extension of the method allowing the identification of good low order …
functions. An extension of the method allowing the identification of good low order …
Design of SAC/PC(l) of Order k Boolean Functions and Three Other Cryptographic Criteria
K Kurosawa, T Satoh - International Conference on the Theory and …, 1997 - Springer
A Boolean function f satisfies PC (l) of order k if f (x)⊕ f (x⊕ α) is balanced for any α such
that 1≤ W (α)≤ l even if any k input bits are kept constant, where W (α) denotes the …
that 1≤ W (α)≤ l even if any k input bits are kept constant, where W (α) denotes the …
Immunological algorithms paradigm for construction of Boolean functions with good cryptographic properties
In this paper we investigate the efficiency of two immunological algorithms (CLONALG and
opt-IA) in the evolution of Boolean functions suitable for use in cryptography. Although in its …
opt-IA) in the evolution of Boolean functions suitable for use in cryptography. Although in its …
Relating differential distribution tables to other properties of of substitution boxes
XM Zhang, Y Zheng, H Imai - Designs, Codes and Cryptography, 2000 - Springer
Due to the success of differential and linear attacks on a large number of encryption
algorithms, it is important to investigate relationships among various cryptographic, including …
algorithms, it is important to investigate relationships among various cryptographic, including …
On immunity against Biham and Shamir's “differential cryptanalysis”
CM Adams - Information Processing Letters, 1992 - dl.acm.org
On immunity against Biham and Shamir's “differential cryptanalysis” | Information Processing
Letters skip to main content ACM Digital Library home ACM Association for Computing …
Letters skip to main content ACM Digital Library home ACM Association for Computing …
Rotation symmetric Boolean functions–; count and cryptographic properties
P Stǎnicǎ, S Maitra - Electronic Notes in Discrete Mathematics, 2003 - Elsevier
In 1999, Pieprzyk and Qu presented rotation symmetric (RotS) functions as components in
the rounds of hashing algorithm. Later, in 2002, Cusick and Stǎnicǎ presented further …
the rounds of hashing algorithm. Later, in 2002, Cusick and Stǎnicǎ presented further …