## Events Search and Views Navigation

## November 2017

### Edoardo Persichetti – Florida Atlantic University

Code-based Cryptography for Post-Quantum Standardization In this talk, I will discuss some of the most recent developments in code-based cryptography and present the main candidates for NIST's post-quantum standardization call.

Find out more »## December 2017

### Solly Parenti – University of Wisconsin-Madison

The Colmez Conjecture The Faltings height of an abelian variety is a fundamental invariant that was introduced in the proof of the Mordell conjecture. Pierre Colmez formulated a conjectural interpretation of the Faltings height of a CM abelian variety in…

Find out more »## March 2018

### Gauri Joshi – Carnegie Mellon University

Distributed Storage Erasure codes, originally designed to provide reliability against noise on communication channels, are now widely used in distributed storage systems. Distributed storage systems require the codes to have new properties such as low-cost repair of failed nodes, high…

Find out more »### Gauri Joshi – Carnegie Mellon University

Coded Computing Large-scale distribute computing frameworks such as MapReduce and Spark employ massive parallelization of jobs. While parallelism drastically reduces computation time, slow or straggling nodes can become a bottleneck in job completion. In this talk, we will study erasure codes for…

Find out more »### Gauri Joshi – Carnegie Mellon University

Rateless Codes Rateless fountain codes are a class of erasure codes where the source generates an unlimited stream of symbols until the data is recovered at the receiver. This rateless property makes them well-suited for many applications including multicast communication, distributed…

Find out more »## April 2018

### Melvyn Nathanson – City University of New York

Solved and unsolved problems in additive number theory This will be a survey of recent results in combinatorial and additive number theory. The central object is the set of sums of elements in a finite or infinite set of integers. This…

Find out more »## 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 »