Jean-François Biasse

Assistant Professor of Mathematics at the University of South Florida

College of Arts and Sciences - Mathematics department.

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

Room : CMC 303A.

University of South Florida - Department of Mathematics and Statistics
4020 E Fowler Avenue
Tampa, Florida, USA 33620.

Short Bio

Since August 2015, I have been an assistant professor of mathematics at the University of South Florida.

For 1 year, I was a postoctoral fellow at the University of Waterloo under the supervision of Michele Mosca and David Jao . I was 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

[18] J.-F. Biasse and F. Song A note on the quantum attacks against schemes relying on the hardness of finding a short generator of an ideal in ℚ(ζ2ⁿ) Submitted. pdf bib.

Journal papers

[17] J.-F. Biasse, C. Fieker and M. Jacobson Jr Fast heuristic algorithms for computing relations in the class group of a quadratic order with applications to isogeny evaluation , To appear in the LMS Journal of Computation and Mathematics.

[16] J.-F. Biasse, C. Fieker and T. Hofmann On the HNF computation of modules over the ring of integers of a number field To appear in the Journal of Symbolic Computation.

[15] J.-F. Biasse Subexponential time ideal decomposition in orders of number fields of large degree Advances in Mathematics of Communications, 8(4):407-425, 2014. pdf bib.

[14] J.-F. Biasse and M. Jacobson Jr. Batch smoothness test of polynomials over finite fields Advances in Mathematics of Communications, 8(4):459-477, 2014. pdf bib.

[13] 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

[12] 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

[11] 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

[10] J.-F. Biasse and F. Song A polynomial time quantum algorithm for computing class groups and solving the principal ideal problem in arbitrary degree number fields Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, (SODA), Arlington, VA, USA, January 10-12, 2016, SIAM, 2016 pp. 893-902. pdf bib

[9] J.-F. Biasse and L. Ruis FHEW with fast multibit bootstrapping 4th International Conference on Cryptology and Information Security in Latin America (LATINCRYPT), Guadalajara, Mexico, August 23-26, 2015, Lecture Notes in Computer Science, vol. 9230, Springer 2015, pp. 119-135. pdf bib.

[8] J.-F. Biasse, D. Jao and A. Sankar A quantum algorithm for computing isogenies between supersingular curves 15th International Conference on Cryptology in India (INDOCRYPT), New Delhi, India, December 14-17, 2014 Lecture Notes in Computer Science, vol. 8885, Springer 2014, pp. 428-442. pdf bib.

[7] 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

[6] 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

[5] 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

[4] 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

[3] 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

[2] 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

[1] 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

Funding

Simons Fundation collaboration grant Principal Investigator. 35,000 USD (2016-2021).

PIMS postdoctoral fellowship 40,000 CAD (2011-2014).

Teaching

MAS4214 : Elementary Number Theory Fall 2016 at the University of South Florida.

MAD4471 : Introduction to Cryptograpy and Coding Theory Fall 2016 at the University of South Florida.

MAT5932 : Applied Cryptography (online) Spring 2016 at the University of South Florida.

MAD4471 : Introduction to Cryptograpy and Coding Theory Fall 2015 at the University of South Florida.

QIC 891 : Topics in Post Quantum Cryptography (session on PQC) Spring 2015 at the University of Waterloo.

MATH 225 : Applied Linear Algebra 2 Spring 2015 at the University of Waterloo.

MATH 253 : Calculus II Winter 2014 at the University of Calgary.