Calendar

Code-based cryptography workshop

11-5-2011 - 12-5-2011

On May 11-12 a workshop on code-based cryptography will take place in Eindhoven. The workshop is organized by the Coding and Cryptology group at the Technische Universiteit Eindhoven in co-operation with ECRYPT II (European Network of Excellence in Cryptology II).

The goal of this two-day workshop is to introduce the field of coding in cryptography to everyone interested and to discuss recent developments. During the first day there will be talks on code-based cryptography. The research retreat on Day 2 aims at bringing everyone together who is interested in discussions on how to move forward in code-based cryptography.

Click here for the webpage of the workshop.

Back to calendar

Mathematics cluster DIAMANT

Upcoming events

NMC / Diamant symposium
3-4-2018 - 5-4-2018

News - more news

3 DIAMANT PhD positions awarded
19-12-2017

NWO, following a shortlist provided by the DIAMANT board, has decided to award 3 PhD positions to young DIAMANT members: Dion Gijswijt (TU Delft), Jan Steffen Müller (RUG) and Arno Kret (UvA).
Read more.



DIAMANT funding continued
19-12-2017

The funding of all four mathematics clusters has been continued by NWO. For the coming two years 85 kE will be available in each cluster.
Read more.



NWO Call for Tenure Track positions
22-7-2016

NWO has opened a call for tenure track positions. Proposals for these positions, which include one PhD position for each tenure track position, can be submitted directly to NWO by professors from the 4 mathematics clusters, including Diamant. Diamant professors are warmly encouraged to submit proposals. Read more.



Dion Gijswijt and Jordan Ellenberg independently substantially improve capset bound
25-5-2016

A capset in a finite dimensional vector space over the field with 3 elements is a subset that contains no 3-term arithmetic progressions. Dion Gijswijt (TU Delft) and Jordan Ellenberg have independently obtained a bound on the size of a capset that for the first time improves substantially on the trivial bound 3^n. Read more in Terence Tao's blog about these developments.