Sciweavers

3328 search results - page 95 / 666
» On Plateaued Functions and Their Constructions
Sort
View
IJNSEC
2006
81views more  IJNSEC 2006»
13 years 9 months ago
Small Size Hashes with Enhanced Security
This paper contains techniques for enhancing the strength of any cryptographic hash function. For an "ideal", traditional hash function with an m-bit result, the complex...
Lars R. Knudsen
DAM
2006
88views more  DAM 2006»
13 years 9 months ago
Finding nonnormal bent functions
The question if there exist nonnormal bent functions was an open question for several years. A Boolean function in n variables is called normal if there exists an affine subspace ...
Anne Canteaut, Magnus Daum, Hans Dobbertin, Gregor...
PRL
1998
81views more  PRL 1998»
13 years 8 months ago
Lie generators for computing steerable functions
We present a computational, group-theoretic approach to steerable functions. The approach is group-theoretic in that the treatment involves continuous transformation groups for wh...
Patrick C. Teo, Yacov Hel-Or
COCO
2005
Springer
77views Algorithms» more  COCO 2005»
14 years 2 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
ASPDAC
2007
ACM
80views Hardware» more  ASPDAC 2007»
14 years 29 days ago
Recognition of Fanout-free Functions
Factoring is a logic minimization technique to represent a Boolean function in an equivalent function with minimum literals. When realizing the circuit, a function represented in ...
Tsung-Lin Lee, Chun-Yao Wang