Invited Speakers
Angela Robinson, NIST
Title:
Everything Everywhere All at Once: The Current State of the NIST PQC Project
Abstract:
The National Institute of Standards and Technology (NIST) initiated a public process to select quantum-resistant public key cryptographic algorithms for standardization in response to the substantial development and advancement of quantum computing. NIST issued the public call for submissions to the PQC Standardization Process in December 2016 and, after three rounds of evaluation and analysis, announced the selection of the first algorithms to be standardized: CRYSTALS-KYBER, CRYSTALS-Dilithium, FALCON, and SPHINCS+. In this talk we will discuss the three current NIST PQC endeavors: drafting standards for the four selected algorithms, the remaining algorithms under consideration in the 4th round of evaluation, and the call for additional digital signatures to be considered for standardization.
Biography
Angela Robinson is a mathematician in the Computer Security Division of the National Institute of Standards and Technology (NIST) where she is contributing to the current NIST Post-Quantum Cryptography Standardization effort. She completed her PhD in mathematics at Florida Atlantic University under the supervision of Rainer Steinwandt. Her research includes code-based cryptography, cryptanalysis, and privacy-enhancing cryptography.
Antoine Joux, CISPA Helmholtz Center for Information Security
Title:
Various approaches to signatures schemes
Abstract:
In this talk, we survey the approaches that have been developed to transform an instance of a hard computational problem into identification and signature schemes. In this setting, the goal of the proving or signing party is to demonstrate that it knows a solution to the computational problem in order to establish its identity. In particular, these approaches have been used to create signature schemes based on code or lattice problems that should resist the advent of a universal quantum computer.
Biography
Formerly engineer at the DGA, then scientific deputy director at the DCSSI (now ANSSI), part-time professor at the University of Versailles - Saint-Quentin-en-Yvelines and holder of the Cryptology chair of the Sorbonne University foundation, Antoine Joux is currently a permanent researcher at the CISPA Helmholtz Center for Cybersecurity in Saarbrücken, Germany, and an honorary professor at Saarbrücken University. His specialty is cryptography and much of his work focuses on cryptanalysis, the study of vulnerabilities in cryptographic systems. Co-winner of the Gödel Prize in 2013 and Fellow of the IACR (International Association for Cryptologic Research), he was awarded an ERC Advanced Grant (Almacrypt) on the algorithmic study of mathematical problems whose supposed difficulty serves as a foundation in public key cryptography.
Program
Day 1 (April 22)
Opening remarks (8.45 : 9.00)
Session 1 : Standardization of code-based cryptography (9.00 : 10.30)
Angela Robinson, "Everything Everywhere All at Once: The Current State of the NIST PQC Project"
Dong-Chan Kim, Chang-Yeol Jeon, Yeonghyo Kim, Minji Kim, "PALOMA: Binary Separable Goppa-based KEM "
Coffee break (10.30 : 10.50)
Session 2 : Quasi-Cyclic codes (10.50 : 12.05)
Kirill Vedenev, Yury Kosolapov, "Theoretical analysis of decoding failure rate of non-binary QC-MDPC codes"
Sarah Arpin, Tyler Raven Billingsley, Daniel Rayor Hast, Jun Bo Lau, Ray Perlner, Angela Robinson, "A graph-theoretic approach to analyzing decoding failures of BIKE"
Sanjay Deshpande, Chuanqi Xu, Mamuri Nawan, Kashif Nawaz, Jakub Szefer, "Fast and Efficient Hardware Implementation of HQC"
Lunch (12.05 : 14.00)
Session 3 : Cryptanalysis (14.00 : 15.40)
Hermann Tchatchiem Kamche, Hervé Talé Kalachi, "Solving Systems of Algebraic Equations Over Finite Commutative Rings and Applications"
Freja Elbro, Christian Majenz, "An Algebraic Attack Against McEliece-like Cryptosystems Based on BCH Codes"
Krijn Reijnders, Simona Samardjiska, Monika Trimoska, "Algebraic Attack on the Alternating Trilinear Form Equivalence Problem"
Andre Esser, "Revisiting Nearest-Neighbor-Based Information Set Decoding"
Coffee break (15.40 : 16.00)
Session 4 : Security (16.00 : 17.15)
Pierre-Louis Cayrel, Brice Colombier, Dragoi Vlad, Vincent Grosso, "Punctured Syndrome Decoding Problem : Efficient Side-Channel Attacks Against Classic McEliece"
Elsie Margrethe Staff Mestl, Kristian Gjøsteen, "Modeling Noise-Accepting Key Exchange"
Grigory Kabatiansky, Evgenii Krouk, Cedric Tavernier, "A new code-based cryptosystem revisited"
Day 2 (April 23)
Session 1 : Signatures I (9.00 : 10.30)
Antoine Joux, "Various approaches to signatures schemes"
Javier Verbel, Luis Rivera Zamarripa, Gora Adj, "MinRank in the Head: Short Signatures from Zero-Knowledge Proofs"
Coffee break (10.30 : 10.50)
Session 2 : Decoding algorithms (10.50 : 12.05)
Felicitas Hörmann, Hannes Bartz, "Fast Gao-like Decoding of Horizontally Interleaved Linearized Reed-Solomon Codes"
Consuelo Martínez, Fabián Molina, "Permutation Decoding in Group Codes"
Marco Baldi, Sebastian Bitzer, Alessio Pavoni, Paolo Santini, Antonia Wachter-Zeh, Violetta Weger, "Generic Decoding of Restricted Errors"
Lunch (12.05 : 14.00)
Session 3 : Signatures II (14.00 : 15.40)
Michele Battagliola, Giacomo Borin, Alessio Meneghetti, "LETSS sign together: Linear Equivalence Threshold Signature Scheme"
Stefan Ritterhoff, Georg Maringer, Sebastian Bitzer, Violetta Weger, Sabine Pircher, Patrick Karl, Thomas Schamberger, Jonas Schupp and Antonia Wachter-Zeh, "FuLeeca: A Lee-based Signature Scheme"
Marco Baldi, Sebastian Bitzer, Alessio Pavoni, Paolo Santini, Antonia Wachter-Zeh, Violetta Weger, "Signature Scheme from Restricted Errors"
Anna Baumeister, Hannes Bartz, Antonia Wachter-Zeh, "An Analysis of the RankSign Signature Scheme with Rank Multipliers"
Coffee break (15.40 : 16:00)
Session 4 : Foundations (16.00 : 17:15)
Freeman Slaughter, Felice Manganiello, "Generic Error SDP and Generic Error CVE"
Krijn Reijnders, "Transparent Security for Cryptographic Group Actions"
Jean-Francois Biasse, Giacomo Micheli, "On the resolution of the code equivalence problem"
Concluding remarks (17.15 : 17.30)