Speaker: Tymoteusz Chojecki (UMCS, Lublin, Poland)
Abstract: We study a family of graphs A(n,q). This is a family of small world graphs, which are given by some system of equations. Our field of interest is girth and diameter of these graphs. We use these graphs in post-quantum cryptography, implementing symmetric ciphers and public key algorithms. I will show the results we obtained by implementing our algorithms on a computer using Python and Sage.
Joint work with Vasyl Ustimenko.