## Events Search and Views Navigation

## June 2018

## September 2018

### Gengran Hu – Hangzhou Dianzi University

On reductions from subset sum problem to shortest vector problem. The shortest vector problem (SVP) is a fundamental problem in lattice theory and its applications in cryptography. The hardness of SVP is established by constructing reductions from the subset sum problem to SVP.…

Find out more »## October 2018

### Elisa Gorla – University of Neuchâtel

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 carried on with a quantum computer. Their security relies on…

Find out more »### Elisa Gorla – University of Neuchâtel

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 rank. After an introduction to rank-metric codes, I will introduce q-polymatroids --…

Find out more »### Elisa Gorla – University of Neuchâtel

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 will introduce a family of ideals named after Cartwright and…

Find out more »### Larry Rolen – Vanderbilt University

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 to the hyperbolicity of Jensen polynomials for Riemann's Xi-function. This hyperbolicity has…

Find out more »## November 2018

### Introductory lecture

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.

Find out more »### Daniel Apon – National Institute of Standards and Technology

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 that are difficult or intractable for conventional (classical/digital) computers. If…

Find out more »### Umberto Martínez-Peñas – University of Toronto

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 constitute the first general family of maximum sum-rank distance (MSRD)…

Find out more »### Jintai Ding – University of Cincinnati

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 fundamental building block in blochchain technology is actually cryptographic algorithms,…

Find out more »