CSDAI

Department of Institut Polytechnique de Paris

Group grace

grace

LIX, Ecole Polytechnique

Themes: digital trust

Algorithmic Number Theory, Coding and Cryptography

Contact person: Alain Couvreur, http://www.lix.polytechnique.fr/Labo/Alain.Couvreur/

Web site: https://team.inria.fr/grace/

Journal articles

2024

ref_biblio
Gianira Alfarano, Martino Borello, Alessandro Neri. Outer strong blocking sets. The Electronic Journal of Combinatorics, In press. ⟨hal-04508476⟩
Accès au texte intégral et bibtex
https://hal.science/hal-04508476/file/2301.09590.pdf BibTex
ref_biblio
Elena Berardini, Alain Couvreur, Grégoire Lecerf. A proof of the Brill-Noether method from scratch. ACM Communications in Computer Algebra, 2024, 57 (4), pp.200-229. ⟨10.1145/3653002.3653004⟩. ⟨hal-03762780⟩
Accès au bibtex
https://arxiv.org/pdf/2208.12725 BibTex

2023

ref_biblio
Gustavo Banegas, Ricardo Villanueva-Polanco. On recovering block cipher secret keys in the cold boot attack setting. Cryptography and Communications - Discrete Structures, Boolean Functions and Sequences , In press, ⟨10.1007/s12095-022-00625-z⟩. ⟨hal-03970576⟩
Accès au texte intégral et bibtex
https://hal.science/hal-03970576/file/Cold_Boot_Attacks_CCDS.pdf BibTex
ref_biblio
Gautam Botrel, Youssef El Housni. Faster Montgomery multiplication and Multi-Scalar-Multiplication for SNARKs. IACR Transactions on Cryptographic Hardware and Embedded Systems, 2023, pp.504-521. ⟨10.46586/tches.v2023.i3.504-521⟩. ⟨hal-03922635v1⟩
Accès au texte intégral et bibtex
https://hal.science/hal-03922635/file/EdMSM.pdf BibTex
ref_biblio
Thomas Debris-Alazard, Léo Ducas, Nicolas Resch, Jean-Pierre Tillich. Smoothing Codes and Lattices: Systematic Study and New Bounds. IEEE Transactions on Information Theory, 2023, 69 (9), pp.6006-6027. ⟨10.1109/TIT.2023.3276921⟩. ⟨hal-04276505⟩
Accès au bibtex
https://arxiv.org/pdf/2205.10552 BibTex
ref_biblio
Thomas Debris-Alazard, Maxime Remaud, Jean-Pierre Tillich. Quantum Reduction of Finding Short Code Vectors to the Decoding Problem. IEEE Transactions on Information Theory, In press, pp.1-1. ⟨10.1109/TIT.2023.3327759⟩. ⟨hal-04276190v2⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-04276190/file/article_final.pdf BibTex
ref_biblio
Eleonora Guerrini, Kamel Lairedj, Romain Lebreton, Ilaria Zappatore. Simultaneous Rational Function Reconstruction with Errors: Handling Multiplicities and Poles. Journal of Symbolic Computation, 2023, 116, pp.345-364. ⟨10.1016/j.jsc.2022.10.007⟩. ⟨hal-03620179⟩
Accès au texte intégral et bibtex
https://hal.science/hal-03620179/file/GuerriniLairedjLebretonZappatore.pdf BibTex
ref_biblio
François Morain, Guénaël Renault, Benjamin Smith. Deterministic factoring with oracles. Applicable Algebra in Engineering, Communication and Computing, 2023, 34 (4), pp.663-690. ⟨10.1007/s00200-021-00521-8⟩. ⟨hal-01715832v2⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-01715832/file/hal-oracles.pdf BibTex

2022

ref_biblio
Simon Abelard, Elena Berardini, Alain Couvreur, Grégoire Lecerf. Computing Riemann-Roch spaces via Puiseux expansions. Journal of Complexity, 2022, ⟨10.1016/j.jco.2022.101666⟩. ⟨hal-03281757v2⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-03281757/file/rrgeneral%20%281%29.pdf BibTex
ref_biblio
Simon Abelard, Alain Couvreur, Grégoire Lecerf. Efficient computation of Riemann-Roch spaces for plane curves with ordinary singularities. Applicable Algebra in Engineering, Communication and Computing, 2022, ⟨10.1007/s00200-022-00588-x⟩. ⟨hal-03110135⟩
Accès au texte intégral et bibtex
https://hal.science/hal-03110135/file/rrordinary.pdf BibTex
ref_biblio
Nicolas Aragon, Olivier Blazy, Jean-Christophe Deneuville, Philippe Gaborit, Gilles Zemor. Ouroboros An efficient and provably secure KEM family. IEEE Transactions on Information Theory, 2022, pp.1-1. ⟨10.1109/TIT.2022.3168439⟩. ⟨hal-03679752⟩
Accès au bibtex
BibTex
ref_biblio
Diego F. Aranha, Youssef El Housni, Aurore Guillevic. A survey of elliptic curves for proof systems. Designs, Codes and Cryptography, 2022, Special Issue: Mathematics of Zero-Knowledge, 91 (11), pp.3333-3378. ⟨10.1007/s10623-022-01135-y⟩. ⟨hal-03667798v2⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-03667798/file/AranhaElHousniGuillevic22.pdf BibTex
ref_biblio
Daniel Augot, Sarah Bordage, Jade Nardi. Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes. Designs, Codes and Cryptography, 2022, ⟨10.1007/s10623-022-01134-z⟩. ⟨hal-03454113⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-03454113/file/paper-eccc.pdf BibTex
ref_biblio
Gustavo Banegas, Valerie Gilchrist, Benjamin Smith. Efficient supersingularity testing over F_p and CSIDH key validation. Mathematical Cryptology, 2022, 2 (1), pp.21-35. ⟨hal-03739021⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-03739021/file/main.pdf BibTex
ref_biblio
Slim Bettaieb, Loïc Bidoux, Olivier Blazy, Yann Connan, Philippe Gaborit. A gapless code-based hash proof system based on RQC and its applications. Designs, Codes and Cryptography, 2022, ⟨10.1007/s10623-022-01075-7⟩. ⟨hal-03815797⟩
Accès au bibtex
BibTex
ref_biblio
Olivier Blazy, Laura Brouilhet, Emmanuel Conchon, Mathieu Klingler. Anonymous attribute-based designated verifier signature. Journal of Ambient Intelligence and Humanized Computing, 2022, 68 (9), pp.6233-6244. ⟨10.1007/s12652-022-03827-8⟩. ⟨hal-03815798⟩
Accès au texte intégral et bibtex
https://hal.science/hal-03815798/file/ABDVS.pdf BibTex
ref_biblio
Sarah Bordage, Mathieu Lhotel, Jade Nardi, Hugues Randriam. Interactive Oracle Proofs of Proximity to Algebraic Geometry Codes. Leibniz International Proceedings in Informatics , 2022, ⟨10.4230/LIPIcs.CCC.2022.30⟩. ⟨hal-03142459v2⟩
Accès au texte intégral et bibtex
https://hal.science/hal-03142459/file/LIPIcs.CCC.2022.30.pdf BibTex
ref_biblio
Anne Canteaut, Alain Couvreur, Léo Perrin. Recovering or Testing Extended-Affine Equivalence. IEEE Transactions on Information Theory, 2022, 68 (9), pp.6187 - 6206. ⟨10.1109/TIT.2022.3166692⟩. ⟨hal-03156177⟩
Accès au bibtex
https://arxiv.org/pdf/2103.00078 BibTex
ref_biblio
Mathilde Chenu, Benjamin Smith. Higher-degree supersingular group actions. Mathematical Cryptology, 2022, 1 (2), pp.85-101. ⟨hal-03288075⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-03288075/file/hal.pdf BibTex
ref_biblio
Thomas Debris-Alazard, Leo Ducas, Wessel P.J. van Woerden. An Algorithmic Reduction Theory for Binary Codes: LLL and more. IEEE Transactions on Information Theory, In press, ⟨10.1109/TIT.2022.3143620⟩. ⟨hal-03529739⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-03529739/file/An%20Algorithmic%20Reduction%20Theory%20for%20Binary%20Codes.pdf BibTex
ref_biblio
Samuel Dobson, Steven Galbraith, Benjamin Smith. Trustless unknown-order groups. Mathematical Cryptology, 2022, 1 (2), pp.25-39. ⟨hal-02882161⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-02882161/file/unknown-order.pdf BibTex
ref_biblio
Enric Florit, Benjamin Smith. An atlas of the Richelot isogeny graph. RIMS Kôkyûroku Bessatsu, 2022, Theory and Applications of Supersingular Curves and Supersingular Abelian Varieties, B90, pp.195-219. ⟨hal-03094296v2⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-03094296/file/main.pdf BibTex
ref_biblio
François Morain. Modular curves over number fields and ECM. Research in Number Theory, 2022. ⟨hal-03606355v2⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-03606355/file/nbfields-final.pdf BibTex

2021

ref_biblio
Daniel Augot, Alain Couvreur, Julien Lavauzelle, Alessandro Neri. Rank-metric codes over arbitrary Galois extensions and rank analogues of Reed-Muller codes. SIAM Journal on Applied Algebra and Geometry, 2021, 5 (2), pp.165-199. ⟨10.1137/20M1348583⟩. ⟨hal-02882019⟩
Accès au bibtex
https://arxiv.org/pdf/2006.14489 BibTex
ref_biblio
Gustavo Banegas, Daniel J. Bernstein, Fabio Campos, Tung Chou, Tanja Lange, et al.. CTIDH: Faster constant-time CSIDH. IACR Transactions on Cryptographic Hardware and Embedded Systems, 2021, Lecture Notes in Computer Science, 2021 (4), pp.310-342. ⟨10.46586/tches.v2021.i4.351-387⟩. ⟨hal-03229428⟩
Accès au bibtex
BibTex
ref_biblio
Olivier Blazy, Laura Brouilhet, Celine Chevalier, Patrick Towa, Ida Tucker, et al.. Hardware security without secure hardware: How to decrypt with a password and a server. Theoretical Computer Science, 2021, 895, pp.178-211. ⟨10.1016/j.tcs.2021.09.042⟩. ⟨hal-03378464⟩
Accès au texte intégral et bibtex
https://hal.science/hal-03378464/file/2020-1571.pdf BibTex
ref_biblio
Sarah Bordage, Julien Lavauzelle. On the privacy of a code-based single-server computational PIR scheme. Cryptography and Communications - Discrete Structures, Boolean Functions and Sequences , 2021, 13 (4), pp.519-526. ⟨10.1007/s12095-021-00477-z⟩. ⟨hal-03181082⟩
Accès au bibtex
BibTex
ref_biblio
Jesús-Javier Chi-Domínguez, Francisco Rodríguez-Henríquez, Benjamin Smith. Extending the GLS endomorphism to speed up GHS Weil descent using Magma. Finite Fields and Their Applications, In press, 75, ⟨10.1016/j.ffa.2021.101891⟩. ⟨hal-03233803⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-03233803/file/manuscript.pdf BibTex
ref_biblio
Alain Couvreur, Matthieu Lequesne. On the security of subspace subcodes of Reed-Solomon codes for public key encryption. IEEE Transactions on Information Theory, 2021, 68 (1), pp.632-648. ⟨10.1109/TIT.2021.3120440⟩. ⟨hal-02938812⟩
Accès au bibtex
https://arxiv.org/pdf/2009.05826 BibTex
ref_biblio
Nicholas Coxon. Fast transforms over finite fields of characteristic two. Journal of Symbolic Computation, 2021, 104, pp.824-854. ⟨10.1016/j.jsc.2020.10.002⟩. ⟨hal-01845238v3⟩
Accès au texte intégral et bibtex
https://hal.science/hal-01845238/file/transforms.pdf BibTex
ref_biblio
Steven Galbraith, Lorenz Panny, Benjamin Smith, Frederik Vercauteren. Quantum Equivalence of the DLP and CDHP for Group Actions. Mathematical Cryptology, 2021, 1 (1), pp.40-44. ⟨hal-01963660v2⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-01963660/file/article.pdf BibTex
ref_biblio
Julien Lavauzelle, Razane Tajeddine, Ragnar Freij-Hollanti, Camilla Hollanti. Private Information Retrieval Schemes with Product-Matrix MBR Codes. IEEE Transactions on Information Forensics and Security, 2021, 16, pp.441-450. ⟨10.1109/TIFS.2020.3003572⟩. ⟨hal-01951956v2⟩
Accès au texte intégral et bibtex
https://hal.science/hal-01951956/file/LAST_REVISION.pdf BibTex
ref_biblio
Jade Nardi. Projective toric codes. International Journal of Number Theory, 2021, 18 (01), pp.179-204. ⟨10.1142/S1793042122500142⟩. ⟨hal-03142469⟩
Accès au texte intégral et bibtex
https://hal.science/hal-03142469/file/Projective%20toric%20codes.pdf BibTex

