Jean-François Biasse

55 papers A* 1B 4C 2Misc 5Journal 38Unranked 5
YearRankTypeTitle / Venue / Authors
2026 J jnl
Asymptotic Improvements to Provable Algorithms for the Code Equivalence Problem.
IEEE Trans. Inf. Theory
Huck Bennett, Drisana Bhatia, Jean-François Biasse, Medha Durisheti, Lucas LaBuff, Vincenzo Pallozzi Lavorante, Phillip Waitkevich
2025 J jnl
An efficient quantum algorithm for computing S-units and its applications.
CoRR
Jean-François Biasse, Fang Song
2025 J jnl
An efficient quantum algorithm for computing S-units and its applications.
IACR Cryptol. ePrint Arch.
Jean-François Biasse, Fang Song
2025 B conf
Asymptotic Improvements to Provable Algorithms for the Code Equivalence Problem.
ISIT
Huck Bennett, Drisana Bhatia, Jean-François Biasse, Medha Durisheti, Lucas LaBuff, Vincenzo Pallozzi Lavorante, Phillip Waitkevich
2025 J jnl
Asymptotic improvements to provable algorithms for the code equivalence problem.
IACR Cryptol. ePrint Arch.
Huck Bennett, Drisana Bhatia, Jean-François Biasse, Medha Durisheti, Lucas LaBuff, Vincenzo Pallozzi Lavorante, Phillip Waitkevich
2025 — conf
Faster SCALLOP from Non-prime Conductor Suborders in Medium Sized Quadratic Fields.
PKC (3)
Bill Allombert, Jean-François Biasse, Jonathan Komada Eriksen, Péter Kutas, Chris Leonardi, Aurel Page, Renate Scheidler, Márton Tot Bagi
2024 J jnl
An algorithm for solving the principal ideal problem with subfields.
Adv. Math. Commun.
Jean-François Biasse, Claus Fieker, Tommy Hofmann, William Youmans
2024 J jnl
PEARL-SCALLOP: Parameter Extension Applicable in Real-Life SCALLOP.
IACR Cryptol. ePrint Arch.
Bill Allombert, Jean-François Biasse, Jonathan Komada Eriksen, Péter Kutas, Chris Leonardi, Aurel Page, Renate Scheidler, Márton Tot Bagi
2023 B conf
A Search-to-Decision Reduction for the Permutation Code Equivalence Problem.
ISIT
Jean-François Biasse, Giacomo Micheli
2023 J jnl
A proof of the conjectured run time of the Hafner-McCurley class group algorithm.
Adv. Math. Commun.
Jean-François Biasse, Muhammed Rashad Erukulangara
2023 J jnl
On the computational hardness of the code equivalence problem in cryptography.
Adv. Math. Commun.
Alessandro Barenghi, Jean-François Biasse, Edoardo Persichetti, Paolo Santini
2023 J jnl
Quantum algorithms for attacking hardness assumptions in classical and post-quantum cryptography.
IET Inf. Secur.
Jean-François Biasse, Xavier Bonnetain, Elena Kirshanova, André Schrottenloher, Fang Song
2022 J jnl
Advanced Signature Functionalities from the Code Equivalence Problem.
IACR Cryptol. ePrint Arch.
Alessandro Barenghi, Jean-François Biasse, Tran Ngo, Edoardo Persichetti, Paolo Santini
2022 J jnl
Advanced signature functionalities from the code equivalence problem.
Int. J. Comput. Math. Comput. Syst. Theory
Alessandro Barenghi, Jean-François Biasse, Tran Ngo, Edoardo Persichetti, Paolo Santini
2022 J jnl
On the Computational Hardness of the Code Equivalence Problem in Cryptography.
IACR Cryptol. ePrint Arch.
Alessandro Barenghi, Jean-François Biasse, Edoardo Persichetti, Paolo Santini
2021 J jnl
A framework for reducing the overhead of the quantum oracle for use with Grover's algorithm with applications to cryptanalysis of SIKE.
J. Math. Cryptol.
Jean-François Biasse, Benjamin Pring
2021 J jnl
A trade-off between classical and quantum circuit size for an attack against CSIDH.
J. Math. Cryptol.
Jean-François Biasse, Xavier Bonnetain, Benjamin Pring, André Schrottenloher, William Youmans
2021 C conf
LESS-FM: Fine-Tuning Signatures from the Code Equivalence Problem.
PQCrypto
Alessandro Barenghi, Jean-François Biasse, Edoardo Persichetti, Paolo Santini
2021 J jnl
LESS-FM: Fine-tuning Signatures from a Code-based Cryptographic Group Action.
IACR Cryptol. ePrint Arch.
Alessandro Barenghi, Jean-François Biasse, Edoardo Persichetti, Paolo Santini
2021 J jnl
Parallelism strategies for the tuneable golden-claw finding problem.
Int. J. Comput. Math. Comput. Syst. Theory
Reza Azarderakhsh, Jean-François Biasse, Rami El Khatib, Brandon Langenberg, Benjamin Pring
2020 — conf
LESS is More: Code-Based Signatures Without Syndromes.
AFRICACRYPT
Jean-François Biasse, Giacomo Micheli, Edoardo Persichetti, Paolo Santini
2020 J jnl
LESS is More: Code-Based Signatures without Syndromes.
IACR Cryptol. ePrint Arch.
Jean-François Biasse, Giacomo Micheli, Edoardo Persichetti, Paolo Santini
2020 J jnl
Trace-Σ: a privacy-preserving contact tracing app.
IACR Cryptol. ePrint Arch.
Jean-François Biasse, Sriram Chellappan, Sherzod Kariev, Noyem Khan, Lynette Menezes, Efe Seyitoglu, Charurut Somboonwit, Attila A. Yavuz
2019 J jnl
On the quantum attacks against schemes relying on the hardness of finding a short generator of an ideal in.
J. Math. Cryptol.
Jean-François Biasse, Fang Song
2018 Misc conf
A Note on the Security of CSIDH.
INDOCRYPT
Jean-François Biasse, Annamaria Iezzi, Michael J. Jacobson Jr.
2018 J jnl
A note on the security of CSIDH.
CoRR
Jean-François Biasse, Annamaria Iezzi, Michael J. Jacobson Jr.
2017 C conf
A Low-Resource Quantum Factoring Algorithm.
PQCrypto
Daniel J. Bernstein, Jean-François Biasse, Michele Mosca
2017 J jnl
A low-resource quantum factoring algorithm.
IACR Cryptol. ePrint Arch.
Daniel J. Bernstein, Jean-François Biasse, Michele Mosca
2017 Misc conf
Approximate Short Vectors in Ideal Lattices of Q(ζ
SAC
Jean-François Biasse
2017 — conf
Computing Generator in Cyclotomic Integer Rings - A Subfield Algorithm for the Principal Ideal Problem in L
EUROCRYPT (1)
Jean-François Biasse, Thomas Espitau, Pierre-Alain Fouque, Alexandre Gélin, Paul Kirchner
2017 J jnl
Computing generator in cyclotomic integer rings, A subfield algorithm for the Principal Ideal Problem in L(1/2) and application to cryptanalysis of a FHE scheme.
IACR Cryptol. ePrint Arch.
Jean-François Biasse, Thomas Espitau, Pierre-Alain Fouque, Alexandre Gélin, Paul Kirchner
2017 J jnl
On the computation of the HNF of a module over the ring of integers of a number field.
J. Symb. Comput.
Jean-François Biasse, Claus Fieker, Tommy Hofmann
2016 A* conf
Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields.
SODA
Jean-François Biasse, Fang Song
2016 J jnl
Fast heuristic algorithms for computing relations in the class group of a quadratic order, with applications to isogeny evaluation.
LMS J. Comput. Math.
Jean-François Biasse, Claus Fieker, Michael J. Jacobson Jr.
2016 J jnl
On the computation of the HNF of a module over the ring of integers of a number field.
CoRR
Jean-François Biasse, Claus Fieker, Tommy Hofmann
2015 J jnl
A fast algorithm for finding a short generator of a principal ideal of ℚ(ζ
CoRR
Jean-François Biasse
2015 — conf
FHEW with Efficient Multibit Bootstrapping.
LATINCRYPT
Jean-François Biasse, Luis Ruiz
2014 Misc conf
A Quantum Algorithm for Computing Isogenies between Supersingular Elliptic Curves.
INDOCRYPT
Jean-François Biasse, David Jao, Anirudh Sankar
2014 J jnl
An L(1/3) algorithm for ideal class group and regulator computation in certain number fields.
Math. Comput.
Jean-François Biasse
2014 J jnl
Smoothness testing of polynomials over finite fields.
Adv. Math. Commun.
Jean-François Biasse, Michael J. Jacobson Jr.
2014 J jnl
Subexponential class group and unit group computation in large degree number fields.
LMS J. Comput. Math.
Jean-François Biasse, Claus Fieker
2014 J jnl
Subexponential time relations in the class group of large degree number fields.
Adv. Math. Commun.
Jean-François Biasse
2012 J jnl
A polynomial time algorithm for computing the HNF of a module over the integers of a number field
CoRR
Jean-François Biasse, Claus Fieker
2012 B conf
A polynomial time algorithm for computing the HNF of a module over the integers of a number field.
ISSAC
Jean-François Biasse, Claus Fieker
2012 J jnl
An L(1/3) algorithm for discrete logarithm computation and principality testing in certain number fields
CoRR
Jean-François Biasse
2012 B conf
An algorithm for list decoding number field codes.
ISIT
Jean-François Biasse, Guillaume Quintin
2012 J jnl
Improvements in the computation of ideal class groups of imaginary quadratic number fields
CoRR
Jean-François Biasse
2012 J jnl
New techniques for computing the ideal class group and a system of fundamental units in number fields
CoRR
Jean-François Biasse, Claus Fieker
2011 J jnl
An algorithm for list decoding number field codes
CoRR
Jean-François Biasse, Guillaume Quintin
2010 J jnl
Improvements in the computation of ideal class groups of imaginary quadratic number fields.
Adv. Math. Commun.
Jean-François Biasse
2010 — conf
Practical Improvements to Class Group and Regulator Computation of Real Quadratic Fields.
ANTS
Jean-François Biasse, Michael J. Jacobson Jr.
2010 Misc conf
Security Estimates for Quadratic Field Based Cryptosystems.
ACISP
Jean-François Biasse, Michael J. Jacobson Jr., Alan K. Silvester
2010 J jnl
Security Estimates for Quadratic Field Based Cryptosystems.
CoRR
Jean-François Biasse, Michael J. Jacobson Jr., Alan K. Silvester
2009 J jnl
An L(1/3) algorithm for ideal class group and regulator computation in certain number fields
CoRR
Jean-François Biasse
2006 Misc conf
Non-randomness in eSTREAM Candidates Salsa20 and TSC-4.
INDOCRYPT
Simon Fischer, Willi Meier, Côme Berbain, Jean-François Biasse, Matthew J. B. Robshaw