Jean-François Biasse

发表

Norm relations and computational problems in number fields

Jean-François Biasse, C. Fieker, Tommy Hofmann, 2020, Journal of the London Mathematical Society.

of the Thirteenth Algorithmic Number Theory Symposium

Jean-François Biasse, Christine Van Vredendaal, C. V. Vredendaal, 2019 .

N T ] 3 0 Se p 20 16 A fast algorithm for finding a short generator of a principal ideal of Q ( ζ p s )

Jean-François Biasse, 2016 .

Advanced signature functionalities from the code equivalence problem

Alessandro Barenghi, Jean-François Biasse, Edoardo Persichetti, 2022, International Journal of Computer Mathematics: Computer Systems Theory.

A fast algorithm for finding a short generator of a principal ideal of $\mathbb{Q}(\zeta_{p^s})$

Jean-François Biasse, 2015, 1503.03107.

A fast algorithm for finding a short generator of a principal ideal of $\mathbb{Q}(\zeta_{2^n})$

Jean-François Biasse, 2015, 1503.03107.

Quantum algorithms for attacking hardness assumptions in classical and post‐quantum cryptography

Jean-François Biasse, E. Kirshanova, André Schrottenloher, 2022, IET Information Security.

Subexponential class group and unit group computation in large degree number fields

Claus Fieker, Jean-François Biasse, Jean-François Biasse, 2014, LMS J. Comput. Math..

A note on the quantum attacks against the multilinear maps based on ideal lattices

Jean-François Biasse, Fang Song, 2015 .

Smoothness testing of polynomials over finite fields

Michael J. Jacobson, Jean-François Biasse, M. Jacobson, 2014, Adv. Math. Commun..

A trade-off between classical and quantum circuit size for an attack against CSIDH

André Schrottenloher, Xavier Bonnetain, Jean-François Biasse, 2020, J. Math. Cryptol..

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

Thomas Espitau, Pierre-Alain Fouque, Jean-François Biasse, 2017, EUROCRYPT.

Subexponential time relations in the class group of large degree number fields

Jean-François Biasse, Jean-François Biasse, 2014, Adv. Math. Commun..

Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields

Fang Song, Jean-François Biasse, Jean-François Biasse, 2016, SODA.

Parallelism strategies for the tuneable golden-claw finding problem

Reza Azarderakhsh, Jean-François Biasse, Benjamin Pring, 2021, Int. J. Comput. Math. Comput. Syst. Theory.

On the computation of the HNF of a module over the ring of integers of a number field

Claus Fieker, Jean-François Biasse, Tommy Hofmann, 2016, J. Symb. Comput..

Security Estimates for Quadratic Field Based Cryptosystems

Michael J. Jacobson, Alan K. Silvester, Jean-François Biasse, 2010, ACISP.

A Quantum Algorithm for Computing Isogenies between Supersingular Elliptic Curves

David Jao, Jean-François Biasse, Anirudh Sankar, 2014, INDOCRYPT.

An algorithm for list decoding number field codes

Guillaume Quintin, Jean-François Biasse, Jean-François Biasse, 2011, 2012 IEEE International Symposium on Information Theory Proceedings.

Improvements in the computation of ideal class groups of imaginary quadratic number fields

Jean-François Biasse, Jean-François Biasse, 2010, Adv. Math. Commun..

An L(1/3) algorithm for ideal class group and regulator computation in certain number fields

Jean-François Biasse, Jean-François Biasse, 2009, Math. Comput..

An algorithm for solving the principal ideal problem with subfields

Jean-François Biasse, C. Fieker, Tommy Hofmann, 2023, Advances in Mathematics of Communications.

Quantum Algorithms for Attacking Hardness Quantum Algorithms for Attacking Hardness Assumptions in Classical and Post ‐ Quantum Assumptions in Classical and Post Quantum Cryptography Cryptography

Jean-François Biasse, 2022 .

Approximate Short Vectors in Ideal Lattices of Q(ζpe) with Precomputation of Cl(OK)

Jean-François Biasse, Jean-François Biasse, 2017, SAC.

A polynomial time algorithm for computing the HNF of a module over the integers of a number field pdf

Claus Fieker, Jean-François Biasse, Jean-François Biasse, 2012, ISSAC.

An L(1/3) algorithm for discrete logarithm computation and principality testing in certain number fields pdf

Jean-François Biasse, Jean-François Biasse, 2012, ArXiv.

A Low-Resource Quantum Factoring Algorithm

Daniel J. Bernstein, Michele Mosca, Jean-François Biasse, 2017, PQCrypto.

Fast heuristic algorithms for computing relations in the class group of a quadratic order, with applications to isogeny evaluation

Claus Fieker, Michael J. Jacobson, Jean-François Biasse, 2016 .

NEW TECHNIQUES FOR COMPUTING THE IDEAL CLASS GROUP AND A SYSTEM OF FUNDAMENTAL UNITS IN NUMBER FIELDS

Jean-François Biasse, C. Fieker, 2013 .

New techniques for computing the ideal class group and a system of fundamental units in number fields pdf

Claus Fieker, Jean-François Biasse, Jean-François Biasse, 2012, ArXiv.

ANTS X Proceedings of the Tenth Algorithmic Number Theory Symposium msp Improved techniques for computing the ideal class group and a system of fundamental units in number fields

Jean-François Biasse, C. Fieker, 2013 .

A note on the security of CSIDH pdf

Michael J. Jacobson, Jean-François Biasse, Annamaria Iezzi, 2018, INDOCRYPT.

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

Pierre-Alain Fouque, Jean-François Biasse, Thomas Espitau, 2017, EUROCRYPT.

Norm relations and computational problems in number fields

Jean-François Biasse, C. Fieker, Tommy Hofmann, 2020, Journal of the London Mathematical Society.