7 citations · 7 across the 3 of their papers we have counts for
4 papers
Tree exploration in dual-memory model
Dominik Bojko, Karol Gotfryd, Dariusz R. Kowalski +1
We study the problem of online tree exploration by a deterministic mobile agent. Our main objective is to establish what features of the model of the mobile agent and the environme…
On testing pseudorandom generators via statistical tests based on the arcsine law
Paweł Lorek, Grzegorz Łoś, Karol Gotfryd +1
Testing the quality of pseudorandom number generators is an important issue. Security requirements become more and more demanding, weaknesses in this matter are simply not acceptab…
RiffleScrambler - a memory-hard password storing function
Karol Gotfryd, Pawel Lorek, Filip Zagorski
We introduce RiffleScrambler: a new family of directed acyclic graphs and a corresponding data-independent memory hard function with password independent memory access. We prove it…
On Location Hiding in Distributed Systems
Karol Gotfryd, Marek Klonowski, Dominik Pająk
We consider the following problem - a group of mobile agents perform some task on a terrain modeled as a graph. In a given moment of time an adversary gets an access to the graph a…