Teoria prawdopodobieństwa i modelowanie stochastyczne
Paweł Lorek (Uniwersytet Wrocławski)
Data spotkania seminaryjnego:
czwartek, 16. Maj 2019 - 12:15
A) Making a function for calculating password slow is often not enough. Such a function can be evaluated several dozen times faster on GPUs than on CPUs and even several thousand times faster on ASICs (application-specific integrated circuit). A "good" function (memory-hard) should consume lots of memory (GPUs and ASICs would not help then). We introduce RiffleScrambler -- a new family of directed acyclic graphs and a corresponding memory hard function. We prove its memory hardness in the random oracle model. B) We show how to efficiently use SVN (subversion system) -- a software versioning and revision control system (installed on hera) and Mendeley (Reference Manager) in daily work with LaTeX. In particular, we show how one can allow multiple users access our SVN repository on hera.