› Minimal Additive Codes and Their Underlying Geometry - Marine LE MEUR, Université de Rennes - UFR Mathématiques
11:00-11:25 (25min)
› Minimal codewords of certain evaluation codes - Rati Ludhani, Centre Inria de Saclay
11:25-11:50 (25min)
› Duals of algebraic geometry codes from Hirzebruch surfaces - Alix Barraud, CNRS; IMB, Université de Bordeaux
11:50-12:15 (25min)
11:15 - 12:30 (1h15)
Talks
Base Tom Souville
› Accréditations Anonymes et Déléguables - Yaël Pajot, Laboratoire de Mathématiques de Versailles
11:15-11:40 (25min)
› Code on graph-based Asynchronous Verifiable Secret Sharing - Hugo Delavenne, Geometry, arithmetic, algorithms, codes and encryption
11:40-12:05 (25min)
› Cryptographic Commitments on Anonymizable Data - Charlène Jojon, LIFO, Université d'Orléans, INSA Centre Val de Loire, Inria Saclay
12:05-12:30 (25min)
› Generic Attacks on Double Block Length Sponge Hashing - César Mathéus, Centre Inria de Paris
14:30-14:55 (25min)
› The revised boomerang connectivity tables and their connection to the difference distribution table - Kirpa Garg, université de rouen normandie
14:55-15:20 (25min)
14:30 - 15:20 (50min)
Talks
Base Tom Souville
› A Gaussian Leftover Hash Lemma for Modules over Number Fields - Joël Felderhoff, Department of Informatics [King's College London]
14:30-14:55 (25min)
› On the Randomness of Log-S-unit lattices - Afonso Li, Institut de Mathématiques de Bordeaux
14:55-15:20 (25min)
› Improved preprocessing for the Crossbred algorithm and application to the MQ problem - Damien Vidal, Modélisation, Information et Systèmes - UR UPJV 4290
15:45-16:10 (25min)
› Overdetermined Bilinear Polynomial Systems - Paul Mekhail, Modélisation, Information et Systèmes - UR UPJV 4290
16:10-16:35 (25min)
15:45 - 16:35 (50min)
Talks
Base Tom Souville
› Unramified abelian covers with many points - Jean Gasnier, Institut de Mathématiques de Bordeaux
15:45-16:10 (25min)
› Application de la méthode Clapoti aux courbes elliptiques ordinaires - Maxime LOUVET, Laboratoire de Mathématiques de Versailles
16:10-16:35 (25min)
› On the Hardness of Learning With Physical Rounding and Noise from Learning With Error - Emeline Repel, Equipe AMACC - Laboratoire GREYC - UMR6072
10:30-10:55 (25min)
› Randomized Nearest-Colattice with an Approx-CVP Oracle for Arbitrary Norm - Wenwen Xia, Institut de Mathématiques de Bordeaux, School of Cyber Science and Engineering, Shanghai Jiao Tong University
10:55-11:20 (25min)
10:30 - 11:20 (50min)
Talks
Base Tom Souville
› Differential clustering for Skinny - Thomas Sagot, Laboratoire Lorrain de Recherche en Informatique et ses Applications
10:30-10:55 (25min)
› Fine-Grained Unambiguous Measurements - Quentin Buzet, Centre Inria de Paris
15:45-16:10 (25min)
› Quantum Maxwell Decoder for qLDPC codes - Bruno Costa Alves Freire, Centre Inria de Paris, Pasqal
16:10-16:35 (25min)
› Quantum Truncated Differential Attacks using Convolutions - Pichollet--mugnier Aurel, Applied Cryptography and Implementation Security
16:35-17:00 (25min)
15:45 - 17:00 (1h15)
Talks
Base Tom Souville
› Linear Code Equivalence Problem Cryptanalysis - Charles Brion, University of Rouen
15:45-16:10 (25min)
› Practical cryptanalysis of pseudorandom correlation generators based on quasi-Abelian syndrome decoding - Mickael Hamdad, Faculté des sciences et ingénierie de Sorbonne Université
16:10-16:35 (25min)
› Proving modern code-based dual attacks - Charles Meyer-Hilfiger, Université de Rennes, Irisa
16:35-17:00 (25min)
› Practical Study on Solving Polynomial Systems corresponding to Algebraic Attacks on Symmetric Primitives - Baptiste Daumen, Centre Inria de Paris
10:30-10:55 (25min)
› SubkeySearch: Key recovery on pointwise-keyed weak PRFs - Antoine Sidem, Télécom Paris
10:55-11:20 (25min)
10:30 - 11:20 (50min)
Talks
Base Tom Souville
› Fast Pseudorandom Correlation Functions from Sparse LPN with Applications to Two-Party ECDSA and Schnorr - Lennart Braun, Institut de Recherche en Informatique Fondamentale
10:30-10:55 (25min)
› The Signature Scheme Zalcon An integer-friendly variant of Falcon - Gaël CLAUDEL, Centre Inria de l'Université de Rennes
10:55-11:20 (25min)
› Étude de méthodes de preuves de contre-mesures face aux attaques par canaux auxiliaires dans le Random Probing Model - Ghozlane Boukacem, CryptoExperts, LIP6 Sorbonne Université
10:30-10:55 (25min)
› Towards a Constant Leakage Rate: Verifying Security in the Random-Probing Model - Sara Sahraee, Smart Integrated Electronic Systems
10:55-11:20 (25min)
10:30 - 11:20 (50min)
Talks
Base Tom Souville
› A computational framework for principally polarized abelian varieties - Etienne Piasecki, Unité de Mathématiques Pures et Appliquées
10:30-10:55 (25min)
› Solving the Principal Ideal Problem over quaternionic matrices for isogeny based cryptography. - Julien Soumier, INRIA nancy
10:55-11:20 (25min)
› Complexity analysis of the Support-Minors modeling of the MinRank problem - Alban Gilard, University of Rouen
11:30-11:55 (25min)
› A MinRank-based encryption scheme à la Alekhnovich-Regev - Romaric NEVEU, XLIM
11:55-12:20 (25min)
11:40 - 12:30 (50min)
Talks
Base Tom Souville
› Cryptanalysis of ZUC - Florent Mazelet
11:40-12:05 (25min)
› Differential-Linear Attacks from New Distinguishers: The case of SERPENT and PRESENT - Thierno Mamoudou SABALY, Université de Lorraine, CNRS, Inria, LORIA, Nancy, France
12:05-12:30 (25min)
› Suitable LDPC family for MPC applications - Félix Frelot, XLIM
15:45-16:10 (25min)
› Public Traceability in Threshold Decryption - Nathan Papon, Laboratoire Traitement et Communication de lÍnformation
16:10-16:35 (25min)
› RHQC: post-quantum ratcheted key exchange from coding assumptions - Julien Juaneda, Fédération ENAC ISAE-SUPAERO ONERA, Laboratoire de recherche coopératif dans les télécommunications spatiales et aéronautiques
16:35-17:00 (25min)
15:45 - 17:00 (1h15)
Talks
Base Tom Souville
› A post-quantum encryption scheme based on linearized Reed-Solomon codes - Kayodé Epiphane Nouetowa, Institut de Recherche Mathématique de Rennes
15:45-16:10 (25min)
› Constant-time decoding of Gabidulin codes and their generalizations with application to RQC - Anthony Fraga, Mathématiques & Sécurité de l'information
16:10-16:35 (25min)
› Local codes in rank metric - Camille Garnier, XLIM
16:35-17:00 (25min)
› Théorie et pratique de la cryptographie en boite blanche. - Azevedo Oliveira Paco, Laboratoire de Mathématiques de Versailles, Thales
09:00-09:25 (25min)
› Modèles d'apprentissage profond appliqués aux attaques par canaux auxiliaires contre les implémentations sécurisées d'algorithmes de cryptographie post-quantique -
09:25-09:50 (25min)
9:00 - 9:50 (50min)
Talks
Base Tom Souville
› Exploring the Set of APN Functions - Pierre Galissant, Inria
09:00-09:25 (25min)
› New Generalized APN functions of the lowest algebraic degree - Noureddine El-Asri, Université de Rouen Normandie
09:25-09:50 (25min)
› Are these lattices isomorphic? A quest for finer invariants - Guilhem Mureau, Institut de Mathématiques de Bordeaux
10:10-10:35 (25min)
› Humbert singular relations and linear modular embeddings of modular and Shimura curves - Desirée Gijón Gómez, Inria Nancy
10:35-11:00 (25min)
10:10 - 11:00 (50min)
Talks
Base Tom Souville
› ALFOMs and the Moirai: Quantifying the Performance/Security Tradeoff for ZK-friendly Hash Functions - Aurélien Boeuf, Inria de Paris
10:10-10:35 (25min)
› Masking Security in Prime Field Symmetric Ciphers - Noémie Akpaki, Thales SIX GTS France
10:35-11:00 (25min)