Jean-François Biasse

Postdoctoral fellow at the University of Waterloo

Faculty of Mathematics - C & O department , and Institute for Quantum Computing.

Email : biasse "at" lix "dot" polytechnique "dot" fr.

Room : QNC-3114.

University of Waterloo - Institute for Quantum Computing
200 University Ave. West
Waterloo, Ontario, Canada N2L 3G1.

Short Bio

Since July 2014, I am a postoctoral fellow at the University of Waterloo under the supervision of Michele Mosca and David Jao . I am supported by the Cryptoworks21 program and the Institute for quantum computing .

For 2.5 years, I was a postdoctoral fellow at the University of Calgary under the supervision of Michael Jacobson Jr. I was supported by a PIMS fellowship.

For 6 months, I was a visiting scholar in the MAGMA development team at the University of Sydney, invited by John Cannon and Claus Fieker.

I received a PhD from the École Polytechnique under the supervision of Andreas Enge.

Publications

Preprints

J.-F. Biasse, C. Fieker and T. Hofmann On the HNF computation of modules over the ring of integers of a number field Submitted.

Journal papers

J.-F. Biasse Subexponential time ideal decomposition in orders of number fields of large degree To appear in Advances in Mathematics of Communications.

J.-F. Biasse and M. Jacobson Jr. Batch smoothness test of polynomials over finite fields To appear in Advances in Mathematics of Communications.

J.-F. Biasse and C. Fieker Subexponential class group and unit group computation in large degree number fields LMS Journal of Computation and Mathematics, 17:385-403, 2014. pdf bib

J.-F. Biasse An L(1/3) algorithm for ideal class group and regulator computation in certain number fields Mathematics of Computation, 83(288):2005-2031, 2014. pdf bib

J.-F. Biasse Practical improvements to ideal class group computation in imaginary quadratic number fields Advances in Mathematics of Communications, 4(2):141-154, 2010. pdf bib

Conference proceedings with reviewing committee

J.-F. Biasse and D. Jao A quantum algorithm for computing isogenies between supersingular curves To appear in Proceedings of the 15th International Conference on Cryptology in India (INDOCRYPT 2014).

J.-F. Biasse and Claus Fieker Improved techniques for computing the ideal class group and a system of fundamental units in number fields Proceedings of the 10th Algorithmic Number Theory Symposium (ANTS X) Open Book Series - Mathematical Science Publishers, 2012, vol. 1 pp. 113-133.pdf bib

J.-F. Biasse and G. Quintin An algorithm for list decoding number field codes Proceedings of the 2012 IEEE International Symposium on Information Theory (ISIT), Cambridge, MA, USA, July 1-6, 2012, IEEE, 2012 pp. 91-95.pdf bib

J.-F. Biasse and C. Fieker A polynomial time algorithm for computing the HNF of a module over the integers of a number field International Symposium on Symbolic and Algebraic Computation (ISSAC) Grenoble, France - July 22 - 25, 2012, ACM, 2012 pp. 75-82. pdf bib

J.-F. Biasse M. Jacobson Jr. and A. Silverster Algebraic techniques for number fields 2nd International Conference on Symbolic Computation and Cryptography (SCC 2010, Egham, UK). pdf bib

J.-F. Biasse and M. Jacobson Jr. Practical improvements to class group and regulator computation in real number fields Proceedings of the 9th Algorithmic Number Theory Symposium (ANTS IX), Lecture Notes in Computer Science vol. 6197, Springer 2010, pp. 50-67. pdf bib

J.-F. Biasse M. Jacobson Jr. and A. Silverster Security estimates for number field based cryptosystems Australasian Conference in Information Security and Privacy (ACISP) , Lecture Notes in Computer Science, vol. 6168, Springer 2010, pp. 233-247. pdf bib

J.-F. Biasse, C. Berbain, M. Robshaw, S. Fisher and W. Meier Non-randomness in eSTREAM Candidates Salsa20 and TSC-4 7th International Conference on Cryptology in India (INDOCRYPT) Lecture Notes in Computer Science, vol. 4329, Springer 2006, pp. 2-16. pdf bib

Teaching

Math 253 : Calculus II

Winter 2014 at the University of Calgary.