2006
DOI: 10.1016/j.ic.2006.01.004
|View full text |Cite
|
Sign up to set email alerts
|

Aperiodic propagation criteria for Boolean functions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
44
0

Year Published

2006
2006
2016
2016

Publication Types

Select...
6

Relationship

4
2

Authors

Journals

citations
Cited by 16 publications
(44 citation statements)
references
References 16 publications
0
44
0
Order By: Relevance
“…In the nega-Hadamard transform context, the basic idea of this result is explained in [5] and equation (15) of [13]. In Lemma 2 we are able to use Hadamard transform because unlike the definition in [5,13] our negacrosscorrelation does not include the factor (−1) wt(u) .…”
Section: Properties Of Nega-hadamard Transformmentioning
confidence: 99%
“…In the nega-Hadamard transform context, the basic idea of this result is explained in [5] and equation (15) of [13]. In Lemma 2 we are able to use Hadamard transform because unlike the definition in [5,13] our negacrosscorrelation does not include the factor (−1) wt(u) .…”
Section: Properties Of Nega-hadamard Transformmentioning
confidence: 99%
“…{I, H, N } n , where a is now an affine function from GF(2) |R H |+|R N | → Z 4 . Q can also be used to assess the block cipher attack scenario where one has full read/write access to a subset of plaintext bits and access to all ciphertext bits [9]. Using similar arguments, Q HN summarises all possible Z 4 -linear approximations to a Boolean function, i.e.…”
Section: Definitionmentioning
confidence: 99%
“…Constructions of Boolean functions with good aperiodic properties is not a welldeveloped area of research in cryptography [12,9].…”
Section: Introductionmentioning
confidence: 99%
“…We then focus on the construction of bipolar arrays in C n 2 , which can be described by generalised Boolean functions, where these functions have good aperiodic properties [9]. By re-expressing the autocorrelation and Fourier properties of these functions using unitary matrix terminology, we view our problem within a wider context, where the multidimensional continuous discrete Fourier transform is a tensor product of members of an infinite-size set of 2 × 2 unitary matrices [25,19,28].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation