( en | de | ru )

 

Disambiguation of "Biasse, Jean-François"

Author of the publication

copydeleteadd this publication to your clipboard
Fast heuristic algorithms for computing relations in the class group of a quadratic order, with applications to isogeny evaluation.

, , and . LMS J. Comput. Math., 19 (A): 371-390 (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Jean-François Stumper

Jean-François Viaud

Jean-François Paillotin

Jean François Savoie

Jean-François Hren

 

Other publications of authors with the same name

Smoothness testing of polynomials over finite fields., and . Adv. Math. Commun., 8 (4): 459-477 (2014)LESS-FM: Fine-Tuning Signatures from the Code Equivalence Problem., , , and . PQCrypto, volume 12841 of Lecture Notes in Computer Science, page 23-43. Springer, (2021)A framework for reducing the overhead of the quantum oracle for use with Grover's algorithm with applications to cryptanalysis of SIKE., and . J. Math. Cryptol., 15 (1): 143-156 (2021)LESS-FM: Fine-tuning Signatures from a Code-based Cryptographic Group Action., , , and . IACR Cryptol. ePrint Arch., (2021)FHEW with Efficient Multibit Bootstrapping., and . LATINCRYPT, volume 9230 of Lecture Notes in Computer Science, page 119-135. Springer, (2015)New techniques for computing the ideal class group and a system of fundamental units in number fields, and . CoRR, (2012)An L(1/3) algorithm for ideal class group and regulator computation in certain number fields.. Math. Comput., 83 (288): 2005-2031 (2014)Trace-Σ: a privacy-preserving contact tracing app., , , , , , , and . IACR Cryptol. ePrint Arch., (2020)Advanced Signature Functionalities from the Code Equivalence Problem., , , , and . IACR Cryptol. ePrint Arch., (2022)On the quantum attacks against schemes relying on the hardness of finding a short generator of an ideal in., and . J. Math. Cryptol., 13 (3-4): 151-168 (2019)