Sciweavers

DATE
2003
IEEE
123views Hardware» more  DATE 2003»
13 years 9 months ago
XBM2PLA: A Flexible Synthesis Tool for Extended Burst Mode Machines
This paper describes the results of a new synthesis tool (XBM2PLA) for asynchronous state machines [2]. XBM2PLA generates the boolean functions for an asynchronous circuit. XBM2PL...
Oliver Kraus, Martin Padeffke
SETA
2004
Springer
93views Mathematics» more  SETA 2004»
13 years 10 months ago
Spectral Orbits and Peak-to-Average Power Ratio of Boolean Functions with Respect to the {I, H, N}n Transform
We enumerate the inequivalent self-dual additive codes over GF(4) of blocklength n, thereby extending the sequence A090899 in The On-Line Encyclopedia of Integer Sequences from n =...
Lars Eirik Danielsen, Matthew G. Parker
MFCS
2004
Springer
13 years 10 months ago
Approximating Boolean Functions by OBDDs
In learning theory and genetic programming, OBDDs are used to represent approximations of Boolean functions. This motivates the investigation of the OBDD complexity of approximatin...
Andre Gronemeier
INDOCRYPT
2004
Springer
13 years 10 months ago
On Boolean Functions with Generalized Cryptographic Properties
By considering a new metric, we generalize cryptographic properties of Boolean functions such as resiliency and propagation characteristics. These new definitions result in a bett...
An Braeken, Ventzislav Nikov, Svetla Nikova, Bart ...
FSE
2004
Springer
92views Cryptology» more  FSE 2004»
13 years 10 months ago
Results on Rotation Symmetric Bent and Correlation Immune Boolean Functions
Recent research shows that the class of Rotation Symmetric Boolean Functions (RSBFs), i.e., the class of Boolean functions that are invariant under circular translation of indices,...
Pantelimon Stanica, Subhamoy Maitra, John A. Clark
COCO
2005
Springer
77views Algorithms» more  COCO 2005»
13 years 10 months ago
On the Sensitivity of Cyclically-Invariant Boolean Functions
In this paper we construct a cyclically invariant Boolean function whose sensitivity is Θ(n1/3 ). This result answers two previously published questions. Tur´an (1984) asked if ...
Sourav Chakraborty
DATE
2005
IEEE
116views Hardware» more  DATE 2005»
13 years 10 months ago
Bound Set Selection and Circuit Re-Synthesis for Area/Delay Driven Decomposition
This paper addresses two problems related to disjointsupport decomposition of Boolean functions. First, we present a heuristic for finding a subset of variables, X, which results...
Andrés Martinelli, Elena Dubrova
ACISP
2006
Springer
13 years 10 months ago
On Exact Algebraic [Non-]Immunity of S-Boxes Based on Power Functions
In this paper we are interested in algebraic immunity of several well known highly-nonlinear vectorial Boolean functions (or Sboxes), designed for block and stream ciphers. Unfortu...
Nicolas Courtois, Blandine Debraize, Eric Garrido
DATE
2006
IEEE
88views Hardware» more  DATE 2006»
13 years 10 months ago
Using conjugate symmetries to enhance gate-level simulations
State machine based simulation of Boolean functions is substantially faster if the function being simulated is symmetric. Unfortunately function symmetries are comparatively rare....
Peter M. Maurer
GECCO
2007
Springer
175views Optimization» more  GECCO 2007»
13 years 10 months ago
An evolutionary multiobjective approach to design highly non-linear Boolean functions
The proliferation of all kinds of devices with different security requirements and constraints, and the arms-race nature of the security problem are increasingly demanding the de...
Hernán E. Aguirre, Hiroyuki Okazaki, Yasush...