2020

ref_biblio
Régis Blache, Alain Couvreur, Emmanuel Hallouin, David Madore, Jade Nardi, et al.. Anticanonical codes from del Pezzo surfaces with Picard rank one. Transactions of the American Mathematical Society, 2020, ⟨10.1090/tran/8119⟩. ⟨hal-02075926⟩
Accès au texte intégral et bibtex
https://hal.science/hal-02075926/file/AnticanonicalCodesFinal_3.pdf BibTex
ref_biblio
Wouter Castryck, Thomas Decru, Benjamin Smith. Hash functions from superspecial genus-2 curves using Richelot isogenies. Journal of Mathematical Cryptology, 2020, 14 (1), pp.25. ⟨10.1515/jmc-2019-0021⟩. ⟨hal-02067885v2⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-02067885/file/superspecial.pdf BibTex
ref_biblio
Daniel Coggia, Alain Couvreur. On the security of a Loidreau rank metric code based encryption scheme. Designs, Codes and Cryptography, 2020, 88 (9), pp.1941-1957. ⟨10.1007/s10623-020-00781-4⟩. ⟨hal-03049694⟩
Accès au bibtex
https://arxiv.org/pdf/1903.02933 BibTex
ref_biblio
Alain Couvreur, Isabella Panaccione. Power Error Locating Pairs. Designs, Codes and Cryptography, 2020, 88 (8), pp.1561-1593. ⟨10.1007/s10623-020-00774-3⟩. ⟨hal-02196650⟩
Accès au bibtex
https://arxiv.org/pdf/1907.11658 BibTex

2019

ref_biblio
Gianira Alfarano, Martino Borello, Alessandro Neri. A geometric characterization of minimal codes and their asymptotic performance. Advances in Mathematics of Communications, 2019, 16 (1), pp.115. ⟨10.3934/amc.2020104⟩. ⟨hal-03852306⟩
Accès au texte intégral et bibtex
https://hal.science/hal-03852306/file/1911.11738.pdf BibTex
ref_biblio
Benjamin Audoux, Alain Couvreur. On tensor products of CSS Codes. Annales de l’Institut Henri Poincaré (D) Combinatorics, Physics and their Interactions, 2019, 6 (2), pp.239-287. ⟨10.4171/AIHPD/71⟩. ⟨hal-01248760v2⟩
Accès au texte intégral et bibtex
https://hal.science/hal-01248760/file/Article_On%20tensor%20product%20of%20CSS%20codes.pdf BibTex
ref_biblio
Nicholas Coxon. Fast Hermite interpolation and evaluation over finite fields of characteristic two. Journal of Symbolic Computation, 2019, 98, pp.270-283. ⟨10.1016/j.jsc.2019.07.014⟩. ⟨hal-01827583v2⟩
Accès au texte intégral et bibtex
https://hal.science/hal-01827583/file/hermite.pdf BibTex
ref_biblio
Ana I Gomez, Domingo Gomez-Perez, Guénaël Renault. A probabilistic analysis on a lattice attack against DSA. Designs, Codes and Cryptography, 2019, 87 (11), pp.2469-2488. ⟨10.1007/s10623-019-00633-w⟩. ⟨hal-03059975⟩
Accès au bibtex
BibTex
ref_biblio
Julien Lavauzelle, Françoise Levy-Dit-Vehel. Generic constructions of PoRs from codes and instantiations. Journal of Mathematical Cryptology, In press, 13 (2), pp.81--106. ⟨10.1515/jmc-2018-0018⟩. ⟨hal-02053948⟩
Accès au texte intégral et bibtex
https://hal.science/hal-02053948/file/camera-ready.pdf BibTex
ref_biblio
Julien Lavauzelle. Private Information Retrieval from Transversal Designs. IEEE Transactions on Information Theory, 2019, 65 (2), pp.1189-1205. ⟨10.1109/TIT.2018.2861747⟩. ⟨hal-01901014⟩
Accès au texte intégral et bibtex
https://hal.science/hal-01901014/file/pir_final_version.pdf BibTex
ref_biblio
Julien Lavauzelle. Lifted projective Reed–Solomon codes. Designs, Codes and Cryptography, 2019, 87, pp.1541-1575. ⟨10.1007/s10623-018-0552-8⟩. ⟨hal-01901147⟩
Accès au texte intégral et bibtex
https://hal.science/hal-01901147/file/projective-lift.pdf BibTex
ref_biblio
Reynald Lercier, Christophe Ritzenthaler, Florent Rovetta, Jeroen Sijsling, Benjamin Smith. Distributions of traces of Frobenius for smooth plane curves over finite fields. Experimental Mathematics, 2019, 28 (1), pp.39-48. ⟨10.1080/10586458.2017.1328321⟩. ⟨hal-01217995⟩
Accès au bibtex
https://arxiv.org/pdf/1510.05601 BibTex

2018

ref_biblio
Daniel Augot, Pierre Loidreau, Gwezheneg Robert. Generalized Gabidulin codes over fields of any characteristic. Designs, Codes and Cryptography, 2018, 86 (8), pp.1807-1848. ⟨10.1007/s10623-017-0425-6⟩. ⟨hal-01503212⟩
Accès au bibtex
https://arxiv.org/pdf/1703.09125 BibTex
ref_biblio
Christine Bachoc, Alain Couvreur, Gilles Zémor. Towards a function field version of Freiman's Theorem. Algebraic Combinatorics, 2018, 1 (4), pp.501-521. ⟨10.5802/alco.19⟩. ⟨hal-01584034⟩
Accès au bibtex
https://arxiv.org/pdf/1709.00087 BibTex
ref_biblio
Stéphane Ballet, Julia Pieltant. Tower of algebraic function fields with maximal Hasse-Witt invariant and tensor rank of multiplication in any extension of $\mathbb{F}_2$ and $\mathbb{F}_3$. Journal of Pure and Applied Algebra, 2018, 222 (5), pp.1069-1086. ⟨10.1016/j.jpaa.2017.06.007⟩. ⟨hal-01063511v2⟩
Accès au texte intégral et bibtex
https://hal.science/hal-01063511/file/BalletPieltant_JPAA_Submission.pdf BibTex
ref_biblio
Elise Barelli, Peter Beelen, Mrinmoy Datta, Vincent Neiger, Johan Rosenkilde. Two-Point Codes for the Generalized GK Curve. IEEE Transactions on Information Theory, In press, ⟨10.1109/TIT.2017.2763165⟩. ⟨hal-01535513v2⟩
Accès au texte intégral et bibtex
https://hal.science/hal-01535513/file/twopoint_ggkcurve.pdf BibTex

2017

ref_biblio
Craig Costello, Benjamin Smith. Montgomery curves and their arithmetic. Journal of Cryptographic Engineering, 2017, Special issue on Montgomery arithmetic, ⟨10.1007/s13389-017-0157-6⟩. ⟨hal-01483768⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-01483768/file/Monty_arxiv.pdf BibTex
ref_biblio
Alain Couvreur, Ayoub Otmani, Jean-Pierre Tillich. Polynomial Time Attack on Wild McEliece Over Quadratic Extensions. IEEE Transactions on Information Theory, 2017, 63 (1), pp.404--427. ⟨10.1109/TIT.2016.2574841⟩. ⟨hal-01661935⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-01661935/file/article.pdf BibTex
ref_biblio
Alain Couvreur, Irene Márquez-Corbella, Ruud Pellikaan. Cryptanalysis of McEliece Cryptosystem Based on Algebraic Geometry Codes and their subcodes. IEEE Transactions on Information Theory, 2017, 63 (8), pp.5404 - 5418. ⟨hal-01280927⟩
Accès au bibtex
https://arxiv.org/pdf/1401.6025 BibTex

2016

ref_biblio
Alain Couvreur. An upper bound on the number of rational points of arbitrary projective varieties over finite fields. Proceedings of the American Mathematical Society, 2016, 144 (9), pp.3671-3685. ⟨10.1090/proc/13015⟩. ⟨hal-01069510⟩
Accès au bibtex
https://arxiv.org/pdf/1409.7544 BibTex
ref_biblio
François Morain, Charlotte Scribot, Benjamin Smith. Computing cardinalities of Q-curve reductions over finite fields. LMS Journal of Computation and Mathematics, 2016, 19 (A), pp.15. ⟨10.1112/S1461157016000267⟩. ⟨hal-01320388v3⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-01320388/file/qcsea.pdf BibTex
ref_biblio
Benjamin Smith. The Q-curve construction for endomorphism-accelerated elliptic curves. Journal of Cryptology, 2016, 29 (4), pp.27. ⟨10.1007/s00145-015-9210-8⟩. ⟨hal-01064255v2⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-01064255/file/smith-qcurves.pdf BibTex

2015

ref_biblio
Cécile Gonçalves. A Point Counting Algorithm for Cyclic Covers of the Projective Line. Contemporary mathematics, 2015, Algorithmic Arithmetic, Geometry, and Coding Theory, 637, pp.145. ⟨hal-01054645v2⟩
Accès au texte intégral et bibtex
https://hal.science/hal-01054645/file/CecileGoncalvesPointCountingCyclicCovers.pdf BibTex
ref_biblio
Johan Sebastian Rosenkilde Nielsen, Peter Beelen. Sub-quadratic Decoding of One-point Hermitian Codes. IEEE Transactions on Information Theory, 2015, 61 (6), pp.3225-3240 ⟨10.1109/TIT.2015.2424415⟩. ⟨hal-01245062⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-01245062/file/2015_ieee_hermitian.pdf BibTex
ref_biblio
Julia Pieltant, Hugues Randriambololona. New uniform and asymptotic upper bounds on the tensor rank of multiplication in extensions of finite fields. Mathematics of Computation, 2015, 84 (294), pp.2023-2045. ⟨10.1090/S0025-5718-2015-02921-4⟩. ⟨hal-00828153⟩
Accès au texte intégral et bibtex
https://hal.science/hal-00828153/file/HR-JP_-_New_uniform_and_asymptotic_upper_bounds.pdf BibTex
ref_biblio
Karem Slim. La réhabilitation améliorée en chirurgie : un nouveau concept pour le bien-être des patients. Oxymag, 2015, 28, pp.8 - 10. ⟨10.1016/j.oxy.2015.04.003⟩. ⟨hal-03487585⟩
Accès au texte intégral et bibtex
https://hal.science/hal-03487585/file/S0990131015000547.pdf BibTex
ref_biblio
Benjamin Smith. Easy scalar decompositions for efficient scalar multiplication on elliptic curves and genus 2 Jacobians. Contemporary mathematics, 2015, Algorithmic Arithmetic, Geometry, and Coding Theory, 637, pp.15. ⟨hal-00874925⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-00874925/file/easy.pdf BibTex

2014

