24 search results - page 3 / 5 » Duality of Boolean functions and its cryptographic significa... |
FSE
2003
Springer
15 years 2 months ago
2003
Springer
We use the notion of covering sequence, introduced by C. Carlet and Y. Tarannikov, to give a simple characterization of bent functions. We extend it into a characterization of plat...
ISW
2000
Springer
15 years 1 months ago
2000
Springer
An one-way hash chain generated by the iterative use of a one-way hash function on a secret value has recently been widely employed to develop many practical cryptographic solution...
ICPR
2010
IEEE
15 years 1 months ago
2010
IEEE
Using Boolean AND and OR functions to combine the responses of multiple one- or two-class classifiers in the ROC space may significantly improve performance of a detection system o...
FSTTCS
2009
Springer
15 years 4 months ago
2009
Springer
ABSTRACT. We study functionally private approximations. An approximation function g is functionally private with respect to f if, for any input x, g(x) reveals no more information ...
DAC
2006
ACM
15 years 10 months ago
2006
ACM
SAT sweeping is a method for simplifying an AND/INVERTER graph (AIG) by systematically merging graph vertices from the inputs towards the outputs using a combination of structural...