7 citations · 10 across the 6 of their papers we have counts for
Showing math.PRShow all
2 papers · 1 filter
math.PR2019★ 7 cited
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…
math.PR2017★ 3 cited
Strong stationary times and its use in cryptography
Paweł Lorek, Filip Zagórski, Michał Kulis
This paper presents applicability of Strong Stationary Times (SST) techniques in the area of cryptography. The applicability is in three areas: *) Propositions of a new class of cr…