ref_biblio
M. Borges-Quintana, M A. Borges-Trenard, Irene Márquez-Corbella, Edgar Martinez-Moro. Computing coset leaders and leader codewords of binary codes. Journal of Algebra and Its Applications, 2014, pp.19. ⟨10.1142/S0219498815501285⟩. ⟨hal-01088431⟩
Accès au bibtex
BibTex
ref_biblio
Alain Couvreur. Codes and the Cartier Operator. Proceedings of the American Mathematical Society, 2014, 142, pp.1983-1996. ⟨hal-00710451v2⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-00710451/file/couvreur_cartier_final.pdf BibTex
ref_biblio
Alain Couvreur, Ayoub Otmani, Jean-Pierre Tillich. New identities relating wild Goppa codes. Finite Fields and Their Applications, 2014, 29, pp.178-197. ⟨10.1016/j.ffa.2014.04.007⟩. ⟨hal-00880994⟩
Accès au texte intégral et bibtex
https://hal.science/hal-00880994/file/Wild_Goppa.pdf BibTex
ref_biblio
Alain Couvreur, Philippe Gaborit, Valérie Gauthier-Umana, Ayoub Otmani, Jean-Pierre Tillich. Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes. Designs, Codes and Cryptography, 2014, 73 (2), pp.641-666. ⟨10.1007/s10623-014-9967-z⟩. ⟨hal-01096172⟩
Accès au bibtex
BibTex
ref_biblio
Nicholas Coxon. List decoding of number field codes. Designs, Codes and Cryptography, 2014, 72 (3), pp.687-711. ⟨10.1007/s10623-013-9803-x⟩. ⟨hal-01947490⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-01947490/file/manuscript_ncoxon.pdf BibTex
ref_biblio
Nicolas Delfosse. Decoding color codes by projection onto surface codes. Physical Review A : Atomic, molecular, and optical physics [1990-2015], 2014, 89, pp.012317. ⟨10.1103/PhysRevA.89.012317⟩. ⟨hal-00855003⟩
Accès au texte intégral et bibtex
https://hal.science/hal-00855003/file/color_decoding.pdf BibTex
ref_biblio
Andreas Enge, François Morain. Generalised Weber Functions. Acta Arithmetica, 2014, 164 (4), pp.309-341. ⟨10.4064/aa164-4-1⟩. ⟨inria-00385608v2⟩
Accès au texte intégral et bibtex
https://inria.hal.science/inria-00385608/file/weber.pdf BibTex
ref_biblio
Irene Márquez-Corbella, Edgar Martinez-Moro, Ruud Pellikaan, Ruano Diego. Computational aspects of retrieving a representation of an algebraic geometry code. Journal of Symbolic Computation, 2014, Mathematical and computer algebra techniques in cryptology, 64, pp.67-87. ⟨10.1016/j.jsc.2013.12.007⟩. ⟨hal-01088430⟩
Accès au bibtex
BibTex
ref_biblio
Johan Sebastian Rosenkilde Nielsen, Alexander Zeh. Multi-Trial Guruswami--Sudan Decoding for Generalised Reed--Solomon Codes. Designs, Codes and Cryptography, 2014, pp.1-21. ⟨10.1007/s10623-014-9951-7⟩. ⟨hal-00975927⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-00975927/file/hal-arxiv20140409.pdf BibTex

2013

ref_biblio
Jérémy Berthomieu, Grégoire Lecerf, Guillaume Quintin. Polynomial root finding over local rings and application to error correcting codes. Applicable Algebra in Engineering, Communication and Computing, 2013, 24 (6), pp.413-443. ⟨10.1007/s00200-013-0200-5⟩. ⟨hal-00642075v2⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-00642075/file/main36.pdf BibTex
ref_biblio
Alain Couvreur, Nicolas Delfosse, Gilles Zemor. A construction of quantum LDPC codes from Cayley graphs. IEEE Transactions on Information Theory, 2013, 59 (9), pp.6087-6098. ⟨10.1109/TIT.2013.2261116⟩. ⟨hal-00632257v4⟩
Accès au texte intégral et bibtex
https://hal.science/hal-00632257/file/v3_Long_Cayley.pdf BibTex
ref_biblio
François Morain. Modular equations for some $\eta$-products. Acta Arithmetica, 2013, 161 (4), pp.26. ⟨10.4064/aa161-4-1⟩. ⟨inria-00564221⟩
Accès au texte intégral et bibtex
https://inria.hal.science/inria-00564221/file/wme.pdf BibTex
ref_biblio
Guillaume Quintin, Morgan Barbier, Christophe Chabot. On Generalized Reed-Solomon Codes Over Commutative and Noncommutative Rings. IEEE Transactions on Information Theory, 2013, 59 (9), pp.5882-5897. ⟨10.1109/TIT.2013.2264797⟩. ⟨hal-00670004v2⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-00670004/file/article.pdf BibTex

2012

ref_biblio
Morgan Barbier, Christophe Chabot, Guillaume Quintin. On Quasi-Cyclic Codes as a Generalization of Cyclic Codes. Finite Fields and Their Applications, 2012, 18 (5), pp.904-919. ⟨10.1016/j.ffa.2012.06.003⟩. ⟨inria-00615276v2⟩
Accès au texte intégral et bibtex
https://inria.hal.science/inria-00615276/file/article.pdf BibTex
ref_biblio
Alain Couvreur. The dual minimum distance of arbitrary-dimensional algebraic-geometric codes. Journal of Algebra, 2012, 350 (1), pp.84-107. ⟨10.1016/j.jalgebra.2011.09.030⟩. ⟨inria-00540022v3⟩
Accès au texte intégral et bibtex
https://inria.hal.science/inria-00540022/file/couvreur_jag_corrected_final_version.pdf BibTex
ref_biblio
Luca de Feo, Éric Schost. Fast Arithmetics in Artin-Schreier Towers over Finite Fields. Journal of Symbolic Computation, 2012, 47 (7), pp.771-792. ⟨10.1016/j.jsc.2011.12.008⟩. ⟨hal-00505799⟩
Accès au bibtex
https://arxiv.org/pdf/1002.2594 BibTex
ref_biblio
Benjamin Smith. Computing low-degree isogenies in genus 2 with the Dolgachev-Lehavi method. Contemporary mathematics, 2012, Arithmetic, Geometry, Cryptography and Coding Theory, 574, pp.159-170. ⟨inria-00632118v2⟩
Accès au texte intégral et bibtex
https://inria.hal.science/inria-00632118/file/isogenies.pdf BibTex
ref_biblio
Alexander Zeh, Sergey Bezzateev. A New Bound on the Minimum Distance of Cyclic Codes Using Small-Minimum-Distance Cyclic Codes. Designs, Codes and Cryptography, 2012, pp.229-246. ⟨hal-00710290v3⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-00710290/file/ZehBezzateev_BoundMinimumDistance_hal_arxiv.pdf BibTex

Conference papers

2024

ref_biblio
Anaïs Barthoulot, Olivier Blazy, Sébastien Canard. Cryptographic Accumulators: New Definitions, Enhanced Security, and Delegatable Proofs. AFRICACRYPT 2024 - 15th International Conference on Cryptology, Jul 2024, Douala, Cameroon. In press. ⟨hal-04618343⟩
Accès au texte intégral et bibtex
https://hal.science/hal-04618343/file/main.pdf BibTex
ref_biblio
Alain Couvreur, Anne Canteaut, Léo Perrin. On the Properties of the Ortho-Derivatives of Quadratic Functions. WCC 2024 - The Thirteenth International Workshop on Coding and Cryptography, Jun 2024, Perugia, Italy. ⟨hal-04648515⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-04648515/file/onefile.pdf BibTex

2023

ref_biblio
Gustavo Banegas, Juliane Krämer, Tanja Lange, Michael Meyer, Lorenz Panny, et al.. Disorientation Faults in CSIDH. EUROCRYPT 2023 - Advances in Cryptology, Apr 2023, Lyon, France. pp.310-342, ⟨10.1007/978-3-031-30589-4_11⟩. ⟨hal-04333521⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-04333521/file/2022-1202.pdf BibTex
ref_biblio
Anaïs Barthoulot, Olivier Blazy, Sébastien Canard. Dually Computable Cryptographic Accumulators and Their Application to Attribute Based Encryption. CANS 2023 - Cryptology and Network Security, Oct 2023, Augusta, United States. pp.538-562, ⟨10.1007/978-981-99-7563-1_24⟩. ⟨hal-04271645⟩
Accès au texte intégral et bibtex
https://hal.science/hal-04271645/file/2023-1277.pdf BibTex
ref_biblio
Olivier Blazy, Ioana Boureanu, Pascal Lafourcade, Cristina Onete, Léo Robert. How fast do you heal? A taxonomy for post-compromise security in secure-channel establishment. USENIX 2023 - The 32nd USENIX Security Symposium, Aug 2023, Anaheim, United States. pp.5917--5934. ⟨hal-03770735⟩
Accès au texte intégral et bibtex
https://hal.science/hal-03770735/file/main.pdf BibTex
ref_biblio
Olivier Blazy, Céline Chevalier, Guillaume Renaut, Thomas Ricosset, Éric Sageloli, et al.. Efficient Implementation of a Post-Quantum Anonymous Credential Protocol. ARES 2023: The 18th International Conference on Availability, Reliability and Security, Aug 2023, Benevento, Italy. pp.1-11, ⟨10.1145/3600160.3600188⟩. ⟨hal-04283083⟩
Accès au bibtex
BibTex
ref_biblio
Maxime Bombar, Alain Couvreur, Thomas Debris-Alazard. Pseudorandomness of Decoding, Revisited: Adapting OHCP to Code-Based Cryptography. ASIACRYPT 2023 - International Conference on the Theory and Application of Cryptology and Information Security, Dec 2023, Guang Zhou, China. ⟨hal-04308091⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-04308091/file/2022-1751.pdf BibTex
ref_biblio
Maxime Bombar, Geoffroy Couteau, Alain Couvreur, Clément Ducros. Correlated Pseudorandomness from the Hardness of Quasi-Abelian Decoding. CRYPTO 2023 - 43rd Annual International Cryptology Conference, Aug 2023, Santa Barbara, United States. pp.567-601, ⟨10.1007/978-3-031-38551-3_18⟩. ⟨hal-04265638⟩
Accès au texte intégral et bibtex
https://hal.science/hal-04265638/file/2023-845.pdf BibTex
ref_biblio
Geoffroy Couteau, Clément Ducros. Pseudorandom Correlation Functions from Variable-Density LPN, Revisited. IACR 2023 - 26th International Conference on Practice and Theory of Public-Key Cryptography, May 2023, Atlanta, United States. pp.221-250, ⟨10.1007/978-3-031-31371-4_8⟩. ⟨hal-03947831⟩
Accès au texte intégral et bibtex
https://hal.science/hal-03947831/file/2023-650.pdf BibTex
ref_biblio
Alain Couvreur, Ilaria Zappatore. An extension of Overbeck's attack with an application to cryptanalysis of Twisted Gabidulin-based schemes. Post-Quantum Cryptography. PQCrypto 2023, Aug 2023, College Park, United States. pp.3-37, ⟨10.1007/978-3-031-40003-2_1⟩. ⟨hal-04088012⟩
Accès au bibtex
https://arxiv.org/pdf/2305.01287 BibTex
ref_biblio
Alain Couvreur, Rocco Mora, Jean-Pierre Tillich. A new approach based on quadratic forms to attack the McEliece cryptosystem. ASIACRYPT 2023, Dec 2023, Guangzhou, China. ⟨hal-04215135⟩
Accès au bibtex
https://arxiv.org/pdf/2306.10294 BibTex
ref_biblio
Alain Couvreur. Improved decoding of symmetric rank metric errors. 2023 IEEE Information Theory Workshop (ITW), Apr 2023, Saint-Malo, France. pp.238-242, ⟨10.1109/ITW55543.2023.10161649⟩. ⟨hal-03920845⟩
Accès au bibtex
https://arxiv.org/pdf/2212.08713 BibTex
ref_biblio
Youssef El Housni. Pairings in Rank-1 Constraint Systems. ACNS2023 - 21st International Conference on Applied Cryptography and Network Security, Jun 2023, Kyoto, Japan. ⟨hal-03777499⟩
Accès au texte intégral et bibtex
https://hal.science/hal-03777499/file/2022-1162.pdf BibTex
ref_biblio
Angelo Saadeh, Pierre Senellart, Stéphane Bressan. Confidential Truth Finding with Multi-Party Computation. DEXA 2023 - 34th International Conference on Database and Expert Systems Applications, Aug 2023, Penang, Malaysia. ⟨hal-04139281⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-04139281/file/main.pdf BibTex

2022

