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.
 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.
 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.
 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.
 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.
 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.
 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.
Conference proceedings with reviewing committee
 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
 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.
 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.
 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.
 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).
 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.
 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