Jean-François Biasse

Available identifiers

zbMath Open biasse.jean-francoisMaRDI QIDQ540358

List of research outcomes

Publication	Date of Publication	Type
An algorithm for solving the principal ideal problem with subfields	2024-09-16	Paper
A proof of the conjectured run time of the Hafner-McCurley class group algorithm	2023-09-12	Paper
Norm relations and computational problems in number fields	2023-08-21	Paper
Fast multiquadratic S-unit computation and application to the calculation of class groups	2023-08-02	Paper
On the computational hardness of the code equivalence problem in cryptography	2023-07-07	Paper
LESS is More: Code-Based Signatures Without Syndromes	2022-11-09	Paper
LESS-FM: fine-tuning signatures from the code equivalence problem	2022-03-22	Paper
A framework for reducing the overhead of the quantum oracle for use with Grover's algorithm with applications to cryptanalysis of SIKE	2021-05-25	Paper
A trade-off between classical and quantum circuit size for an attack against CSIDH	2021-05-25	Paper
On the quantum attacks against schemes relying on the hardness of finding a short generator of an ideal in \(\mathbb{Q}(\zeta_{2^s})\)	2019-11-28	Paper
A note on the security of CSIDH	2019-03-29	Paper
On the computation of the HNF of a module over the ring of integers of a number field	2019-01-21	Paper
A low-resource quantum factoring algorithm	2018-09-12	Paper
Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields	2018-07-16	Paper
Approximate short vectors in ideal lattices of \(\mathbb{Q}(\zeta_{p^e})\) with precomputation of \({\mathrm {Cl}}(\mathcal{O}_K)\)	2018-04-26	Paper
Computing Generator in Cyclotomic Integer Rings	2017-06-13	Paper
Fast heuristic algorithms for computing relations in the class group of a quadratic order, with applications to isogeny evaluation	2017-04-04	Paper
New techniques for computing the ideal class group and a system of fundamental units in number fields	2015-10-01	Paper
A Quantum Algorithm for Computing Isogenies between Supersingular Elliptic Curves	2015-09-10	Paper
A polynomial time algorithm for computing the HNF of a module over the integers of a number field	2015-03-27	Paper
A fast algorithm for finding a short generator of a principal ideal of $\mathbb{Q}(\zeta_{p^s})$	2015-03-10	Paper
Subexponential time relations in the class group of large degree number fields	2015-01-28	Paper
Smoothness testing of polynomials over finite fields	2015-01-28	Paper
Subexponential class group and unit group computation in large degree number fields	2014-09-05	Paper
An 𝐿(1/3) algorithm for ideal class group and regulator computation in certain number fields	2014-06-04	Paper
An L(1/3) algorithm for discrete logarithm computation and principality testing in certain number fields	2012-04-05	Paper
An algorithm for list decoding number field codes	2011-07-12	Paper
Improvements in the computation of ideal class groups of imaginary quadratic number fields	2011-06-03	Paper
Practical Improvements to Class Group and Regulator Computation of Real Quadratic Fields	2010-09-29	Paper
Non-randomness in eSTREAM Candidates Salsa20 and TSC-4	2008-04-11	Paper

Research outcomes over time

This page was built for person: Jean-François Biasse