ref_biblio
Gustavo Banegas, Koen Zandberg, Emmanuel Baccelli, Adrian Herrmann, Benjamin Smith. Quantum-Resistant Software Update Security on Low-Power Networked Embedded Devices. ACNS 2022 - International Conference on Applied Cryptography and Network Security, Jun 2022, Rome, Italy. pp.872-891, ⟨10.1007/978-3-031-09234-3_43⟩. ⟨hal-03931075⟩
Accès au texte intégral et bibtex
https://hal.science/hal-03931075/file/ACNS-paper.pdf BibTex
ref_biblio
Anaïs Barthoulot, Olivier Blazy, Sébastien Canard. (Augmented) Broadcast Encryption from Identity Based Encryption with Wildcard. CANS 2022 - 21st International Conference on Cryptology and Network Security, Nov 2022, Dubai, United Arab Emirates. pp.143-164, ⟨10.1007/978-3-031-20974-1_7⟩. ⟨hal-03856239⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-03856239/file/2022-1192.pdf BibTex
ref_biblio
Slim Bettaieb, Loïc Bidoux, Olivier Blazy, Baptiste Cottier, David Pointcheval. Post-Quantum and UC-secure Oblivious Transfer from SPHF with Grey Zone. 15th International Symposium on Foundations & Practice of Security (FPS – 2022)., Dec 2022, Ottawa, Canada. ⟨hal-03772089v2⟩
Accès au texte intégral et bibtex
https://hal.science/hal-03772089/file/main.pdf BibTex
ref_biblio
Luk Bettale, Julien Eynard, Simon Montoya, Guénaël Renault, Rémi Strullu. Security Assessment of NTRU Against Non-Profiled SCA. CARDIS 2022 - 21st Smart Card Research and Advanced Application Conference, Nov 2022, Birmingham, United Kingdom. pp.248-268, ⟨10.1007/978-3-031-25319-5_13⟩. ⟨hal-03950393⟩
Accès au texte intégral et bibtex
https://hal.science/hal-03950393/file/scantru_cardis.pdf BibTex
ref_biblio
Olivier Blazy, Pierre-Alain Fouque, Thibaut Jacques, Pascal Lafourcade, Cristina Onete, et al.. MARSHAL: Messaging with Asynchronous Ratchets and Signatures for faster HeALing. ACM Symposium on Applied Computing, Apr 2022, Virtual, Czech Republic. pp.1-8, ⟨10.1145/3477314.3507044⟩. ⟨hal-03510612⟩
Accès au texte intégral et bibtex
https://uca.hal.science/hal-03510612/file/main.pdf BibTex
ref_biblio
Olivier Blazy, Saqib Kakvi. Identity-Based Encryption in DDH Hard Groups. AFRICACRYPT 2022 - 13th International Conference on Cryptology in Africa, Jul 2022, Fes, Morocco. pp.81-102, ⟨10.1007/978-3-031-17433-9_4⟩. ⟨hal-03815800⟩
Accès au texte intégral et bibtex
https://hal.science/hal-03815800/file/main.pdf BibTex
ref_biblio
Maxime Bombar, Alain Couvreur. Right-hand side decoding of Gabidulin codes and applications. WCC 2022 : The Twelfth International Workshop on Coding and Cryptography, Mar 2022, Rostock, Germany. ⟨hal-03481406v2⟩
Accès au texte intégral et bibtex
https://hal.science/hal-03481406/file/2112.07322.pdf BibTex
ref_biblio
Maxime Bombar, Alain Couvreur, Thomas Debris-Alazard. On Codes and Learning With Errors over Function Fields. CRYPTO 2022, Aug 2022, Santa Barbara (CA), United States. pp.513-540, ⟨10.1007/978-3-031-15979-4_18⟩. ⟨hal-03597834⟩
Accès au bibtex
https://arxiv.org/pdf/2202.13990 BibTex
ref_biblio
Sarah Bordage, Mathieu Lhotel, Jade Nardi, Hugues Randriam. Interactive Oracle Proofs of Proximity to Algebraic Geometry Codes. CCC 2022 - 37th Computational Complexity Conference, Jul 2022, Philadelphie, United States. pp.30:1--30:45, ⟨10.4230/LIPIcs.CCC.2022.30⟩. ⟨hal-03832439⟩
Accès au texte intégral et bibtex
https://telecom-paris.hal.science/hal-03832439/file/2022%2CIOPP%2Csubmitted.pdf BibTex
ref_biblio
Kévin Carrier, Thomas Debris-Alazard, Charles Meyer-Hilfiger, Jean-Pierre Tillich. Statistical Decoding 2.0: Reducing Decoding to LPN. ASIACRYPT 2022 - 28th Annual International Conference on the Theory and Application of Cryptology and Information Security, Dec 2022, Taipei, Taiwan. pp.477--507, ⟨10.1007/978-3-031-22972-5_17⟩. ⟨hal-03919778⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-03919778/file/asiacrypt.pdf BibTex
ref_biblio
Alexis Challande, Robin David, Guénaël Renault. Building a Commit-level Dataset of Real-world Vulnerabilities. CODASPY 2022 - 12th ACM Conference on Data and Application Security and Privacy, Apr 2022, Baltimore MD USA, United States. pp.101-106. ⟨hal-03477866⟩
Accès au texte intégral et bibtex
https://hal.science/hal-03477866/file/main.pdf BibTex
ref_biblio
Alexis Challande, Robin David, Guénaël Renault. Quokka: A Fast and Accurate Binary Exporter. GreHack 2022 - 10th International Symposium on Research in Grey-Hat Hacking, Nov 2022, Grenoble, France. ⟨hal-03845728⟩
Accès au texte intégral et bibtex
https://hal.science/hal-03845728/file/main.pdf BibTex
ref_biblio
Youssef El Housni, Aurore Guillevic. Families of SNARK-friendly 2-chains of elliptic curves. Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Colin Boyd, May 2022, Trondheim / Hybrid, Norway. pp.367-396, ⟨10.1007/978-3-031-07085-3_13⟩. ⟨hal-03371573v2⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-03371573/file/22_EC_ElHousni_Guillevic_Families_SNARK_friendly_2chains_EC.pdf BibTex
ref_biblio
Youssef El Housni, Aurore Guillevic, Thomas Piellard. Co-factor clearing and subgroup membership testing on pairing-friendly curves. AFRICACRYPT 2022 - 13th International Conference on Cryptology, Jul 2022, Fes, Morocco. pp.518--536, ⟨10.1007/978-3-031-17433-9_22⟩. ⟨hal-03608264v3⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-03608264/file/ElHousniGuillevicPiellard22.pdf BibTex
ref_biblio
Karim Eldefrawy, Tancrède Lepoint, Antonin Leroux. Communication-Efficient Proactive MPC for Dynamic Groups with Dishonest Majorities. ACNS 2022, Jun 2022, Rome, Italy. ⟨hal-03471927⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-03471927/file/ELL_2021_pmpc.pdf BibTex
ref_biblio
Antonin Leroux. A New Isogeny Representation and Applications to Cryptography. ASIACRYPT 2022, Dec 2022, Taipei, Taiwan. ⟨hal-03886737⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-03886737/file/New_Isogeny_Representation.pdf BibTex
ref_biblio
Antonin Leroux. An Effective Lower Bound on the Number of Orientable Supersingular Elliptic Curves. SAC 2022 - Selected Areas in Cryptography, Aug 2022, Windsor, Canada. ⟨hal-03886746⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-03886746/file/publi_SAC.pdf BibTex
ref_biblio
Françoise Levy-Dit-Vehel, Maxime Roméas. Efficient Proofs of Retrievability using Expander Codes. CANS 2022 - 21st International Conference on Cryptology and Network Security, Nov 2022, Abu Dhabi, United Arab Emirates. ⟨hal-03886784⟩
Accès au texte intégral et bibtex
https://hal.science/hal-03886784/file/article.pdf BibTex
ref_biblio
Françoise Levy-Dit-Vehel, Maxime Roméas. A Framework for the Design of Secure and Efficient Proofs of Retrievability. I4CS 2022 - International Conference on Cryptology, Coding Theory, and Cybsersecurity, Oct 2022, Casablanca, Morocco. ⟨hal-03886792⟩
Accès au texte intégral et bibtex
https://hal.science/hal-03886792/file/paper_7937_camera_ready.pdf BibTex
ref_biblio
François Morain. Implementing the Thull-Yap algorithm for computing Euclidean remainder sequences. ISSAC2022, Jul 2022, Villeneuve-d’Ascq, France. ⟨hal-03572271v2⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-03572271/file/ty.pdf BibTex

2021

ref_biblio
Ghada Arfaoui, Olivier Blazy, Xavier Bultel, Pierre-Alain Fouque, Thibaut Jacques, et al.. How to (Legally) Keep Secrets from Mobile Operators. Computer Security - ESORICS 2021 - 26th European Symposium on Research in Computer Security, Darmstadt, Germany, October 4-8, 2021, Proceedings, Part I, 2021, Online, Unknown Region. pp.23--43, ⟨10.1007/978-3-030-88418-5_2⟩. ⟨hal-03478246⟩
Accès au texte intégral et bibtex
https://polytechnique.hal.science/hal-03478246/file/2020-684.pdf BibTex
ref_biblio
Lucas Benmouffok, Kalpana Singh, Nicolas Heulot, Daniel Augot. Privacy-Preserving Initial Public Offering using SCALE-MAMBA and Hyperledger Fabric. ChainTech’2021 is a track of WETICE : the 31st IEEE International Conference on Enabling Technologies: Infrastructure for Collaborative Enterprises, Oct 2021, Basque Coast, Bayonne, France. ⟨hal-03345605⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-03345605/file/ChainTech2021__WETICE_IPO_and_Scale_Mamba_Paper.pdf BibTex
ref_biblio
Slim Bettaieb, Loic Bidoux, Olivier Blazy, Baptiste Cottier, David Pointcheval. Secure Decision Forest Evaluation. ARES 2021 - 16th International Conference on Availability, Reliability and Security, Aug 2021, Vienna, Austria. pp.1-12, ⟨10.1145/3465481.3465763⟩. ⟨hal-03321368⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-03321368/file/main.pdf BibTex
ref_biblio
Luk Bettale, Simon Montoya, Guénaël Renault. Safe-Error Analysis of Post-Quantum Cryptography Mechanisms. FDTC 2021 - Fault Diagnosis and Tolerance in Cryptographie, Sep 2021, Virtual event, France. ⟨hal-03330189⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-03330189/file/article.pdf BibTex
ref_biblio
Maxime Bombar, Alain Couvreur. Decoding supercodes of Gabidulin codes and applications to cryptanalysis. Post-Quantum Cryptography 2021, Jul 2021, Daejeon, South Korea. pp.3-22, ⟨10.1007/978-3-030-81293-5_1⟩. ⟨hal-03256980⟩
Accès au bibtex
https://arxiv.org/pdf/2103.02700 BibTex
ref_biblio
Carlo Brunetta, Georgia Tsaloli, Bei Liang, Gustavo Banegas, Aikaterini Mitrokotsa. Non-interactive, Secure Verifiable Aggregation for Decentralized, Privacy-Preserving Learning. ACISP 2021 - The 26th Australasian Conference on Information Security and Privacy, Dec 2021, Virtual event, Australia. pp.510-528, ⟨10.1007/978-3-030-90567-5_26⟩. ⟨hal-03454325⟩
Accès au bibtex
BibTex
ref_biblio
André Chailloux, Thomas Debris-Alazard, Simona Etinski. Classical and Quantum Algorithms for Generic Syndrome Decoding Problems and Applications to the Lee Metric. PQCrypto 2021 - Post-Quantum Cryptography 12th International Workshop, Jul 2021, Daejeon, South Korea. pp.44-62, ⟨10.1007/978-3-030-81293-5_3⟩. ⟨hal-03529777⟩
Accès au bibtex
https://arxiv.org/pdf/2104.12810 BibTex
ref_biblio
Alexis Challande, Robin David, Guénaël Renault. Exploitation du graphe de dépendance d'AOSP à des fins de sécurité. SSTIC 2021 - Symposium sur la sécurité des technologies de l'information et des communications, Jun 2021, Rennes, France. ⟨hal-03329791⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-03329791/file/SSTIC2021-Article-bgraph-challande_renault_david.pdf BibTex
ref_biblio
Luca de Feo, Cyprien Delpech de Saint Guilhem, Tako Boris Fouotsa, Péter Kutas, Antonin Leroux, et al.. Séta: Supersingular Encryption from Torsion Attacks. ASIACRYPT 2021 - 27th International Conference on the Theory and Application of Cryptology and Information Security, Dec 2021, Singapour, Singapore. pp.249-278, ⟨10.1007/978-3-030-92068-5_9⟩. ⟨hal-03471926⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-03471926/file/DDFKLPSW_2021_seta.pdf BibTex
ref_biblio
Enric Florit, Benjamin Smith. Automorphisms and isogeny graphs of abelian varieties, with applications to the superspecial Richelot isogeny graph. Arithmetic, Geometry, Cryptography, and Coding Theory 2021, May 2021, Luminy, France. ⟨hal-03094375v3⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-03094375/file/florit-smith.pdf BibTex
ref_biblio
Aurélien Greuet, Simon Montoya, Guénaël Renault. On Using RSA/ECC Coprocessor for Ideal Lattice-Based Key Exchange. COSADE 2021, Oct 2021, Lugano, Switzerland. ⟨10.1007/978-3-030-89915-8_10⟩. ⟨hal-03330066⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-03330066/file/HWPolMult.pdf BibTex
ref_biblio
Eleonora Guerrini, Romain Lebreton, Ilaria Zappatore. Polynomial Linear System Solving with Random Errors: New Bounds and Early Termination Technique. ISSAC 2021 - 46th International Symposium on Symbolic and Algebraic Computation, Jul 2021, Saint Petersburg, Russia. pp.171-178, ⟨10.1145/3452143.3465548⟩. ⟨hal-03386106⟩
Accès au texte intégral et bibtex
https://hal.science/hal-03386106/file/main.pdf BibTex
ref_biblio
Georgia Tsaloli, Bei Liang, Carlo Brunetta, Gustavo Banegas, Aikaterini Mitrokotsa. DEVA: Decentralized, Verifiable Secure Aggregation for Privacy-Preserving Learning. ISC 2021 - Information Security 24th International Conference, Nov 2021, Held Virtually, France. pp.296-319, ⟨10.1007/978-3-030-91356-4_16⟩. ⟨hal-03456382⟩
Accès au bibtex
BibTex

