publications

publications by category. generated by jekyll-scholar.

Miscellaneous

2024

  1. LESS
    M. Baldi, A. Barenghi, L. Beckwith, and 9 more authors
    2024
    Additional Digital Signature Schemes - Round 2 Submissions. NIST standardization process of Post-Quantum Cryptography

2023

  1. Anonymity preserving data collection using homomorphic encryption
    J.-F. Biasse, W. Youmans, S. Chelleppan, and 2 more authors
    2023
    Patent Nb. US 11,809,597 B2

2020

  1. Trace-\(Σ\): a privacy-preserving contact tracing app
    J.-F. Biasse, S. Chelleppan, S. Kariev, and 5 more authors
    2020
    IACR Cryptol. ePrint Arch.

Preprints

2025

  1. An efficient quantum algorithm for computing S-units and its applications
    J.-F. Biasse and F. Song
    2025
    \urlhttps://eprint.iacr.org/2025/1797
  2. PAKEM and PAHE: How to Use Password for One Shot Secure Communication
    A. Durbet, J.-F. Biasse, and R. Safavi-Naeini
    2025
  3. A search to decision reduction for the linear code equivalence problem
    J.-F. Biasse, G. Micheli, B. Prada, and 1 more author
    2025

Peer-reviewed publications

2025

  1. Faster SCALLOP from Non-prime Conductor Suborders in Medium Sized Quadratic Fields
    B. Allombert, J.-F. Biasse, J. Komada Eriksen, and 5 more authors
    In Public-Key Cryptography - PKC 2025 - 28th IACR International Conference on Practice and Theory of Public-Key Cryptography, Røros, Norway, May 12-15, 2025, Proceedings, Part III, 2025
    DOI
  2. Asymptotic improvements to provable algorithms for the code equivalence problem (extended abstract)
    H. Bennett, D. Bhatia, J.-F. Biasse, and 4 more authors
    IEEE International Symposium on Information Theory, ISIT 2025, Ann Arbor, MI, USA, June 22-27, 2025, 2025
  3. Asymptotic improvements to provable algorithms for the code equivalence problem
    H. Bennett, D. Bhatia, J.-F. Biasse, and 4 more authors
    IEEE Transactions in Information Theory, 2025
  4. The Code Equivalence Problem and Its Applications to Cryptography
    J.-F. Biasse and G. Micheli
    La Matematica, 2025
    DOI

2024

  1. An algorithm for solving the principal ideal problem with subfields
    J.-F. Biasse, C. Fieker, T. Hofmann, and 1 more author
    Adv. Math. Commun., 2024
    DOI

2023

  1. A Search-to-Decision Reduction for the Permutation Code Equivalence Problem
    J.-F. Biasse and G. Micheli
    In IEEE International Symposium on Information Theory, ISIT 2023, Taipei, Taiwan, June 25-30, 2023, 2023
    DOI
  2. On the computational hardness of the code equivalence problem in cryptography
    A. Barenghi, J.-F. Biasse, E. Persichetti, and 1 more author
    Adv. Math. Commun., 2023
    DOI
  3. A proof of the conjectured run time of the Hafner-McCurley class group algorithm
    J.-F. Biasse and R. Erukulangara
    Adv. Math. Commun., 2023
    DOI
  4. Quantum algorithms for attacking hardness assumptions in classical and post-quantum cryptography
    J.-F. Biasse, X. Bonnetain, E. Kirshanova, and 2 more authors
    IET Inf. Secur., 2023
    DOI

2022

  1. Norm relations and computational problems in number fields
    J.-F. Biasse, C. Fieker, T. Hofmann, and 1 more author
    Journal of the London Mathematical Society, 2022
    DOI
  2. Advanced signature functionalities from the code equivalence problem
    A. Barenghi, J.-F. Biasse, T. Ngo, and 2 more authors
    Int. J. Comput. Math. Comput. Syst. Theory, 2022
    DOI
  3. Mildly Short Vectors in Ideal Lattices of Certain Families of Cyclotomic Fields Without Quantum Computers.
    J.-F. Biasse, R. Erukulangara, C. Fieker, and 2 more authors
    Mathematical Cryptology, 2022

2021

  1. LESS-FM: Fine-Tuning Signatures from the Code Equivalence Problem
    A. Barenghi, J.-F. Biasse, E. Persichetti, and 1 more author
    In Post-Quantum Cryptography - 12th International Workshop, PQCrypto 2021, Daejeon, South Korea, July 20-22, 2021, Proceedings, 2021
    DOI
  2. A trade-off between classical and quantum circuit size for an attack against CSIDH
    J.-F. Biasse, X. Bonnetain, B. Pring, and 2 more authors
    J. Math. Cryptol., 2021
    DOI
  3. A framework for reducing the overhead of the quantum oracle for use with Grover’s algorithm with applications to cryptanalysis of SIKE
    J.-F. Biasse and B. Pring
    J. Math. Cryptol., 2021
    DOI
  4. Parallelism strategies for the tuneable golden-claw finding problem
    R. Azarderakhsh, J.-F. Biasse, R. El Khatib, and 2 more authors
    Int. J. Comput. Math. Comput. Syst. Theory, 2021
    DOI

2020

  1. LESS is More: Code-Based Signatures Without Syndromes
    J.-F. Biasse, G. Micheli, E. Persichetti, and 1 more author
    In Progress in Cryptology - AFRICACRYPT 2020 - 12th International Conference on Cryptology in Africa, Cairo, Egypt, July 20-22, 2020, Proceedings, 2020
    DOI

