Non-randomness in eSTREAM Candidates Salsa20 and TSC-4. - Simon Fischer 002; Willi Meier; Côme Berbain; Jean-François Biasse; Matthew J. B. Robshaw (INDOCRYPT, 2006)

Security Estimates for Quadratic Field Based Cryptosystems. - Jean-François Biasse; Michael J. Jacobson Jr.; Alan K. Silvester (ACISP, 2010)

Practical Improvements to Class Group and Regulator Computation of Real Quadratic Fields. - Jean-François Biasse; Michael J. Jacobson Jr. (ANTS, 2010)

Improvements in the computation of ideal class groups of imaginary quadratic number fields. - Jean-François Biasse (Adv. Math. Commun., 2010)

An algorithm for list decoding number field codes. - Jean-François Biasse; Guillaume Quintin (ISIT, 2012)

A polynomial time algorithm for computing the HNF of a module over the integers of a number field. - Jean-François Biasse; Claus Fieker (ISSAC, 2012)

An L(1/3) algorithm for discrete logarithm computation and principality testing in certain number fields - Jean-François Biasse (CoRR, 2012)

New techniques for computing the ideal class group and a system of fundamental units in number fields - Jean-François Biasse; Claus Fieker (CoRR, 2012)

A Quantum Algorithm for Computing Isogenies between Supersingular Elliptic Curves. - Jean-François Biasse; David Jao; Anirudh Sankar (INDOCRYPT, 2014)

Subexponential time relations in the class group of large degree number fields. - Jean-François Biasse (Adv. Math. Commun., 2014)

Smoothness testing of polynomials over finite fields. - Jean-François Biasse; Michael J. Jacobson Jr. (Adv. Math. Commun., 2014)

Subexponential class group and unit group computation in large degree number fields. - Jean-François Biasse; Claus Fieker (LMS J. Comput. Math., 2014)

An L(1/3) algorithm for ideal class group and regulator computation in certain number fields. - Jean-François Biasse (Math. Comput., 2014)

FHEW with Efficient Multibit Bootstrapping. - Jean-François Biasse; Luis Ruiz (LATINCRYPT, 2015)

A fast algorithm for finding a short generator of a principal ideal of ℚ(ζ2n). - Jean-François Biasse (CoRR, 2015)

Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields. - Jean-François Biasse; Fang Song 001 (SODA, 2016)

Fast heuristic algorithms for computing relations in the class group of a quadratic order, with applications to isogeny evaluation. - Jean-François Biasse; Claus Fieker; Michael J. Jacobson Jr. (LMS J. Comput. Math., 2016)

Computing Generator in Cyclotomic Integer Rings - A Subfield Algorithm for the Principal Ideal Problem in L|Δ𝕂|(½) and Application to the Cryptanalysis of a FHE Scheme. - Jean-François Biasse; Thomas Espitau; Pierre-Alain Fouque; Alexandre Gélin; Paul Kirchner (EUROCRYPT (1), 2017)

Approximate Short Vectors in Ideal Lattices of Q(ζpe) with Precomputation of Cl(OK). - Jean-François Biasse (SAC, 2017)

A low-resource quantum factoring algorithm. - Daniel J. Bernstein; Jean-François Biasse; Michele Mosca (IACR Cryptol. ePrint Arch., 2017)

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. - Jean-François Biasse; Thomas Espitau; Pierre-Alain Fouque; Alexandre Gélin; Paul Kirchner (IACR Cryptol. ePrint Arch., 2017)

On the computation of the HNF of a module over the ring of integers of a number field. - Jean-François Biasse; Claus Fieker; Tommy Hofmann (J. Symb. Comput., 2017)

A Note on the Security of CSIDH. - Jean-François Biasse; Annamaria Iezzi; Michael J. Jacobson Jr. (INDOCRYPT, 2018)

On the quantum attacks against schemes relying on the hardness of finding a short generator of an ideal in. - Jean-François Biasse; Fang Song 001 (J. Math. Cryptol., 2019)