2020

ref_biblio
Simon Abelard, Alain Couvreur, Grégoire Lecerf. Sub-quadratic time for Riemann-Roch spaces. The case of smooth divisors over nodal plane projective curves. ISSAC 2020 - 45th International Symposium on Symbolic and Algebraic Computation, Jul 2020, Kalamata, Greece. pp.14-21, ⟨10.1145/3373207.3404053⟩. ⟨hal-02477371⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-02477371/file/paper.pdf BibTex
ref_biblio
Daniel J. Bernstein, Luca de Feo, Antonin Leroux, Benjamin Smith. Faster computation of isogenies of large prime degree. ANTS-XIV - 14th Algorithmic Number Theory Symposium, Jun 2020, Auckland, New Zealand. pp.39-55, ⟨10.2140/obs.2020.4.39⟩. ⟨hal-02514201⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-02514201/file/velusqrt-1.pdf BibTex
ref_biblio
André Chailloux, Thomas Debris-Alazard. Tight and Optimal Reductions for Signatures Based on Average Trapdoor Preimage Sampleable Functions and Applications to Code-Based Signatures. PKC 2020 - IACR International Conference on Public-Key Cryptography, Jun 2020, Edinburgh / Virtual, United Kingdom. pp.453-479, ⟨10.1007/978-3-030-45388-6_16⟩. ⟨hal-03138441⟩
Accès au bibtex
BibTex
ref_biblio
Craig Costello, Benjamin Smith. The supersingular isogeny problem in genus 2 and beyond. PQCrypto 2020 - 11th International Conference on Post-Quantum Cryptography, Apr 2020, Paris, France. ⟨hal-02389073v2⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-02389073/file/pq.pdf BibTex
ref_biblio
Luca de Feo, David Kohel, Antonin Leroux, Christophe Petit, Benjamin Wesolowski. SQISign: compact post-quantum signatures from quaternions and isogenies. ASIACRYPT 2020 - 26th Annual International Conference on the Theory and Application of Cryptology and Information Security, Dec 2020, Daejeon (virtual), South Korea. ⟨hal-03038004⟩
Accès au texte intégral et bibtex
https://hal.science/hal-03038004/file/2020-1240.pdf BibTex
ref_biblio
Youssef El Housni, Aurore Guillevic. Optimized and secure pairing-friendly elliptic curves suitable for one layer proof composition. CANS 2020 - 19th International Conference on Cryptology and Network Security, Dec 2020, Vienna / Virtual, Austria. pp.259-279, ⟨10.1007/978-3-030-65411-5_13⟩. ⟨hal-02962800⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-02962800/file/paper.pdf BibTex
ref_biblio
Aurélien Greuet, Simon Montoya, Guénaël Renault. Attack on LAC Key Exchange in Misuse Situation. CANS 2020 - 19th International conference on Cryptology and Network Security, Dec 2020, Vienna, Austria. ⟨hal-03046345⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-03046345/file/misuseAttackLAC.pdf BibTex

2019

ref_biblio
Daniel Augot, Hervé Chabanne, William George. Practical Solutions to Save Bitcoins Applied to an Identity System Proposal. ICISSP 2019 - 5th International Conference on Information Systems Security and Privacy, Feb 2019, Prague, Czech Republic. pp.511-518, ⟨10.5220/0007443905110518⟩. ⟨hal-02347238⟩
Accès au bibtex
BibTex
ref_biblio
Magali Bardet, Manon Bertin, Alain Couvreur, Ayoub Otmani. Practical Algebraic Attack on DAGS. CBC 2019 - 7th Code-Based Cryptography Workshop, May 2019, Darmstadt, Germany. pp.86-101, ⟨10.1007/978-3-030-25922-8_5⟩. ⟨hal-02125330⟩
Accès au bibtex
https://arxiv.org/pdf/1905.03635 BibTex
ref_biblio
Daniel Cervantes-Vázquez, Mathilde Chenu, Jesús-Javier Chi-Domínguez, Luca de Feo, Francisco Rodríguez-Henríquez, et al.. Stronger and Faster Side-Channel Protections for CSIDH. Latincrypt 2019 - 6th International Conference on Cryptology and Information Security in Latin, Oct 2019, Santiago de Chile, Chile. ⟨10.1007/978-3-030-30530-7_9⟩. ⟨hal-02190863⟩
Accès au bibtex
https://arxiv.org/pdf/1907.08704 BibTex
ref_biblio
Daniel Coggia, Alain Couvreur. On the security of a Loidreau's rank metric code based encryption scheme. WCC 2019 - The Eleventh International Workshop on Coding and Cryptography, Mar 2019, Saint Jacut de la mer, France. ⟨hal-02064465v2⟩
Accès au texte intégral et bibtex
https://hal.science/hal-02064465/file/Article.pdf BibTex
ref_biblio
Alain Couvreur, Philippe Lebacque, Marc Perret. Toward good families of codes from towers of surfaces. Arithmetic, Geometry, Cryptography and Coding Theory, Stéphane Ballet, Gaetan Bisson, Irene Bouw, Jun 2019, Marseille, France. ⟨10.1090/conm/770⟩. ⟨hal-02470343⟩
Accès au bibtex
https://arxiv.org/pdf/2002.02220 BibTex
ref_biblio
Alain Couvreur, Matthieu Lequesne, Jean-Pierre Tillich. Recovering short secret keys of RLCE encryption scheme in polynomial time. PQCrypto 2019 - International Conference on Post-Quantum Cryptography, May 2019, Chongqing, China. pp.133--152, ⟨10.1007/978-3-030-25510-7_8⟩. ⟨hal-01959617⟩
Accès au bibtex
https://arxiv.org/pdf/1805.11489 BibTex

2018

ref_biblio
Elise Barelli, Alain Couvreur. An efficient structural attack on NIST submission DAGS. ASIACRYPT 2018, Dec 2018, Brisbane, Australia. ⟨10.1007/978-3-030-03326-2_4⟩. ⟨hal-01796338⟩
Accès au bibtex
https://arxiv.org/pdf/1805.05429 BibTex
ref_biblio
Luca de Feo, Jean Kieffer, Benjamin Smith. Towards practical key exchange from ordinary isogeny graphs. ASIACRYPT 2018 - 24th Annual International Conference on the Theory and Application of Cryptology and Information Security, Dec 2018, Brisbane, Australia. ⟨10.1007/978-3-030-03332-3_14⟩. ⟨hal-01872817⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-01872817/file/hhs-keyx.pdf BibTex
ref_biblio
Benjamin Smith. Pre- and post-quantum Diffie-Hellman from groups, actions, and isogenies. Arithmetic of Finite Fields - WAIFI 2018, Jun 2018, Bergen, Norway. pp.36, ⟨10.1007/978-3-030-05153-2_1⟩. ⟨hal-01872825v3⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-01872825/file/dh.pdf BibTex

2017

ref_biblio
Daniel Augot, Hervé Chabanne, Thomas Chenevier, William George, Laurent Lamber. A User-Centric System for Verified Identities on the Bitcoin Blockchain. International Workshop on Cryptocurrencies and Blockchain Technology - CBT'17, Sep 2017, Oslo, Norway. ⟨hal-01611251⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-01611251/file/accgl-cbt.pdf BibTex
ref_biblio
Daniel Augot, Hervé Chabanne, Olivier Clémot, William George. Transforming face-to-face identity proofing into anonymous digital identity using the Bitcoin blockchain. PST 2017 - International Conference on Privacy, Security and Trust, Aug 2017, Calgary, Canada. pp.1-10. ⟨hal-01611297⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-01611297/file/accg-pst-finalversion.pdf BibTex
ref_biblio
Elise Barelli. On the security of Some Compact Keys for McEliece Scheme. WCC 2017 - The Tenth International Workshop on Coding and Cryptography, Sep 2017, St Petersbourg, Russia. pp.1-9. ⟨hal-01674546⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-01674546/file/quasi-cyclic_alt_codes.pdf BibTex
ref_biblio
Laurent Grémy, Aurore Guillevic, François Morain, Emmanuel Thomé. Computing discrete logarithms in $GF(p^6)$. Selected Areas in Cryptography – SAC 2017, Aug 2017, Ottawa, Canada. pp.85-105, ⟨10.1007/978-3-319-72565-9_5⟩. ⟨hal-01624662⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-01624662/file/p6hd.pdf BibTex
ref_biblio
Julien Lavauzelle. Constructions for efficient Private Information Retrieval protocols. WCC 2017 - The Tenth International Workshop on Coding and Cryptography, INRIA; SUAI; Skoltech, Sep 2017, Saint-Petersbourg, Russia. pp.1-12. ⟨hal-01633469⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-01633469/file/pir-camera-ready.pdf BibTex
ref_biblio
Joost Renes, Benjamin Smith. qDSA: Small and Secure Digital Signatures with Curve-based Diffie–Hellman Key Pairs. ASIACRYPT 2017, IACR, Dec 2017, Hong Kong, China. ⟨hal-01585322⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-01585322/file/xkummer.pdf BibTex

2016

