Jean-François Biasse

Publication Activity (10 Years)

Years Active: 2006-2023
Publications (10 Years): 28

Top Topics

Signature Verification

Computational Effort

Lagrange Interpolation

Top Venues

IACR Cryptol. ePrint Arch.

Adv. Math. Commun.

J. Math. Cryptol.

Publications

Jean-François Biasse, Giacomo Micheli
A Search-to-Decision Reduction for the Permutation Code Equivalence Problem. ISIT (2023)
Jean-François Biasse, Muhammed Rashad Erukulangara
A proof of the conjectured run time of the Hafner-McCurley class group algorithm. Adv. Math. Commun. 17 (6) (2023)
Jean-François Biasse, Xavier Bonnetain, Elena Kirshanova, André Schrottenloher, Fang Song
Quantum algorithms for attacking hardness assumptions in classical and post-quantum cryptography. IET Inf. Secur. 17 (2) (2023)
Alessandro Barenghi, Jean-François Biasse, Edoardo Persichetti, Paolo Santini
On the computational hardness of the code equivalence problem in cryptography. Adv. Math. Commun. 17 (1) (2023)
Alessandro Barenghi, Jean-François Biasse, Tran Ngo, Edoardo Persichetti, Paolo Santini
Advanced signature functionalities from the code equivalence problem. Int. J. Comput. Math. Comput. Syst. Theory 7 (2) (2022)
Alessandro Barenghi, Jean-François Biasse, Edoardo Persichetti, Paolo Santini
On the Computational Hardness of the Code Equivalence Problem in Cryptography. IACR Cryptol. ePrint Arch. 2022 (2022)
Alessandro Barenghi, Jean-François Biasse, Tran Ngo, Edoardo Persichetti, Paolo Santini
Advanced Signature Functionalities from the Code Equivalence Problem. IACR Cryptol. ePrint Arch. 2022 (2022)
Jean-François Biasse, Xavier Bonnetain, Benjamin Pring, André Schrottenloher, William Youmans
A trade-off between classical and quantum circuit size for an attack against CSIDH. J. Math. Cryptol. 15 (1) (2021)
Reza Azarderakhsh, Jean-François Biasse, Rami El Khatib, Brandon Langenberg, Benjamin Pring
Parallelism strategies for the tuneable golden-claw finding problem. Int. J. Comput. Math. Comput. Syst. Theory 6 (4) (2021)
Jean-François Biasse, Benjamin Pring
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. 15 (1) (2021)
Alessandro Barenghi, Jean-François Biasse, Edoardo Persichetti, Paolo Santini
LESS-FM: Fine-tuning Signatures from a Code-based Cryptographic Group Action. IACR Cryptol. ePrint Arch. 2021 (2021)
Alessandro Barenghi, Jean-François Biasse, Edoardo Persichetti, Paolo Santini
LESS-FM: Fine-Tuning Signatures from the Code Equivalence Problem. PQCrypto (2021)
Jean-François Biasse, Sriram Chellappan, Sherzod Kariev, Noyem Khan, Lynette Menezes, Efe Seyitoglu, Charurut Somboonwit, Attila A. Yavuz
Trace-Σ: a privacy-preserving contact tracing app. IACR Cryptol. ePrint Arch. 2020 (2020)
Jean-François Biasse, Giacomo Micheli, Edoardo Persichetti, Paolo Santini
LESS is More: Code-Based Signatures without Syndromes. IACR Cryptol. ePrint Arch. 2020 (2020)
Jean-François Biasse, Giacomo Micheli, Edoardo Persichetti, Paolo Santini
A Post-Quantum Non-Interactive Key-Exchange Protocol from Coding Theory. IACR Cryptol. ePrint Arch. 2020 (2020)
Jean-François Biasse, Giacomo Micheli, Edoardo Persichetti, Paolo Santini
LESS is More: Code-Based Signatures Without Syndromes. AFRICACRYPT (2020)
Jean-François Biasse, Fang Song
On the quantum attacks against schemes relying on the hardness of finding a short generator of an ideal in. J. Math. Cryptol. 13 (3-4) (2019)
Jean-François Biasse, Annamaria Iezzi, Michael J. Jacobson Jr.
A Note on the Security of CSIDH. INDOCRYPT (2018)
Jean-François Biasse, Annamaria Iezzi, Michael J. Jacobson Jr.
A note on the security of CSIDH. CoRR (2018)
Daniel J. Bernstein, Jean-François Biasse, Michele Mosca
A low-resource quantum factoring algorithm. IACR Cryptol. ePrint Arch. 2017 (2017)
Jean-François Biasse, Claus Fieker, Tommy Hofmann
On the computation of the HNF of a module over the ring of integers of a number field. J. Symb. Comput. 80 (2017)
Daniel J. Bernstein, Jean-François Biasse, Michele Mosca
A Low-Resource Quantum Factoring Algorithm. PQCrypto (2017)
Jean-François Biasse
). SAC (2017)
Jean-François Biasse, Thomas Espitau, Pierre-Alain Fouque, Alexandre Gélin, Paul Kirchner
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. 2017 (2017)
Jean-François Biasse, Thomas Espitau, Pierre-Alain Fouque, Alexandre Gélin, Paul Kirchner
(½) and Application to the Cryptanalysis of a FHE Scheme. EUROCRYPT (1) (2017)
Jean-François Biasse, Claus Fieker, Tommy Hofmann
On the computation of the HNF of a module over the ring of integers of a number field. CoRR (2016)
Jean-François Biasse, Claus Fieker, Michael J. Jacobson Jr.
Fast heuristic algorithms for computing relations in the class group of a quadratic order, with applications to isogeny evaluation. LMS J. Comput. Math. 19 (A) (2016)
Jean-François Biasse, Fang Song
Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields. SODA (2016)
Jean-François Biasse, Luis Ruiz
FHEW with Efficient Multibit Bootstrapping. LATINCRYPT (2015)
Jean-François Biasse
). CoRR (2015)
Jean-François Biasse, David Jao, Anirudh Sankar
A Quantum Algorithm for Computing Isogenies between Supersingular Elliptic Curves. INDOCRYPT (2014)
Jean-François Biasse, Michael J. Jacobson Jr.
Smoothness testing of polynomials over finite fields. Adv. Math. Commun. 8 (4) (2014)
Jean-François Biasse
Subexponential time relations in the class group of large degree number fields. Adv. Math. Commun. 8 (4) (2014)
Jean-François Biasse, Claus Fieker
Subexponential class group and unit group computation in large degree number fields. LMS J. Comput. Math. 17 (Theory) (2014)
Jean-François Biasse
An L(1/3) algorithm for ideal class group and regulator computation in certain number fields. Math. Comput. 83 (288) (2014)
Jean-François Biasse, Guillaume Quintin
An algorithm for list decoding number field codes. ISIT (2012)
Jean-François Biasse, Claus Fieker
A polynomial time algorithm for computing the HNF of a module over the integers of a number field CoRR (2012)
Jean-François Biasse
An L(1/3) algorithm for discrete logarithm computation and principality testing in certain number fields CoRR (2012)
Jean-François Biasse, Claus Fieker
A polynomial time algorithm for computing the HNF of a module over the integers of a number field. ISSAC (2012)
Jean-François Biasse, Claus Fieker
New techniques for computing the ideal class group and a system of fundamental units in number fields CoRR (2012)
Jean-François Biasse
Improvements in the computation of ideal class groups of imaginary quadratic number fields CoRR (2012)
Jean-François Biasse, Guillaume Quintin
An algorithm for list decoding number field codes CoRR (2011)
Jean-François Biasse, Michael J. Jacobson Jr., Alan K. Silvester
Security Estimates for Quadratic Field Based Cryptosystems. ACISP (2010)
Jean-François Biasse, Michael J. Jacobson Jr.
Practical Improvements to Class Group and Regulator Computation of Real Quadratic Fields. ANTS (2010)
Jean-François Biasse
Improvements in the computation of ideal class groups of imaginary quadratic number fields. Adv. Math. Commun. 4 (2) (2010)
Jean-François Biasse, Michael J. Jacobson Jr., Alan K. Silvester
Security Estimates for Quadratic Field Based Cryptosystems. CoRR (2010)
Jean-François Biasse
An L(1/3) algorithm for ideal class group and regulator computation in certain number fields CoRR (2009)
Simon Fischer, Willi Meier, Côme Berbain, Jean-François Biasse, Matthew J. B. Robshaw
Non-randomness in eSTREAM Candidates Salsa20 and TSC-4. INDOCRYPT (2006)