Searching for authors named "Matthias Krause" – sorted by Relevance.
11 documents found, showing 1 through 10.
Next 10 →
-
BDD-based cryptanalysis of keystream generators
- …Abstract. Many of the keystream generators which are used in practice are LFSR-based in the sense that they produce the keystream according to a rule y = C(L(x)), where L(x) denotes an internal linear bitstream, produced by a small number of parallel linear feedback shift registers (LFSRs), and C de…
- Cited by 17 (0 self) – Add To MetaCart
-
On the Computational Power of Boolean Decision Lists
- …We study the computational power of decision lists over AND-functions versus threshold- circuits. AND-decision lists are a natural generalization of formulas in disjunctive or conjunctive normal form. We show that, in contrast to CNF- and DNF-formulas, there are functions with small AND-decision…
- Cited by 4 (0 self) – Add To MetaCart
-
On the minimal Hardware Complexity of Pseudorandom Function Generators
- …. A set F of Boolean functions is called a pseudorandom function generator (PRFG) if communicating with a randomly chosen secret function from F cannot be efficiently distinguished from communicating with a truly random function. We ask for the minimal hardware complexity of a PRFG. This question is…
- Cited by 7 (1 self) – Add To MetaCart
-
Improved Cryptanalysis of the Self-Shrinking Generator
- …. We propose a new attack on the self-shrinking generator [8].…
- Cited by 11 (4 self) – Add To MetaCart
-
Approximations by OBDDs and the Variable Ordering Problem
- …. Ordered binary decision diagrams (OBDDs) and their variants are motivated by the need to represent Boolean functions in applications. Research concerning these applications leads also to problems and results interesting from theoretical point of view. In this paper, methods from communication comp…
- Cited by 5 (3 self) – Add To MetaCart
-
More on Computing Boolean Functions by Sparse Real Polynomials and related types of Threshold Circuits
- …In this paper we investigate the computational power of threshold-- AND circuits versus threshold--XOR circuits. Starting from the observation that small weight threshold--AND circuits can be simulated by small weight threshold--XOR circuits we pose the question whether a Supported by the grant A…
- Cited by 1 (0 self) – Add To MetaCart
-
On Relations Between Counting Communication Complexity Classes
- …We develop upper and lower bound arguments for counting acceptance modes of communication protocols. A number of separation results for counting communication complexity classes is established. This extends the investigation of the complexity of communication between two processors in terms of compl…
- Cited by 5 (2 self) – Add To MetaCart
-
On the Computational Power of Depth 2 Circuits with Threshold and Modulo Gates
- …We investigate the computational power of depth two circuits consisting of MOD r --gates at the bottom and a threshold gate with arbitrary weights at the top (for short, threshold--MOD r circuits) and circuits with two levels of MOD gates (MOD p -MOD q circuits). In particular, we will show…
- Cited by 39 (4 self) – Add To MetaCart
-
DRAFT
- …vorgelegt von…
- Add To MetaCart
-
On Relations Between Counting Communication Complexity Classes
- …We develop upper and lower bound arguments for counting acceptance modes of communication protocols. A number of separation results for counting communication complexity classes is established. This extends the investigation of the complexity of communication between two processors in terms of compl…
- Add To MetaCart
Showing 1 through 10.
Next 10 →
