Conference Agenda
Overview and details of the sessions of this conference. Please select a date or location to show only sessions at that day or location. Please select a single session for detailed view (with abstracts and downloads if available).
|
|
|
Session Overview | |
|
Location: Unitobler, F-123 52 seats, 100m^2 |
| Date: Tuesday, 09/Jul/2019 | |
| 10:00am - 12:00pm |
MS132, part 1: Polynomial equations in coding theory and cryptography Location: Unitobler, F-123 Polynomial equations in coding theory and cryptography (25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise) Free resolutions of test sets and their applications to coding theory Algebraic geometry codes from del Pezzo surfaces An Approach to Density Problems in Coding Theory Multivariate Signatures |
| 3:00pm - 5:00pm |
MS132, part 2: Polynomial equations in coding theory and cryptography Location: Unitobler, F-123 Polynomial equations in coding theory and cryptography (25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise) Efficient Key Generation for Rainbow Algebraic techniques for cryptanalysis of rank-based cryptosystems MinRank Problems in Post-Quantum Cryptography Rank Analysis of Cubic Multivariate Cryptosystems |
| Date: Wednesday, 10/Jul/2019 | |
| 10:00am - 12:00pm |
MS145, part 1: Isogenies in Cryptography Location: Unitobler, F-123 Isogenies in Cryptography (25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise) Overview of isogenies in cryptography (Part I) Overview of isogenies in cryptography (Part II) Quantum attacks against isogenies Pre- and post-quantum Diffie-Hellman |
| 3:00pm - 5:00pm |
MS132, part 3: Polynomial equations in coding theory and cryptography Location: Unitobler, F-123 Polynomial equations in coding theory and cryptography (25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise) Classical and Quantum Evaluation Codes at the Trace Roots Optimal curves and codes with locality The Story of Solving Random Quadratic Multivariate Systems of Equations The Zeta Function for Generalized Rank Weights |
| Date: Thursday, 11/Jul/2019 | |
| 10:00am - 12:00pm |
MS145, part 2: Isogenies in Cryptography Location: Unitobler, F-123 Isogenies in Cryptography (25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise) Constant-time isogeny implementations Isogeny-based cryptography: a cryptanalysis perspective Fast isogeny-based signatures Orienting supersingular isogeny graphs |
| 3:00pm - 5:00pm |
MS132, part 4: Polynomial equations in coding theory and cryptography Location: Unitobler, F-123 Polynomial equations in coding theory and cryptography (25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise) Linearized Polynomials in Finite Geometry and Rank-Metric Coding Quantum Algorithms for Optimization over Finite Fields and Applications in Cryptanalysis On the Complexity of ``Superdetermined'' Minrank Instances MinRank Problems Arising from Rank-based Cryptography |
| Date: Friday, 12/Jul/2019 | |
| 10:00am - 12:00pm |
MS145, part 3: Isogenies in Cryptography Location: Unitobler, F-123 Isogenies in Cryptography (25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise) Superspecial genus 2 curves in cryptography Quantum algorithms for finding isogenies between supersingular elliptic curves. Horizontal isogeny graphs Isogeny Graphs of Ordinary Abelian Surfaces and Endomorphism Rings |
| 3:00pm - 5:00pm |
MS162, part 1: Applications of finite fields theory Location: Unitobler, F-123 Applications of finite fields theory (25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise) Introductory Talk Using Mersenne and Fermat numbers in Cryptosystems Cryptographic attacks against filter generator using monomial mapping Permutation and complete rational functions via Chebotarev theorem for function fields |
| Date: Saturday, 13/Jul/2019 | |
| 10:00am - 12:00pm |
MS145, part 4: Isogenies in Cryptography Location: Unitobler, F-123 Isogenies in Cryptography (25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise) Post-quantum signature schemes and more from supersingular isogenies Algorithmic aspects of cryptographic invariant maps from isogenies Verifiable Delay Functions from Isogenies and Pairings Cryptographic goals beyond key exchange and signatures |
| 3:00pm - 5:00pm |
MS162, part 2: Applications of finite fields theory Location: Unitobler, F-123 Applications of finite fields theory (25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise) Public key encryption and key exchange from LDPC codes: LEDAcrypt Cryptological properties of mappings of finite fields Pseudorandom walks on elliptic curves Fractional Jumps and pseudorandom number generation |
