|讲座名称||A family of statistical tests based on generalized Gambler's ruin problem|
Bartlomiej Surma is graduate student of Computer Security at Wroclaw University of Technology in Poland. His current research include expanding NIST Statistical Test Suite. He is satrting pursuing PhD degree at Max Planck Institute in Saarbrücken, Germany in October 2016.
|讲座内容|| We present a new family of statistical tests and present preliminary results of its application to selected PRNGs. Our tests are based on recent results for generalized, multidimensional Gambler's ruin problem:
1. the probability of winning is not constant, but depends on current fortune
2. the game can be multidimensional - gambler plays against many banks independently
We propose a method which uses source bits (e.g. PRNGs) more efficiently.