2019

  1. Improved techniques for computing the ideal class group and a system of fundamental units in number fields.
    J.-F. Biasse and C. Vrendendaal
    In Algorithmic Number Theory, 13th International Symposium, ANTS-XIII, Madison WI, USA, July 16-20, 2018. Proceedings, 2019
  2. On the quantum attacks against schemes relying on the hardness of finding a short generator of an ideal in Q(\zeta_2^n)
    J.-F. Biasse and F. Song
    Journal of Mathematical Cryptology, 2019

2018

  1. A Note on the Security of CSIDH
    J.-F. Biasse, A. Iezzi, and M. Jacobson Jr.
    In Progress in Cryptology - INDOCRYPT 2018 - 19th International Conference on Cryptology in India, New Delhi, India, December 9-12, 2018, Proceedings, 2018
    DOI

2017

  1. Computing Generator in Cyclotomic Integer Rings - A Subfield Algorithm for the Principal Ideal Problem in L_\Delta_K(1/2) and Application to the Cryptanalysis of a FHE Scheme
    J.-F. Biasse, T. Espitau, P.-A. Fouque, and 2 more authors
    In Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30 - May 4, 2017, Proceedings, Part I, 2017
  2. A Low-Resource Quantum Factoring Algorithm
    D. J. Bernstein, J.-F. Biasse, and M. Mosca
    In Post-Quantum Cryptography - 8th International Workshop, PQCrypto 2017, Utrecht, The Netherlands, June 26-28, 2017, Proceedings, 2017
  3. Approximate Short Vectors in Ideal Lattices of Q(\zeta_p^ e) with Precomputation of Cl(O_K)
    J.-F. Biasse
    In Selected Areas in Cryptography - SAC 2017 - 24th International Conference, Ottawa, ON, Canada, August 16-18, 2017, Revised Selected Papers, 2017
    DOI
  4. On the computation of the HNF of a module over the ring of integers of a number field
    J.-F. Biasse, C. Fieker, and T. Hofmann
    J. Symb. Comput., 2017
    DOI

2016

  1. Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields
    J.-F. Biasse and F. Song
    In Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016, 2016
    DOI
  2. Fast heuristic algorithms for computing relations in the class group of a quadratic order, with applications to isogeny evaluation
    J.-F. Biasse, C. Fieker, and M. Jacobson
    LMS Journal of Computation and Mathematics, 2016
    DOI

2015

  1. FHEW with Efficient Multibit Bootstrapping
    J.-F. Biasse and L. Ruiz
    In Progress in Cryptology - LATINCRYPT 2015 - 4th International Conference on Cryptology and Information Security in Latin America, Guadalajara, Mexico, August 23-26, 2015, Proceedings, 2015
    DOI

2014

  1. A Quantum Algorithm for Computing Isogenies between Supersingular Elliptic Curves
    J.-F. Biasse, D. Jao, and A. Sankar
    In Progress in Cryptology - INDOCRYPT 2014 - 15th International Conference on Cryptology in India, New Delhi, India, December 14-17, 2014, Proceedings, 2014
    DOI
  2. An L(1/3) algorithm for ideal class group and regulator computation in certain number fields.
    J.-F. Biasse
    Math. Comp., 2014
  3. Subexponential class group and unit group computation in large degree number fields
    J.-F. Biasse and C. Fieker
    LMS Journal of Computation and Mathematics, Jan 2014
    DOI
  4. Smoothness testing of polynomials over finite fields
    J.-F. Biasse and M. Jacobson Jr.
    Advances in Mathematics of Communications, Jan 2014
    DOI
  5. Subexponential time relations in the class group of large degree number fields
    J.-F. Biasse
    Advances in Mathematics of Communications, Jan 2014

2012

  1. A polynomial time algorithm for computing the HNF of a module over the integers of a number field.
    J.-F. Biasse and C. Fieker
    In International Symposium on Symbolic and Algebraic Computation, ISSAC’12, Grenoble, France - July 22 - 25, 2012, Jan 2012
  2. An algorithm for list decoding number field codes.
    J.-F. Biasse and G. Quintin
    In Proceedings of the 2012 IEEE International Symposium on Information Theory, ISIT 2012, Cambridge, MA, USA, July 1-6, 2012, Jan 2012
  3. Improved techniques for computing the ideal class group and a system of fundamental units in number fields.
    J.-F. Biasse and C. Fieker
    In Algorithmic Number Theory, 10th International Symposium, ANTS-IX, San Diego CA, USA, July 9-13, 2012. Proceedings, Jan 2012

2010

  1. Security Estimates for Quadratic Field Based Cryptosystems.
    J.-F. Biasse, M. Jacobson Jr., and A. Silvester
    In Information Security and Privacy - 15th Australasian Conference, ACISP 2010, Sydney, Australia, July 5-7, 2010. Proceedings, Jan 2010
  2. Practical Improvements to Class Group and Regulator Computation of Real Quadratic Fields.
    J.-F. Biasse and M. Jacobson
    In Algorithmic Number Theory, 9th International Symposium, ANTS-IX, Nancy, France, July 19-23, 2010. Proceedings, Jan 2010
  3. Algebraic techniques for number fields.
    J.-F. Biasse, M. Jacobson Jr., and A. Silvester
    In 2nd International Conference on Symbolic Computation and Cryptography , SCC 2010, Egham, UK. Proceedings, Jan 2010
  4. Improvements in the computation of ideal class groups of imaginary quadratic number fields.
    J.-F. Biasse
    Adv. in Math. of Comm., Jan 2010

2006

  1. Non-randomness in eSTREAM Candidates Salsa20 and TSC-4.
    S. Fischer, W. Meier, C. Berbain, and 2 more authors
    In Progress in Cryptology - INDOCRYPT 2006, 7th International Conference on Cryptology in India, Kolkata, India, December 11-13, 2006, Proceedings, Jan 2006