Events

Multivariate cryptography and Groebner bases -- Colloquium talk Multivariate cryptography is one of a handful of proposals for post-quantum cryptographic schemes, i.e., cryptographic schemes that are secure also against attacks …

Rank-metric codes and q-polymatroids Rank-metric codes are vector subspaces of the vector space of matrices of given size over a finite field, equipped with the distance function induced by the …

Universal Groebner bases and Cartwright-Sturmfels ideals Universal Groebner bases are systems of generators of ideals, which are a Groebner basis with respect to any term order. In this talk, I …

Jensen-Pólya Criterion for the Riemann Hypothesis and Related Problems In this talk, I will summarize forthcoming work with Griffin, Ono, and Zagier. In 1927 Pólya proved that the Riemann Hypothesis is equivalent …

NIST's Post-Quantum Cryptography Project (2012-2024) In recent years, there has been a substantial amount of research on quantum computers – machines that exploit quantum mechanical phenomena to solve mathematical problems …

Sum-Rank Codes and Linearized Reed-Solomon Codes The sum-rank metric naturally extends both the Hamming and rank metrics in coding theory. In this talk, we will present linearized Reed-Solomon codes, which …

Quantum-Proof Blockchain. Blockchain technology is now going through explosive development with the aim to develop a new generation of revolutionary financial technology. The most successful example is new digital currency bitcoin. …

The introductory lecture is aimed at sharing background material so that students are better prepared to understand the main seminar. The introductory lecture is open only to students.  

Sporadic Points on Modular Curves Our work is motivated by the following classification problem: For a fixed positive integer d, what finite groups arise as the torsion subgroup of an …