ref_biblio
Sean Ballentine, Aurore Guillevic, Elisa Lorenzo García, Chloe Martindale, Maike Massierer, et al.. Isogenies for point counting on genus two hyperelliptic curves with maximal real multiplication. Algebraic Geometry for Coding Theory and Cryptography, Feb 2016, Los Angeles, United States. pp.63-94, ⟨10.1007/978-3-319-63931-4_3⟩. ⟨hal-01421031v3⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-01421031/file/Isogenies_point_counting_genus2RM_17.pdf BibTex
ref_biblio
Ping Ngai Chung, Craig Costello, Benjamin Smith. Fast, uniform scalar multiplication for genus 2 Jacobians with fast Kummers. Selected Areas in Cryptography - SAC 2016, Aug 2016, St John's, Canada. pp.18, ⟨10.1007/978-3-319-69453-5_25⟩. ⟨hal-01353480⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-01353480/file/recovery.pdf BibTex
ref_biblio
Pierre-Alain Fouque, Pierre Karpman, Paul Kirchner, Brice Minaud. Efficient and Provable White-Box Primitives. ASIACRYPT 2016 - 22nd International Conference on the Theory and Application of Cryptology and Information Security, Dec 2016, Hanoï, Vietnam. pp.159 - 188, ⟨10.1007/978-3-662-53887-6_6⟩. ⟨hal-01427810⟩
Accès au texte intégral et bibtex
https://hal.science/hal-01427810/file/h4.pdf BibTex
ref_biblio
Aurore Guillevic, François Morain, Emmanuel Thomé. Solving discrete logarithms on a 170-bit MNT curve by pairing reduction. Selected Areas in Cryptography -- SAC 2016, Aug 2016, St. Johns, Newfoundland, Canada. pp.559-578, ⟨10.1007/978-3-319-69453-5_30⟩. ⟨hal-01320496v2⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-01320496/file/mnt-p3-paper.pdf BibTex
ref_biblio
Julien Lavauzelle, Françoise Levy-Dit-Vehel. New proofs of retrievability using locally decodable codes. International Symposium on Information Theory ISIT 2016, Jul 2016, Barcelona, Spain. pp.1809 - 1813, ⟨10.1109/ISIT.2016.7541611⟩. ⟨hal-01413159⟩
Accès au texte intégral et bibtex
https://hal.science/hal-01413159/file/liftedPoR.pdf BibTex
ref_biblio
Joost Renes, Peter Schwabe, Benjamin Smith, Lejla Batina. $\mu$Kummer: efficient hyperelliptic signatures and key exchange on microcontrollers. Cryptographic Hardware and Embedded Systems – CHES 2016, IACR, Aug 2016, Santa Barbara, United States. pp.20, ⟨10.1007/978-3-662-53140-2_15⟩. ⟨hal-01300727⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-01300727/file/mukummer.pdf BibTex
ref_biblio
Marc Stevens, Pierre Karpman, Thomas Peyrin. Freestart Collision for Full SHA-1. EUROCRYPT 2016, IACR, May 2016, Vienne, Austria. ⟨10.1007/978-3-662-49890-3_18⟩. ⟨hal-01251023⟩
Accès au bibtex
BibTex

2015

ref_biblio
Daniel Augot, Françoise Levy-Dit-Vehel, Man Cuong Ngô. Information Sets of Multiplicity Codes. Information Theory (ISIT), 2015 IEEE International Symposium on , Jun 2015, Hong-Kong, China. pp.2401 - 2405, ⟨10.1109/ISIT.2015.7282886⟩. ⟨hal-01188935⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-01188935/file/ieee.pdf BibTex
ref_biblio
Razvan Barbulescu, Pierrick Gaudry, Aurore Guillevic, François Morain. Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields. EUROCRYPT 2015, Proceedings, Part {I}, Apr 2015, Sofia, Bulgaria. pp.129-155, ⟨10.1007/978-3-662-46800-5_6⟩. ⟨hal-01112879v2⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-01112879/file/BGGM-Eurocrypt15.pdf BibTex
ref_biblio
Alain Couvreur, Ayoub Otmani, Jean-Pierre Tillich, Valérie Gauthier-Umana. A Polynomial-Time Attack on the BBCRS Scheme. Practice and Theory in Public-Key Cryptography - PKC 2015, Mar 2015, Washington, United States. ⟨hal-01104078⟩
Accès au bibtex
https://arxiv.org/pdf/1501.03736 BibTex
ref_biblio
Aurore Guillevic. Computing Individual Discrete Logarithms Faster in GF$(p^n)$ with the NFS-DL Algorithm. Asiacrypt 2015, Steven Galbraith, Nov 2015, Auckland, New Zealand. pp 149-173, ⟨10.1007/978-3-662-48797-6_7⟩. ⟨hal-01157378v3⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-01157378/file/guillevic15-asiacrypt-iacr-version.pdf BibTex
ref_biblio
Pierre Karpman, Thomas Peyrin, Marc Stevens. Practical Free-Start Collision Attacks on 76-step SHA-1. 35th International Cryptology Conference - CRYPTO 2015, IACR, Aug 2015, Santa Barbara, United States. pp.623-642, ⟨10.1007/978-3-662-47989-6_30⟩. ⟨hal-01183066⟩
Accès au bibtex
BibTex
ref_biblio
Pierre Karpman. From Distinguishers to Key Recovery: Improved Related-Key Attacks on Even-Mansour. Information Security Conference 2015, Sep 2015, Trondheim, Norway. ⟨10.1007/978-3-319-23318-5_10⟩. ⟨hal-01245365⟩
Accès au bibtex
BibTex
ref_biblio
W Li, Johan Sebastian Rosenkilde Nielsen, S Puchinger, V Sidorenko. Solving Shift Register Problems over Skew Polynomial Rings using Module Minimisation. WCC2015 - 9th International Workshop on Coding and Cryptography 2015, Anne Canteaut, Gaëtan Leurent, Maria Naya-Plasencia, Apr 2015, Paris, France. ⟨hal-01245068⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-01245068/file/2015_wcc_skew_module.pdf BibTex
ref_biblio
Irene Márquez-Corbella, Alain Couvreur, Ruud Pellikaan. Structural Cryptanalysis of McEliece Schemes with Algebraic Geometry codes. Arithmétique, Géométrie, Cryptographie et Théorie des Codes, CIRM - Centre International de rencontres Mathématiques, May 2015, Luminy, France. ⟨hal-01243394⟩
Accès au bibtex
BibTex
ref_biblio
Brice Minaud, Patrick Derbez, Pierre Fouque, Pierre Karpman. Key-Recovery Attacks on ASASA. ASIACRYPT 2015, Nov 2015, Auckland, New Zealand. pp.3 - 27, ⟨10.1007/978-3-662-48800-3_1⟩. ⟨hal-01245381v2⟩
Accès au texte intégral et bibtex
https://hal.science/hal-01245381/file/ASASA.pdf BibTex
ref_biblio
Gwezheneg Robert. A new constellation for space-time coding. WCC 2015 - Proceedings of the 9th International Workshop on Coding and Cryptography, Anne Canteaut, Gaëtan Leurent, Maria Naya-Plasencia, Apr 2015, Paris, France. ⟨hal-01276475⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-01276475/file/wcc15-th3-2.pdf BibTex

2014

ref_biblio
Daniel Augot. Generalization of Gabidulin Codes over Fields of Rational Functions. 21st International Symposium on Mathematical Theory of Networks and Systems (MTNS 2014), Jul 2014, Groningen, Netherlands. ⟨hal-01094843⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-01094843/file/paper-revised.pdf BibTex
ref_biblio
Daniel Augot, Pierre-Alain Fouque, Pierre Karpman. Diffusion Matrices from Algebraic-Geometry Codes with Efficient SIMD Implementation. Selected Areas in Cryptology - SAC 2014, Aug 2014, Montreal, Canada. pp.243-260, ⟨10.1007/978-3-319-13051-4_15⟩. ⟨hal-01094085⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-01094085/file/AFK14.pdf BibTex
ref_biblio
Daniel Augot, Françoise Levy-Dit-Vehel, Abdullatif Shikfa. A Storage-Efficient and Robust Private Information Retrieval Scheme Allowing Few Servers. 13th International Conference, Cryptology and Network Security (CANS), Oct 2014, Heraklion, Greece. pp.222 - 239, ⟨10.1007/978-3-319-12280-9_15⟩. ⟨hal-01094807⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-01094807/file/cans-final.pdf BibTex
ref_biblio
Daniel Augot, Matthieu Finiasz. Direct Construction of Recursive MDS Diffusion Layers using Shortened BCH Codes. 21st International Workshop on Fast Software Encryption, FSE 2014, London, UK, March 3-5, Mar 2014, London, United Kingdom. pp.3-17, ⟨10.1007/978-3-662-46706-0_1⟩. ⟨hal-01044597v2⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-01044597/file/article.pdf BibTex
ref_biblio
Craig Costello, Huseyin Hisil, Benjamin Smith. Faster Compact Diffie-Hellman: Endomorphisms on the x-line. EUROCRYPT 2014, International Association for Cryptologic Research, May 2014, Copenhagen, Denmark. pp.183-200, ⟨10.1007/978-3-642-55220-5_11⟩. ⟨hal-00932952⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-00932952/file/main.pdf BibTex
ref_biblio
Alain Couvreur, Irene Márquez-Corbella, Ruud Pellikaan. Cryptanalysis of public-key cryptosystems that use subcodes of algebraic geometry codes. 4th ICMCTA - Fourth International Castle Meeting on Coding Theory and Applications, Sep 2014, Palmela, Portugal. ⟨hal-01069272⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-01069272/file/29-ICMCTA4-Final.pdf BibTex
ref_biblio
Alain Couvreur, Ayoub Otmani, Jean-Pierre Tillich. Polynomial Time Attack on Wild McEliece Over Quadratic Extensions. Advances in Cryptology - Eurocrypt 2014, May 2014, Copenhagen, Denmark. pp.17-39, ⟨10.1007/978-3-642-55220-5_2⟩. ⟨hal-00931774⟩
Accès au bibtex
https://arxiv.org/pdf/1402.3264 BibTex
ref_biblio
Alain Couvreur, Irene Márquez-Corbella, Ruud Pellikaan. A Polynomial Time Attack against Algebraic Geometry Code Based Public Key Cryptosystems. Information Theory (ISIT), 2014 IEEE International Symposium on, Jun 2014, Honolulu, United States. pp.1446-1450, ⟨10.1109/ISIT.2014.6875072⟩. ⟨hal-00937476⟩
Accès au bibtex
https://arxiv.org/pdf/1401.6025 BibTex
ref_biblio
Natalia Dück, Irene Márquez-Corbella, Edgar Martínez-Moro. On the fan associated to a linear code . 4th ICMCTA - Fourth International Castle Meeting on Coding Theory and Applications, Sep 2014, Palmela, Portugal. ⟨hal-01088432⟩
Accès au texte intégral et bibtex
https://hal.science/hal-01088432/file/4ICMCTA-26.pdf BibTex
ref_biblio
Irene Márquez-Corbella, Ruud Pellikaan. Error-correcting pairs: a new approach to code-based cryptography. 20th Conference on Applications of Computer Algebra (ACA 2014), Jul 2014, New York, United States. ⟨hal-01088433⟩
Accès au texte intégral et bibtex
https://hal.science/hal-01088433/file/MP-ACA2014.pdf BibTex

2013

ref_biblio
Daniel Augot, Pierre Loidreau, Gwezheneg Robert. Rank metric and Gabidulin codes in characteristic zero. ISIT 2013 IEEE International Symposium on Information Theory, Amos Lapidoth and Igal Sason and Jossy Sayir and Emre Telatar, Jul 2013, Istanbul, Turkey. ⟨hal-00823535⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-00823535/file/ISIT2013-RankMetricAndGabidulinCodes.pdf BibTex
ref_biblio
Daniel Augot, Matthieu Finiasz. Exhaustive Search for Small Dimension Recursive MDS Diffusion Layers for Block Ciphers and Hash Functions. International Symposium on Information Theory (ISIT), 2013, Istambul, Turkey. ⟨hal-00823082⟩
Accès au bibtex
https://arxiv.org/pdf/1305.3396 BibTex
ref_biblio
Stéphane Ballet, Jean Chaumine, Julia Pieltant. Shimura modular curves and asymptotic symmetric tensor rank of multiplication in any finite field. Conference on Algebraic Informatics, Sep 2013, Porquerolles Island, France. pp.160-172, ⟨10.1007/978-3-642-40663-8_16⟩. ⟨hal-00828070⟩
Accès au texte intégral et bibtex
https://hal.science/hal-00828070/file/ModularAsyMultBCP-SoumisModif4-llcns-CAI2013.pdf BibTex
ref_biblio
Alain Couvreur, Philippe Gaborit, Valérie Gautier, Ayoub Otmani, Jean-Pierre Tillich. Distinguisher-Based Attacks on Public-Key Cryptosystems Using Reed-Solomon Codes. International Workshop on Coding and Cryptography - WCC 2013, Apr 2013, Bergen, Norway. pp.181-193. ⟨hal-00830594⟩
Accès au texte intégral et bibtex
https://hal.science/hal-00830594/file/articleVF.pdf BibTex
ref_biblio
Nicolas Delfosse. Tradeoffs for reliable quantum information storage in surface codes and color codes. IEEE International Symposium on Information Theory, ISIT 2013, Jul 2013, Istanbul, Turkey. ⟨10.1109/ISIT.2013.6620360⟩. ⟨hal-00798030⟩
Accès au texte intégral et bibtex
https://hal.science/hal-00798030/file/Delfosse_tradeoffs.pdf BibTex
ref_biblio
Pierre-Alain Fouque, Pierre Karpman. Security Amplification against Meet-in-the-Middle Attacks Using Whitening. Cryptography and Coding - 14th {IMA} International Conference, Dec 2013, Oxford, United Kingdom. pp.18, ⟨10.1007/978-3-642-45239-0_15⟩. ⟨hal-01094298⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-01094298/file/FK13.pdf BibTex
ref_biblio
Johan Sebastian Rosenkilde Nielsen, Alexander Zeh. Multi-Trial Guruswami--Sudan Decoding for Generalised Reed--Solomon Codes. International Workshop on Coding and Cryptography (WCC), Apr 2013, Bergen, Norway. ⟨hal-00781310v2⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-00781310/file/hal-arxiv20130130.pdf BibTex
ref_biblio
Benjamin Smith. Families of fast elliptic curves from Q-curves. Advances in Cryptology - ASIACRYPT 2013, Dec 2013, Bangalore, India. pp.61-78, ⟨10.1007/978-3-642-42033-7_4⟩. ⟨hal-00825287⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-00825287/file/qc-hal.pdf BibTex
ref_biblio
Alexander Zeh, Antonia Wachter-Zeh, Maximilien Gadouleau, Sergey Bezzateev. Generalizing Bounds on the Minimum Distance of Cyclic Codes Using Cyclic Product Codes. IEEE International Symposium on Information Theory (ISIT), Jul 2013, Istanbul, Turkey. pp.1-6. ⟨hal-00828083⟩
Accès au bibtex
https://arxiv.org/pdf/1301.6231 BibTex

