4 search results - page 1 / 1 » A Randomised Algorithm for Checking the Normality of Cryptog... |
IFIP
2004
Springer
13 years 10 months ago
2004
Springer
Abstract A Boolean function is called normal if it is constant on flats of certain dimensions. This property is relevant for the construction and analysis of cryptosystems. This p...
DAC
2001
ACM
14 years 5 months ago
2001
ACM
An approach for factoring general boolean functions was described in [15, 16] which is based on graph partitioning algorithms. In this paper, we present a very fast algorithm for ...
STTT
2008
13 years 4 months ago
2008
1 This papers introduces a generic framework for OBDD variants with weighted edges. It covers many boolean and multi-valued OBDD-variants that have been studied in the literature a...
CIE
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...