6D SLAM (Simultaneous Localization and Mapping) or 6D Concurrent Localization and Mapping of mobile robots considers six degrees of freedom for the robot pose, namely, the x, y and...
Cryptographic Boolean functions must be complex to satisfy Shannon's principle of confusion. But the cryptographic viewpoint on complexity is not the same as in circuit compl...
This paper presents the optimal compression for sequences with undefined values. Let we have (N -m) undefined and m defined positions in the boolean sequence V of length N. The se...
It is known that, for every constant k 3, the presence of a k-clique (a complete subgraph on k vertices) in an n-vertex graph cannot be detected by a monotone boolean circuit usi...
Given a set of monomials, the Minimum AND-Circuit problem asks for a circuit that computes these monomials using AND-gates of fan-in two and being of minimum size. We prove that t...
We consider the power of single level circuits in the context of graph complexity. We first prove that the single level conjecture fails for fanin-2 circuits over the basis {, , 1...
In this paper we outline two cryptoanalytic attacks against hardware implementation of the shrinking generator by Coppersmith et al., a classic design in low-cost, simple-design p...
Marcin Gomulkiewicz, Miroslaw Kutylowski, Pawel Wl...
It is well known that unconditionally secure bit commitment is impossible even in the quantum world. In this paper a weak variant of quantum bit commitment, introduced independent...
Andreas Jakoby, Maciej Liskiewicz, Aleksander Madr...