2012

ref_biblio
Guillaume Quintin. The decoding Library for List Decoding. International Symposium on Symbolic and Algebraic Computation, Jul 2012, Grenoble, France. pp.168-170, ⟨10.1145/2429135.2429174⟩. ⟨hal-00700397v2⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-00700397/file/abstract.pdf BibTex
ref_biblio
Guillaume Quintin. A Lifting Decoding Scheme and its Application to Interleaved Linear Codes. International Symposium on Information Theory, Jul 2012, Cambridge, United States. pp.96-100, ⟨10.1109/ISIT.2012.6284707⟩. ⟨hal-00673938v2⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-00673938/file/article.pdf BibTex
ref_biblio
Guillaume Quintin, Jean-François Biasse. An algorithm for list decoding number field codes. 2012 IEEE International Symposium on Information Theory (ISIT 2012), Jul 2012, Cambridge, United States. pp.91-95, ⟨10.1109/ISIT.2012.6284696⟩. ⟨hal-01113662⟩
Accès au bibtex
BibTex
ref_biblio
Alexander Zeh, Sergey Bezzateev. Describing A Cyclic Code by Another Cyclic Code. IEEE International Symposium on Information Theory (ISIT), Jul 2012, Boston, United States. pp.2896-2900, ⟨10.1109/ISIT.2012.6284054⟩. ⟨hal-00689746v4⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-00689746/file/ZehBezzateev_DescribingACyclicCodeByAnotherCyclicCode_halIsitfinal.pdf BibTex
ref_biblio
Alexander Zeh, Antonia Wachter-Zeh, Martin Bossert. Unambiguous Decoding of Generalized Reed–Solomon Codes Beyond Half the Minimum Distance. International Zurich Seminar on Communications, Feb 2012, Zurich, Switzerland. ⟨10.3929/ethz-a-007052646⟩. ⟨hal-01120389⟩
Accès au bibtex
BibTex

Book sections

2021

ref_biblio
Alain Couvreur, Hugues Randriambololona. Algebraic geometry codes and some applications. W. Cary Huffman, Jon-Lark Kim, Patrick Solé. A Concise Encyclopedia of Coding Theory, Chapman and Hall/CRC, pp.998, 2021, A Concise Encyclopedia of Coding Theory, 9781138551992. ⟨hal-02931167⟩
Accès au bibtex
https://arxiv.org/pdf/2009.01281 BibTex

2016

ref_biblio
Aurore Guillevic, François Morain. Discrete Logarithms. Nadia El Mrabet; Marc Joye. Guide to pairing-based cryptography, CRC Press - Taylor and Francis Group, pp.42, 2016, 9781498729505. ⟨hal-01420485v2⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-01420485/file/16_GuillevicMorain_Chapter9_DiscreteLogarithms_v2.pdf BibTex

Habilitation à diriger des recherches

2023

ref_biblio
Benjamin Smith. Advances in asymmetric cryptographic algorithms. Cryptography and Security [cs.CR]. Institut polytechnique de Paris, 2023. ⟨tel-04238166⟩
Accès au texte intégral et bibtex
https://inria.hal.science/tel-04238166/file/quick.pdf BibTex

2019

ref_biblio
Alain Couvreur. Codes algébriques et géométriques, applications à la cryptographie et à l'information quantique. Mathématiques [math]. Université Paris Diderot, 2019. ⟨tel-02438668⟩
Accès au texte intégral et bibtex
https://hal.science/tel-02438668/file/hdr.pdf BibTex

Lectures

2023

ref_biblio
Thomas Debris-Alazard. Code-based Cryptography: Lecture Notes. Doctoral. France. 2023. ⟨hal-04311471⟩
Accès au texte intégral et bibtex
https://hal.science/hal-04311471/file/main.pdf BibTex

2022

ref_biblio
Alain Couvreur. Codes and modular curves. Doctoral. Codes and Modular curves, Zurich, Switzerland. 2022, pp.33. ⟨hal-03932020⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-03932020/file/2301.03569.pdf BibTex

Other publications

2023

ref_biblio
Gustavo Banegas, Kevin Carrier, André Chailloux, Alain Couvreur, Thomas Debris-Alazard, et al.. WAVE. 2023. ⟨hal-04278563⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-04278563/file/main.pdf BibTex

2017

ref_biblio
Magali Bardet, Elise Barelli, Olivier Blazy, Rodolfo Canto Torres, Alain Couvreur, et al.. BIG QUAKE BInary Goppa QUAsi–cyclic Key Encapsulation. 2017. ⟨hal-01671866v2⟩
Accès au texte intégral et bibtex
https://hal.science/hal-01671866/file/proposal.pdf BibTex

Books

2019

ref_biblio
Daniel Augot, Faina Solov'Eva, Marine Minier, Victor A. Zinoviev, Thomas Johansson (Dir.). Editorial: Special issue on coding and cryptography. Springer, 87 (2-3), 2019, 0925-1022. ⟨10.1007/s10623-018-00601-w⟩. ⟨hal-02373772⟩
Accès au bibtex
BibTex

2017

ref_biblio
Alp Bassa, Alain Couvreur, David Kohel. Arithmetic, Geometry, Cryptography and Coding Theory. American Mathematical Society. 686, 2017, Contemporary Mathematics, ⟨10.1090/conm/686⟩. ⟨hal-01951630⟩
Accès au bibtex
BibTex

2013

ref_biblio
Daniel Augot, Anne Canteaut, Gohar Kyureghyan, Faina Solov'Eva, Øyvind Ytrehus (Dir.). Designs, Codes and Cryptography (Special Issue in Coding and Cryptography). Daniel Augot and Anne Canteaut and Gohar Kyureghyan and Faina Solov'Eva and Øyvind Ytrehus. Springer, 66, pp.399, 2013, 0925-1022. ⟨hal-00931522⟩
Accès au bibtex
BibTex

2012

ref_biblio
Daniel Augot, Anne Canteaut, Gohar Kyureghyan, Faina Solov'Eva, Øyvind Ytrehus (Dir.). Editorial. Daniel Augot and Anne Canteaut and Gohar Kyureghyan and Faina Solov'eva and Øyvind Ytrehus. Springer, pp.2, 2012, Designs, Codes and Cryptography, ⟨10.1007/s10623-012-9731-1⟩. ⟨hal-00741923⟩
Accès au bibtex
BibTex

Patents

2014

ref_biblio
Daniel Augot, Françoise Levy-Dit-Vehel, Abdullatif Shikfa. Storage efficient and unconditionnally secure private information retrieval. France, Patent n° : 14305549.9. 2014. ⟨hal-01111694⟩
Accès au bibtex
BibTex

Proceedings

2024

ref_biblio
Benjamin Smith, Huapeng Wu. Selected Areas in Cryptography. SAC 2022 - International Conference on Selected Areas in Cryptography, Lecture Notes in Computer Science, LNCS-13742, Springer International Publishing, 2024, Selected Areas in Cryptography, 978-3-031-58410-7. ⟨10.1007/978-3-031-58411-4⟩. ⟨hal-04579052⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-04579052/file/LNCS13742_BFM.pdf BibTex

Notes de synthèse

2022

ref_biblio
Daniel Augot, Sarah Bordage, Youssef El Housni, Gilles Fedak, Anthony Simonet. Zero-Knowledge : trust and privacy on an industrial scale. 2022. ⟨hal-03512005⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-03512005/file/outlook-01-en.pdf BibTex

Theses

2023

ref_biblio
Maxime Bombar. Codes Structurés pour la Cryptographie : des Fondations Théoriques de Sécurité aux Applications. Cryptography and Security [cs.CR]. Institut Polytechnique de Paris, 2023. English. ⟨NNT : 2023IPPAX109⟩. ⟨tel-04386153v2⟩
Accès au texte intégral et bibtex
https://inria.hal.science/tel-04386153/file/123820_BOMBAR_2023_archivage.pdf BibTex
ref_biblio
Angelo Saadeh. Applications of secure multi-party computation in Machine Learning. Other [cs.OH]. Institut Polytechnique de Paris, 2023. English. ⟨NNT : 2023IPPAT022⟩. ⟨tel-04299101v2⟩
Accès au texte intégral et bibtex
https://inria.hal.science/tel-04299101/file/116808_SAADEH_2023_archivage.pdf BibTex

2022

ref_biblio
Sarah Bordage. Efficient protocols for testing proximity to algebraic codes. Information Theory [cs.IT]. Institut Polytechnique de Paris, 2022. English. ⟨NNT : 2022IPPAX042⟩. ⟨tel-03744182⟩
Accès au texte intégral et bibtex
https://theses.hal.science/tel-03744182/file/108037_BORDAGE_2022_archivage.pdf BibTex
ref_biblio
Alexis Challande. Towards 1-day Vulnerability Detection using Semantic Patch Signatures. Cryptography and Security [cs.CR]. Institut Polytechnique de Paris, 2022. English. ⟨NNT : 2022IPPAX096⟩. ⟨tel-03950382⟩
Accès au texte intégral et bibtex
https://hal.science/tel-03950382/file/116787_CHALLANDE_2022_archivage.pdf BibTex
ref_biblio
Youssef El Housni. The arithmetic of pairing-based proof systems. Other [cs.OH]. Institut Polytechnique de Paris, 2022. English. ⟨NNT : 2022IPPAX104⟩. ⟨tel-03922488v2⟩
Accès au texte intégral et bibtex
https://hal.science/tel-03922488/file/119779_EL_HOUSNI_2022_archivage.pdf BibTex
ref_biblio
Antonin Leroux. Algèbres de Quaternions et cryptographie à base d'isogénies. Autre [cs.OH]. Institut Polytechnique de Paris, 2022. Français. ⟨NNT : 2022IPPAX094⟩. ⟨tel-03886810v2⟩
Accès au texte intégral et bibtex
https://inria.hal.science/tel-03886810/file/117018_LEROUX_2022_archivage.pdf BibTex
ref_biblio
Simon Montoya. Embedded lattice-based cryptography. Other [cs.OH]. Institut Polytechnique de Paris, 2022. English. ⟨NNT : 2022IPPAX089⟩. ⟨tel-03950386⟩
Accès au texte intégral et bibtex
https://hal.science/tel-03950386/file/118670_MONTOYA_2022_archivage.pdf BibTex
ref_biblio
Maxime Roméas. Modeling and construction of interactive cryptographic protocols for outsourced storage. Cryptography and Security [cs.CR]. Institut Polytechnique de Paris, 2022. English. ⟨NNT : 2022IPPAX086⟩. ⟨tel-03887128v2⟩
Accès au texte intégral et bibtex
https://hal.science/tel-03887128/file/117718_ROMEAS_2022_archivage.pdf BibTex

