Sciweavers

11 search results - page 1 / 3
» The number of openly generated Boolean algebras
Sort
View
JSYML
2008
82views more  JSYML 2008»
13 years 4 months ago
The number of openly generated Boolean algebras
This article is devoted to two different generalizations of projective Boolean algebras: openly generated Boolean algebras and tightly -filtered Boolean algebras. We show that for ...
Stefan Geschke, Saharon Shelah
DLT
2008
13 years 6 months ago
Hierarchies of Piecewise Testable Languages
The classes of languages which are boolean combinations of languages of the form A a1A a2A . . . A a A , where a1, . . . , a A, k , for a fixed k 0, form a natural hierarchy wit...
Ondrej Klíma, Libor Polák
CRYPTO
2003
Springer
156views Cryptology» more  CRYPTO 2003»
13 years 10 months ago
Fast Algebraic Attacks on Stream Ciphers with Linear Feedback
Many popular stream ciphers apply a filter/combiner to the state of one or several LFSRs. Algebraic attacks on such ciphers [10, 11] are possible, if there is a multivariate relat...
Nicolas Courtois
JSYML
2007
97views more  JSYML 2007»
13 years 4 months ago
Sublocales in formal topology
The paper studies how the localic notion of sublocale transfers to formal topology. For any formal topology (not necessarily with positivity predicate) we define a sublocale to b...
Steven Vickers
JAR
2000
145views more  JAR 2000»
13 years 4 months ago
Logical Cryptanalysis as a SAT Problem
Cryptographic algorithms play a key role in computer security and the formal analysis of their robustness is of utmost importance. Yet, logic and automated reasoning tools are seld...
Fabio Massacci, Laura Marraro