FSE
2007
Springer
14 years 10 months ago
2007
Springer
We investigate the security of n-bit to m-bit vectorial Boolean functions in stream ciphers. Such stream ciphers have higher throughput than those using single-bit output Boolean f...
AAECC
2007
Springer
14 years 10 months ago
2007
Springer
Recently, 9-variable Boolean functions having nonlinearity 241, which is strictly greater than the bent concatenation bound of 240, have been discovered in the class of Rotation Sy...
GLVLSI
2007
IEEE
14 years 11 months ago
2007
IEEE
A special logic synthesis problem is considered for Boolean functions which have large don’t care sets and are irregular. Here, a function is considered as irregular if the inpu...
ECBS
2007
IEEE
14 years 11 months ago
2007
IEEE
The paper addresses software implementation of large sparse systems of Boolean functions. Fast evaluation of such functions with the smallest memory consumption is often required ...
LPNMR
2009
Springer
14 years 11 months ago
2009
Springer
Circumscription is one of the most important formalisms for reasoning with incomplete information. It is equivalent to reasoning under the extended closed world assumption, which a...
ICCD
2002
IEEE
15 years 1 months ago
2002
IEEE
Boolean functions are fundamental to synthesis and verification of digital logic, and compact representations of Boolean functions have great practical significance. Popular repre...
ALT
2001
Springer
15 years 1 months ago
2001
Springer
This paper concerns the design of a Support Vector Machine (SVM) appropriate for the learning of Boolean functions. This is motivated by the need of a more sophisticated algorithm ...
SODA
2010
ACM
15 years 1 months ago
2010
ACM
Let f1, f2, f3 : Fn 2 {0, 1} be three Boolean functions. We say a triple (x, y, x + y) is a triangle in
DCC
2006
IEEE
15 years 4 months ago
2006
IEEE
Boolean functions on the space Fm 2 are not only important in the theory of error-correcting codes, but also in cryptography. In these two cases, the nonlinearity of these functio...