2021

ref_biblio
Mathilde Chenu. Supersingular Group Actions and Post-quantum Key Exchange. Cryptography and Security [cs.CR]. Ecole Polytechnique, 2021. English. ⟨NNT : ⟩. ⟨tel-03508143⟩
Accès au texte intégral et bibtex
https://inria.hal.science/tel-03508143/file/Manuscript_Mathilde_Chenu.pdf BibTex
ref_biblio
Isabella Panaccione. On decoding algorithms for algebraic geometry codes beyond half the minimum distance. Information Theory [cs.IT]. Institut Polytechnique de Paris, 2021. English. ⟨NNT : 2021IPPAX101⟩. ⟨tel-03512261v2⟩
Accès au texte intégral et bibtex
https://inria.hal.science/tel-03512261/file/107290_PANACCIONE_2021_archivage.pdf BibTex

2018

ref_biblio
Elise Barelli. Étude de la sécurité de certaines clés compactes pour le schéma de McEliece utilisant des codes géométriques. Cryptography and Security [cs.CR]. Université Paris Saclay (COmUE), 2018. English. ⟨NNT : 2018SACLX095⟩. ⟨tel-01982502⟩
Accès au texte intégral et bibtex
https://pastel.hal.science/tel-01982502/file/73311_BARELLI_2018_archivage.pdf BibTex
ref_biblio
Elise Barelli. On the security of short McEliece keys from algebraic and algebraic geometry codes with automorphisms. Mathematics [math]. École Polytechnique X; Université Paris Saclay, 2018. English. ⟨NNT : ⟩. ⟨tel-01993634⟩
Accès au texte intégral et bibtex
https://hal.science/tel-01993634/file/these.pdf BibTex
ref_biblio
Julien Lavauzelle. Codes with locality : constructions and applications to cryptographic protocols. Information Theory [cs.IT]. Université Paris Saclay (COmUE), 2018. English. ⟨NNT : 2018SACLX082⟩. ⟨tel-01951078⟩
Accès au texte intégral et bibtex
https://pastel.hal.science/tel-01951078/file/72496_LAVAUZELLE_2018_archivage.pdf BibTex

2015

ref_biblio
Gwezheneg Robert. Codes de Gabidulin en caractéristique nulle : application au codage espace-temps. Mathématiques générales [math.GM]. Université de Rennes, 2015. Français. ⟨NNT : 2015REN1S083⟩. ⟨tel-01308661v3⟩
Accès au texte intégral et bibtex
https://inria.hal.science/tel-01308661/file/these.pdf BibTex

2013

ref_biblio
Alexander Zeh. Algebraic Soft- and Hard-Decision Decoding of Generalized Reed--Solomon and Cyclic Codes. Computational Complexity [cs.CC]. Ecole Polytechnique X, 2013. English. ⟨NNT : ⟩. ⟨pastel-00866134⟩
Accès au texte intégral et bibtex
https://pastel.hal.science/pastel-00866134/file/Dissertation_AlexanderZeh_Online.pdf BibTex

2012

ref_biblio
Guillaume Quintin. On the Algorithms of Guruswami-Sudan List Decoding over Finite Rings. Information Theory [cs.IT]. Ecole Polytechnique X, 2012. English. ⟨NNT : ⟩. ⟨pastel-00759820⟩
Accès au texte intégral et bibtex
https://pastel.hal.science/pastel-00759820/file/thesis.pdf BibTex

Preprints, Working Papers, ...

2024

ref_biblio
Hugo Delavenne, François Le Gall. Quantum State Synthesis: Relation with Decision Complexity Classes and Impossibility of Synthesis Error Reduction. 2024. ⟨hal-04634958⟩
Accès au texte intégral et bibtex
https://hal.science/hal-04634958/file/main_bonneval.pdf BibTex
ref_biblio
Antonin Leroux, Maxime Roméas. Updatable Encryption from Group Actions. 2024. ⟨hal-04389878⟩
Accès au texte intégral et bibtex
https://hal.science/hal-04389878/file/2022-739.pdf BibTex
ref_biblio
François Morain. Using modular polynomials for eta products to compute isogenies. 2024. ⟨hal-04423470⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-04423470/file/etaproducts.pdf BibTex
ref_biblio
François Morain. Using Fricke modular polynomials to compute isogenies. 2024. ⟨hal-04455182⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-04455182/file/frickepol-hal.pdf BibTex
ref_biblio
Maria Corte-Real Santos, Craig Costello, Benjamin Smith. Efficient $(3,3)$-isogenies on fast Kummer surfaces. 2024. ⟨hal-04433463v2⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-04433463/file/genus2-hal.pdf BibTex

2023

ref_biblio
Gustavo Banegas, Valerie Gilchrist, Anaëlle Le Dévéhat, Benjamin Smith. Fast and Frobenius: Rational Isogeny Evaluation over Finite Fields. 2023. ⟨hal-04143067⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-04143067/file/main.pdf BibTex
ref_biblio
Gustavo Banegas, Juliane Krämer, Tanja Lange, Michael Meyer, Lorenz Panny, et al.. Disorientation faults in CSIDH. 2023. ⟨hal-03970597v2⟩
Accès au texte intégral et bibtex
https://hal.science/hal-03970597/file/egnoisy.pdf BibTex
ref_biblio
Kévin Carrier, Thomas Debris-Alazard, Charles Meyer-Hilfiger, Jean-Pierre Tillich. Reduction from Sparse LPN to LPN, Dual Attack 3.0. 2023. ⟨hal-04328262⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-04328262/file/2023-1852.pdf BibTex
ref_biblio
Pierrick Dartois, Antonin Leroux, Damien Robert, Benjamin Wesolowski. SQISignHD: New Dimensions in Cryptography. 2023. ⟨hal-04056062v2⟩
Accès au texte intégral et bibtex
https://hal.science/hal-04056062/file/2023-436.pdf BibTex
ref_biblio
Thomas Debris-Alazard, Nicolas Resch. Worst and average case hardness of decoding via smoothing bounds. 2023. ⟨hal-04326764⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-04326764/file/2022-1744.pdf BibTex
ref_biblio
François Morain. Computing the Charlap-Coley-Robbins modular polynomials. 2023. ⟨hal-03980413⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-03980413/file/issac-hal.pdf BibTex
ref_biblio
François Morain. Using the Charlap-Coley-Robbins polynomials for computing isogenies. 2023. ⟨hal-04009243⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-04009243/file/building.pdf BibTex
ref_biblio
Angelo Saadeh, Pierre Senellart, Stéphane Bressan. Confidential Truth Finding with Multi-Party Computation (Extended Version). 2023. ⟨hal-04139243⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-04139243/file/2305.14727.pdf BibTex
ref_biblio
Bruno Sterner. Towards Optimally Small Smoothness Bounds for Cryptographic-Sized Twin Smooth Integers and its Isogeny-based Applications. 2023. ⟨hal-04254512⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-04254512/file/main.pdf BibTex

2022

ref_biblio
Razvan Barbulescu, Pierrick Gaudry, Aurore Guillevic, François Morain. Improvements to the number field sieve for non-prime finite fields. 2022. ⟨hal-01052449v5⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-01052449/file/gfpndl.pdf BibTex
ref_biblio
Jeremy Booher, Ross Bowden, Javad Doliskani, Tako Boris Fouotsa, Steven Galbraith, et al.. Failing to hash into supersingular isogeny graphs. 2022. ⟨hal-03739041⟩
Accès au bibtex
BibTex
ref_biblio
Françoise Levy-Dit-Vehel, Maxime Roméas. A Composable Look at Updatable Encryption. 2022. ⟨hal-03531837⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-03531837/file/2021-538.pdf BibTex
ref_biblio
François Morain. Some factors of numbers of the form $b^n +/- 1$ found using ECM with new classes of curves. 2022. ⟨hal-03437714v2⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-03437714/file/factors.pdf BibTex

2021

ref_biblio
Gustavo Banegas, Koen Zandberg, Adrian Herrmann, Emmanuel Baccelli, Benjamin Smith. Quantum-Resistant Security for Software Updates on Low-power Networked Embedded Devices. 2021. ⟨hal-03255844v2⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-03255844/file/paper.pdf BibTex
ref_biblio
Gustavo Banegas, Thomas Debris-Alazard, Milena Nedeljković, Benjamin Smith. Wavelet: Code-based postquantum signatures with fast verification on microcontrollers. 2021. ⟨hal-03403225⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-03403225/file/main.pdf BibTex
ref_biblio
Alain Couvreur. How arithmetic and geometry make error correcting codes better. 2021. ⟨hal-03400779⟩
Accès au bibtex
https://arxiv.org/pdf/2110.11282 BibTex
ref_biblio
Isabella Panaccione. Attaining Sudan's decoding radius with no genus penalty for algebraic geometry codes. 2021. ⟨hal-03177569v2⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-03177569/file/ms.pdf BibTex

2020

ref_biblio
Alain Couvreur, Thomas Debris-Alazard, Philippe Gaborit. On the hardness of code equivalence problems in rank metric. 2020. ⟨hal-02997801⟩
Accès au bibtex
https://arxiv.org/pdf/2011.04611 BibTex
ref_biblio
Julien Lavauzelle, Pierre Loidreau, Ba-Duc Pham. RAMESSES, a Rank Metric Encryption Scheme with Short Keys. 2020. ⟨hal-02426624⟩
Accès au texte intégral et bibtex
https://hal.science/hal-02426624/file/1911.13119.pdf BibTex

2017

ref_biblio
Nicholas Coxon. Fast systematic encoding of multiplicity codes. 2017. ⟨hal-01512372⟩
Accès au texte intégral et bibtex
https://hal.science/hal-01512372/file/sysenc.pdf BibTex
ref_biblio
Laurent Grémy, Aurore Guillevic, François Morain. Breaking DLP in $GF(p^5)$ using 3-dimensional sieving. 2017. ⟨hal-01568373⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-01568373/file/p5dd20hd.pdf BibTex

2016

ref_biblio
Frédéric Grosshans, Thomas Lawson, Benjamin Smith, François Morain. Factoring Safe Semiprimes with a Single Quantum Query. 2016. ⟨hal-01229587⟩
Accès au bibtex
https://arxiv.org/pdf/1511.04385 BibTex
ref_biblio
Pierre Karpman. Exercice de style. 2016. ⟨hal-01263735⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-01263735/file/littlun.pdf BibTex

2015

ref_biblio
Ping Ngai Chung, Craig Costello, Benjamin Smith. Fast, uniform, and compact scalar multiplication for elliptic curves and genus 2 Jacobians with applications to signature schemes. 2015. ⟨hal-01214259v2⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-01214259/file/recovery.pdf BibTex

2012

ref_biblio
Daniel Augot, François Morain. Discrete logarithm computations over finite fields using Reed-Solomon codes. 2012. ⟨hal-00672050⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-00672050/file/chwa.pdf BibTex
ref_biblio
Jean-François Biasse, Guillaume Quintin. An algorithm for list decoding number field codes. 2012. ⟨hal-00712441⟩
Accès au texte intégral et bibtex
https://inria.hal.science/hal-00712441/file/bare_conf.pdf BibTex

2011

ref_biblio
Stéphane Ballet, Jean Chaumine, Julia Pieltant, Robert Rolland. On the tensor rank of multiplication in finite extensions of finite fields. 2011. ⟨hal-01079416⟩
Accès au bibtex
https://arxiv.org/pdf/1107.1184 BibTex

Videos

2014

ref_biblio
Alain Couvreur, Fanny Bastien. Alain Couvreur - Comment domestiquer les codes de Goppa sauvages? . 2014. ⟨medihal-01346167⟩
Accès au texte intégral et bibtex
https://hal.science/medihal-01346167/file/couvreur.mp4 BibTex
ref_biblio
Gwezheneg Robert, Daniel Augot, Pierre Loidreau, Fanny Bastien. Gwezheneg Robert - Généralisation des codes de Gabidulin à la caractéristique nulle . 2014. ⟨medihal-01346163⟩
Accès au texte intégral et bibtex
https://hal.science/medihal-01346163/file/robert.mp4 BibTex