__Miscellaneous Research__

[39] J.-F. Biasse, S. Chelleppan, S. Kariev, N. Khan, L. Menezes, E. Seyitoglu, C. Somboonwit, A. Yavuz **Trace-: a privacy-preserving contact tracing app **. pdf bib.

[38] J.-F. Biasse, W. Youmans, S. Chellappan, N. Fisk, and N. Khan ** Anonymity preserving
data collection using homomorphic encryption **. pdf. U.S. Patent Application 17/213, 965.

[37] M.Baldi, Alessandro Barenghi, L. Beckwith, J.-F. Biasse, A. Esser, K. Gaj, K. Mohajerani, G. Pelosi, E. Persichetti, M.-J. O. Saarinen, P. Santini and R. Wallace **LESS: NIST Additional Digital Signature Schemes - Round 1 Submission **. Link bib.

__Journal papers__

[36] J.-F. Biasse, C. Fieker, T. Hofmann, and W. Youmans **An Algorithm for Solving the Principal Ideal Problem with Subfields** *Advances in Mathematics of Communications*, early access, 2023.

[35] J.-F. Biasse, X. Bonnetain, E. Kirshanova, A. Schrottenloher, and F. Song **Quantum Algorithms to attack Hardness Assumptions in Post-Quantum Cryptography** *IET, Information Security*, 17(2):171-209, 2023. pdf

[34] J.-F. Biasse and M. R. Erukulangara **A proof of the conjectured run time of the Hafner-McCurley class group algorithm** *Advances in Mathematics of Communications*, 17(6):1388-1405, 2023.

[33] J.-F. Biasse, M. R. Erukulangara, C. Fieker, T. Hofmann, and W. Youmans ** Mildly Short Vectors in Ideal Lattices of Certain Families of Cyclotomic Fields Without Quantum Computers** *Mathematical Cryptology*, 2(1):84-107, 2022. pdf

[32] A. Barenghi, J.-F. Biasse, E. Persichetti, and P. Santini **On the Computational Hardness of the Code Equivalence Problem in Cryptography** *Advances in Mathematics of Communications*, 17(1):23-55, 2022. pdf

[31] A. Barenghi, J.-F. Biasse, E. Persichetti, and P. Santini ** Advanced Functionalities for Signatures from the Code Equivalence Problem. ** *International Journal of Computer Mathematics: Computer Systems Theory*, 7(2):112-128, 2022.

[30] J.-F. Biasse, C. Fieker, T. Hofmann, and A. Page **Norm relations and computational problems in number fields ** *Journal of the London Mathematical Society* 105(4):2373-2414, 2022. pdf bib.

[29] ] R. Azarderakhsh, J.-F. Biasse, R. El Khatib, B. Langenberg, and B. Pring ** Parallelism strategies for the tuneable golden-claw finding problem** *International Journal of Computer Mathematics: Computer Systems Theory*, 6(4):337-363, 2021.

[28] J.-F. Biasse and B. Pring **A framework for reducing the overhead of the quantum oracle for use with Grovers algorithm with applications to cryptanalysis of SIKE** *Journal of Mathematical Cryptology*, 15(1):143-156, 2021.

[27] J.-F. Biasse, X. Bonnetain, B. Pring, A. Schrottenloher, and W. Youmans **A trade-off between classical and quantum circuit size for an attack against CSIDH** *Journal of Mathematical Cryptology*, 15(1):4-17, 2021.

[26] J.-F. Biasse and F. Song **On the quantum attacks against schemes relying on the hardness of finding a short generator of an ideal in ℚ(ζ**_{2ⁿ}) *Journal of Mathematical Cryptology*, 13(3-4):151-168, 2019. pdf bib.

[25] J.-F. Biasse, C. Fieker and T. Hofmann **On the HNF computation of modules over the ring of integers of a number field**
*Journal of Symbolic Computation*, 80:581-615, 2017. pdf bib.

[24] 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 **,
*LMS Journal of Computation and Mathematics*, 19:371-390, 2016. pdf bib.

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

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

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

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

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

[18] J.-F. Biasse and G. Micheli **A Search-to-Decision Reduction for the Permutation Code Equivalence Problem** *IEEE International Symposium on Information Theory (ISIT), Taipei, Taiwan * pp. 602-607 2023.

[17] A. Barenghi, J.-F. Biasse, E. Persichetti, and P. Santini **LESS-FM: Fine-Tuning Signatures from the Code Equivalence Problem** *Post-Quantum Cryptography: 12th International Workshop, PQCrypto 2021, Daejeon, South Korea, July 20-22, 2021, Proceedings * Lecture Notes in Computer Science,
vol. 12841, Springer 2021, pp. 23-43. pdf.

[16] J.-F. Biasse, G. Micheli, E. Persichetti and P. Santini **LESS is More: Code-Based Signatures without Syndromes** *12th International Conference on Cryptology in Africa, Cairo, Egypt, July 20-22, 2020 * Lecture Notes in Computer Science,
vol. 12174, Springer 2020, pp. 45-65. pdf bib.

[15] J.-F. Biasse, A. Iezzi and M. Jacboson **A note on the security of CSIDH** *19th International Conference on Cryptology in India (INDOCRYPT), New Delhi, India, December 9-12, 2018 * Lecture Notes in Computer Science,
vol. 11356, Springer 2018, pp. 153-168. pdf bib.

[14] J.-F. Biasse and C. van Vredendaal **Fast multiquadratic S-unit computation and application to the calculation of class groups ** *Proceedings of the 13th Algorithmic Number Theory Symposium (ANTS XIII)* Open Book Series - Mathematical Science Publishers, 2019, vol. 2
pp. 103-118. pdf bib.

[13] J.-F. Biasse **Approximate short vectors in ideals of ℚ(ζ**_{2ⁿ}) with precomputation of the class groups *Selected Areas in Cryptography - SAC 2017 - 24th International Conference, Ottawa, ON, Canada, August 16-18, 2017*, Lecture Notes in Computer Science vol. 10719 Springer, 2017 pp. 374-393. pdf bib.

[12] D. Bernstein, J.-F. Biasse and M. Mosca **A low-resource quantum factoring algorithm** *Post-Quantum Cryptography - 8th International Workshop, PQCrypto 2017, Utrecht, The Netherlands, June 26-28, 2017, Proceedings*,
Lecture Notes in Computer Science vol. 10346 Springer, 2017 pp. 330-346. pdf bib

[11] J.-F. Biasse, T. Espiteau, A. Gelin, P.-A. Fouque and P. Kirchener ** A subfield algorithm for the Principal Ideal Problem in L(1/2) and application to cryptanalysis of a FHE scheme** *Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France*,
Lecture Notes in Computer Science vol. 10210 Springer, 2017 pp. 60-88. pdf bib

[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