484 research outputs found
Twin bent functions, strongly regular Cayley graphs, and Hurwitz-Radon theory
The real monomial representations of Clifford algebras give rise to two
sequences of bent functions. For each of these sequences, the corresponding
Cayley graphs are strongly regular graphs, and the corresponding sequences of
strongly regular graph parameters coincide. Even so, the corresponding graphs
in the two sequences are not isomorphic, except in the first 3 cases. The proof
of this non-isomorphism is a simple consequence of a theorem of Radon.Comment: 13 pages. Addressed one reviewer's questions in the Discussion
section, including more references. Resubmitted to JACODES Math, with updated
affiliation (I am now an Honorary Fellow of the University of Melbourne
A survey of metaheuristic algorithms for the design of cryptographic Boolean functions
Boolean functions are mathematical objects used in diverse domains and have been actively researched for several decades already. One domain where Boolean functions play an important role is cryptography. There, the plethora of settings one should consider and cryptographic properties that need to be fulfilled makes the search for new Boolean functions still a very active domain. There are several options to construct appropriate Boolean functions: algebraic constructions, random search, and metaheuristics. In this work, we concentrate on metaheuristic approaches and examine the related works appearing in the last 25 years. To the best of our knowledge, this is the first survey work on this topic. Additionally, we provide a new taxonomy of related works and discuss the results obtained. Finally, we finish this survey with potential future research directions.</p
A Survey of Metaheuristic Algorithms for the Design of Cryptographic Boolean Functions
Boolean functions are mathematical objects used in diverse domains and have been actively researched for several decades already. One domain where Boolean functions play an important role is cryptography. There, the plethora of settings one should consider and cryptographic properties that need to be fulfilled makes the search for new Boolean functions still a very active domain. There are several options to construct appropriate Boolean functions: algebraic constructions, random search, and metaheuristics. In this work, we concentrate on metaheuristic approaches and examine the related works appearing in the last 25 years. To the best of our knowledge, this is the first survey work on this topic. Additionally, we provide a new taxonomy of related works and discuss the results obtained. Finally, we finish this survey with potential future research directions
A new class of codes for Boolean masking of cryptographic computations
We introduce a new class of rate one-half binary codes: {\bf complementary
information set codes.} A binary linear code of length and dimension
is called a complementary information set code (CIS code for short) if it has
two disjoint information sets. This class of codes contains self-dual codes as
a subclass. It is connected to graph correlation immune Boolean functions of
use in the security of hardware implementations of cryptographic primitives.
Such codes permit to improve the cost of masking cryptographic algorithms
against side channel attacks. In this paper we investigate this new class of
codes: we give optimal or best known CIS codes of length We derive
general constructions based on cyclic codes and on double circulant codes. We
derive a Varshamov-Gilbert bound for long CIS codes, and show that they can all
be classified in small lengths by the building up construction. Some
nonlinear permutations are constructed by using -codes, based on the
notion of dual distance of an unrestricted code.Comment: 19 pages. IEEE Trans. on Information Theory, to appea
Quantum algorithms for highly non-linear Boolean functions
Attempts to separate the power of classical and quantum models of computation
have a long history. The ultimate goal is to find exponential separations for
computational problems. However, such separations do not come a dime a dozen:
while there were some early successes in the form of hidden subgroup problems
for abelian groups--which generalize Shor's factoring algorithm perhaps most
faithfully--only for a handful of non-abelian groups efficient quantum
algorithms were found. Recently, problems have gotten increased attention that
seek to identify hidden sub-structures of other combinatorial and algebraic
objects besides groups. In this paper we provide new examples for exponential
separations by considering hidden shift problems that are defined for several
classes of highly non-linear Boolean functions. These so-called bent functions
arise in cryptography, where their property of having perfectly flat Fourier
spectra on the Boolean hypercube gives them resilience against certain types of
attack. We present new quantum algorithms that solve the hidden shift problems
for several well-known classes of bent functions in polynomial time and with a
constant number of queries, while the classical query complexity is shown to be
exponential. Our approach uses a technique that exploits the duality between
bent functions and their Fourier transforms.Comment: 15 pages, 1 figure, to appear in Proceedings of the 21st Annual
ACM-SIAM Symposium on Discrete Algorithms (SODA'10). This updated version of
the paper contains a new exponential separation between classical and quantum
query complexit
Relation between spectra of Narain CFTs and properties of associated boolean functions
Recently, the construction of Narain CFT from a certain class of quantum
error correcting codes has been discovered. In particular, the spectral gap of
Narain CFT corresponds to the binary distance of the code, not the genuine
Hamming distance. In this paper, we show that the binary distance is identical
to the so-called EPC distance of the boolean function uniquely associated with
the quantum code. Therefore, seeking Narain CFT with high spectral gap is
equivalent to getting a boolean function with high EPC distance. Furthermore,
this problem can be addressed by finding lower Peak-to-Average Power ratio
(PAR) with respect to the binary truth table of the boolean function. Though
this is neither sufficient nor necessary condition for high EPC distance, we
construct some examples of relatively high EPC distances referring to the
constructions for lower PAR. We also see that codes with high distance are
related to induced graphs with low independence numbers.Comment: 27 pages, 1 figur
- …