- Katharina Boudgoust.
- Towards Classical Hardness of Module-LWE: the linear rank case
- Xavier Bonnetain, Akinori Hosoyamada, María Naya-Plasencia, Yu Sasaki and André Schrottenloher.
- Quantum Attacks without Superposition Queries: the Offline Simon’s Algorithm.
- Jean Kieffer.
- Calcul d’isogénies à partir d’équations modulaires en genre 2.
- Gabrielle De Micheli, Rémi Piau and Cécile Pierrot.
- Discrete logarithm algorithms in pairing-relevant finite fields.
- Rémi Clarisse.
- Efficacité globale des protocoles à base de couplage.
- Chloé Hébant, Duong-Hieu Phan and David Pointcheval.
- Linearly-Homomorphic Signatures and Scalable Mix-Nets.
- Magali Bardet, Pierre Briaud, Maxime Bros, Philippe Gaborit, Vincent Neiger, Olivier Ruatta and Jean-Pierre Tillich.
- An Algebraic Attack on Rank Metric Code-Based Cryptosystems.
- Antonio Florez Gutierrez.
- Improving the key recovery in linear cryptanalysis: An application to PRESENT.
- Alain Couvreur and Isabella Panaccione.
- The Power Error Locating Pairs algorithm.
- Olivier Blazy, Laura Brouilhet, Céline Chevalier and Neals Fournaise.
- Round-Optimal Constant-Size Blind Signatures.
- Julien Lavauzelle and Julian Renner.
- Cryptanalyse d’une variante du schéma de McEliece.
- Matthieu Lequesne and Alain Couvreur.
- On the security of subspace subcodes of Reed-Solomon codes for public key encryption.
- Anca Nitulescu, Dario Fiore and David Pointcheval.
- Boosting Verifiable Computation on Encrypted Data.
- Martin R. Albrecht, Shi Bai, Pierre-Alain Fouque, Paul Kirchner, Damien Stehlé and Weiqiang Wen.
- Faster Enumeration-based Lattice Reduction: Root Hermite Factor k^(1/(2k)) in Time k^(k/8 + o(k)).
- Aude Le Gluher, Pierre-Jean Spaenlehauer and Emmanuel Thomé.
- Complexité asymptotique fine du crible algébrique.
- Xavier Bonnetain, Rémi Bricout, André Schrottenloher and Yixin Shen.
- Better Quantum Algorithms for Subset-Sums.
- Baptiste Lambin.
- Linearly equivalent S-boxes and the Division Property.
- Florian Caullery and Marc Manzano.
- Exploring Parallelization Strategies for SPHINCS+.
- Andrea Lesavourey, Thomas Plantard and Willy Susilo.
- Retrieving short generators of principal ideals in real Kummer extensions.
- Simon Abelard.
- Un algorithme (plus) rapide pour calculer des espaces de Riemann-Roch.
- Loïc Masure, Cécile Dumas and Emmanuel Prouff.
- Vers une meilleure compréhension de l’apprentissage profond appliqué aux attaques par observation.
- Patrick Derbez, Pierre-Alain Fouque, Baptiste Lambin and Victor Mollimard.
- Efficient Search for Optimal Diffusion Layers of Generalized Feistel Networks.
- Nicolas Bordes and Pierre Karpman.
- High-order private multiplication in characteristic two revisited.
- Jade Nardi.
- Explicit construction and parameters of projective toric codes.
- Manon Bertin, Ayoub Otmani, Magali Bardet and Couvreur Alain.
- Understanding the complexity of an algebraic attack on the superdetermined DAGS system.
- Youssef El Housni and Aurore Guillevic.
- Optimized and secure pairing-friendly elliptic curve suitable for one layer proof composition.
- Simon Masson.
- Verifiable Delay Functions from Supersingular Isogenies and Pairings.
- Ilaria Zappatore, Eleonora Guerrini and Romain Lebreton.
- Enhancing simultaneous rational function reconstruction with errors: adaptive error correction capability and new bounds for applications.
- Andy Russon.
- The quest for an exception-free windowing elliptic curve scalar multiplication.
- Paul Huynh.
- Feistel case: when the boomerang comes back.
- Florette Martinez and Gilles Zémor.
- QMDS codes with minimal length.
- Sarah Bordage and Daniel Augot.
- Interactive Oracle Proof of Proximity for Products of Reed-Solomon Codes.
- Guillaume Kaim.
- Lattice-based (partially) blind signature without restart – Signature (partiellement) aveugle sans abandon, fondee sur les reseaux euclidiens.
- Lucas Barthelemy.
- Toward an Asymmetric White-Box Proposal.
- Adel Hamdi.
- Blind Functional Encryption.
- Charbel Saliba, Laura Luzzi and Cong Ling.
- Key exchange based on Ring-LWE using Barnes-Wall lattices.
- Abbass Madi.
- A secure approach for Neural Networks usingHomomorphic Encryption and Verifiable Computation.
- Arthur Lavice.
- Multiplication over extension fields for Pairing-based Cryptography: an Hardware Point of view.
- Amaury Durand.
- Codes duaux des codes de Reed-Solomon lin ́earis ́es dans le cadre differentiel.
- Olivier Bernard.
- Twisted PHS: Using the product formula to solve Approx-SVP in Ideal Lattices.
- Céline Duguet.
- Zero-knowledge proofs of MLS.