Trace-Σ: a privacy-preserving contact tracing app. - Jean-François Biasse; Sriram Chellappan; Sherzod Kariev; Noyem Khan; Lynette Menezes; Efe Seyitoglu; Charurut Somboonwit; Attila A. Yavuz (IACR Cryptol. ePrint Arch., 2020)

LESS is More: Code-Based Signatures without Syndromes. - Jean-François Biasse; Giacomo Micheli; Edoardo Persichetti; Paolo Santini (IACR Cryptol. ePrint Arch., 2020)

LESS-FM: Fine-Tuning Signatures from the Code Equivalence Problem. - Alessandro Barenghi; Jean-François Biasse; Edoardo Persichetti; Paolo Santini (PQCrypto, 2021)

LESS-FM: Fine-tuning Signatures from a Code-based Cryptographic Group Action. - Alessandro Barenghi; Jean-François Biasse; Edoardo Persichetti; Paolo Santini (IACR Cryptol. ePrint Arch., 2021)

Parallelism strategies for the tuneable golden-claw finding problem. - Reza Azarderakhsh; Jean-François Biasse; Rami El Khatib; Brandon Langenberg; Benjamin Pring (Int. J. Comput. Math. Comput. Syst. Theory, 2021)

A trade-off between classical and quantum circuit size for an attack against CSIDH. - Jean-François Biasse; Xavier Bonnetain; Benjamin Pring; André Schrottenloher; William Youmans (J. Math. Cryptol., 2021)

A framework for reducing the overhead of the quantum oracle for use with Grover's algorithm with applications to cryptanalysis of SIKE. - Jean-François Biasse; Benjamin Pring (J. Math. Cryptol., 2021)

Advanced signature functionalities from the code equivalence problem. - Alessandro Barenghi; Jean-François Biasse; Tran Ngo; Edoardo Persichetti; Paolo Santini (Int. J. Comput. Math. Comput. Syst. Theory, 2022)

A Search-to-Decision Reduction for the Permutation Code Equivalence Problem. - Jean-François Biasse; Giacomo Micheli (ISIT, 2023)

On the computational hardness of the code equivalence problem in cryptography. - Alessandro Barenghi; Jean-François Biasse; Edoardo Persichetti; Paolo Santini (Adv. Math. Commun., 2023)

A proof of the conjectured run time of the Hafner-McCurley class group algorithm. - Jean-François Biasse; Muhammed Rashad Erukulangara (Adv. Math. Commun., 2023)

Quantum algorithms for attacking hardness assumptions in classical and post-quantum cryptography. - Jean-François Biasse; Xavier Bonnetain; Elena Kirshanova; André Schrottenloher; Fang Song 001 (IET Inf. Secur., 2023)

An algorithm for solving the principal ideal problem with subfields. - Jean-François Biasse; Claus Fieker; Tommy Hofmann; William Youmans (Adv. Math. Commun., 2024)

PEARL-SCALLOP: Parameter Extension Applicable in Real-Life SCALLOP. - Bill Allombert; Jean-François Biasse; Jonathan Komada Eriksen; Péter Kutas; Chris Leonardi; Aurel Page; Renate Scheidler; Márton Tot Bagi (IACR Cryptol. ePrint Arch., 2024)

Faster SCALLOP from Non-prime Conductor Suborders in Medium Sized Quadratic Fields. - Bill Allombert; Jean-François Biasse; Jonathan Komada Eriksen; Péter Kutas; Chris Leonardi; Aurel Page; Renate Scheidler; Márton Tot Bagi (PKC (3), 2025)

Asymptotic improvements to provable algorithms for the code equivalence problem. - Huck Bennett; Drisana Bhatia; Jean-François Biasse; Medha Durisheti; Lucas LaBuff; Vincenzo Pallozzi Lavorante; Phillip Waitkevich (IACR Cryptol. ePrint Arch., 2025)