Programme

Vous pouvez télécharger le programme en format pdf ici.

 

Lundi 2 Novembre

 

9h30
10h30
Chair: Vanessa Vitse
Jean
Kieffer
Calcul d’isogénies à partir d’équations modulaires en genre 2
Simon
Masson
Verifiable Delay Functions from Supersingular Isogenies and Pairings
Arthur
Lavice
Multiplication over extension fields for Pairing-based Cryptography: an Hardware Point of view
10h30 — 10:45 Pause 15 minutes
 

10h45
11h00
Sulamithe
Tsakou
Attaque par calcul d’indices sur les Jacobiennes de courbes hyperelliptiques munies d’endomorphismes
Youssef
El Housni
Optimized and secure pairing-friendly elliptic curve suitable for one layer proof composition
Andy
Russon
The quest for an exception-free windowing elliptic curve scalar multiplication
 

11h00
11h40
Chair: Sonia Belaïd
Loïc
Masure
Vers une meilleure compréhension de l’apprentissage
profond appliqué aux attaques par observation
Nicolas
Bordes
High-order private multiplication in characteristic two revisited
11h40 — 11:50 Pause 10 minutes
 

11h50
12h30
Lucas
Barthelemy
Toward an Asymmetric White-Box Proposal
Adel
Hamdi
Blind Functional Encryption

Mardi 3 Novembre

 

9h30
10h30
Chair: Christina Boura
Paul Huynh Feistel case: when the boomerang comes back
Baptiste Lambin Linearly equivalent S-boxes and the Division Property
Victor Mollimard Efficient Search for Optimal Diffusion Layers of Generalized Feistel Networks
10h30 — 10:45 Pause 15 minutes
 

10h45
11h00
Durand Amaury Codes duaux des codes de Reed-Solomon linéarisés dans le cadre differentiel
Florette Martinez QMDS codes with minimal length
Maxime Bros An Algebraic Attack on Rank Metric Code-Based Cryptosystems
 

11h00
11h40
Chair: Claire Delaplace
Katharina Boudgoust On the classical hardness of Module-LWE: the linear rank case
Charbel Saliba Key exchange based on Ring-LWE using Barnes-Wall lattices
11h40 — 11:50 Pause 10 minutes
 

11h50
12h30
André Schrottenloher Quantum Attacks without Superposition Queries: the Offline Simon’s Algorithm
Yixin Shen Better Quantum Algorithms for Subset-Sums

Mercredi 4 Novembre

AG du GT C2

Jeudi 5 Novembre

 

9h30
10h30
Chair: Eleonora Guerrini
Weiqiang Wen Faster Enumeration-based Lattice Reduction: Root Hermite Factor k^(1/(2k)) in Time k^(k/8 + o(k))
Gabrielle De Micheli Discrete logarithm algorithms in pairing-relevant finite fields
Andrea Lesavourey Retrieving short generators of principal ideals in real Kummer extensions
10h30 — 10:45 Pause 15 minutes
 

10h45
11h00
Antonio Florez
Gutierrez
Improving the key recovery in linear cryptanalysis: An application to PRESENT
Olivier Bernard Twisted PHS: Using the product formula to solve Approx-SVP on ideal lattices
Guillaume Kaim Post-quantum e-voting scheme
 

11h00
11h40
Chair: Aurore Guillevic
Isabella Panaccione The Power Error Locating Pairs algorithm
Matthieu Lequesne On the security of subspace subcodes of Reed-Solomon codes for public key encryption
11h40 — 11:50 Pause 10 minutes
 

11h50
12h30
Aude Le Gluher Complexité asymptotique fine du crible algébrique
Manon Bertin Understanding the complexity of an algebraic attack on the superdetermined DAGS system

Vendredi 6 Novembre

 

9h15
10h35
Chair: Malika Izabachène
Ida Tucker Bandwith efficient threshold ECDSA
Chloé Hébant Linearly-Homomorphic Signatures and Scalable Mix-Nets
Rémi Clarisse Efficacité globale des protocoles à base de couplage
Laura Brouilhet Round-Optimal Constant-Size Blind Signatures
10h35 — 10:45 Pause 10 minutes
 

10h45
11h00
Céline Duguet Zero-knowledge proofs for MLS
Abbass Madi A secure approach for Neural Networks using Homomorphic Encryption and Verifiable Computation
Florian Caullery Exploring Parallelization Strategies for SPHINCS+
 

11h00
11h40
Chair: Sihem Mesnager
Simon Abelard Un algorithme (plus) rapide pour calculer des espaces de Riemann-Roch
Sarah Bordage Interactive Oracle Proof of Proximity for Products of Reed-Solomon Codes
11h40 — 11:50 Pause 10 minutes
 

11h50
12h30
Ilaria Zappatore Enhancing simultaneous rational function reconstruction with errors: adaptive error correction capability and new bounds for applications
Jade Nardi Explicit construction and parameters of projective toric codes

 

Les commentaires sont clos.