Jean-François Biasse

PIMS Posdoctoral fellow at University of Calgary

Computer science department and Mathematics department
University of Calgary
2500 University Drive NW - Calgary Alberta T2N 1N4

Tel: +1 403 220 3941
Fax: +1 403 284 4707
E-mail: name"at"lix.polytechnique.fr
Office: MS 374 and ICT 609
Jean-François Biasse

Research

I did my PhD in computer science under the supervision of Andreas Enge with title "Subexponential algorithms for number fields". I am now working for the Institute for Security, Privacy and Information Assurance (ISPIA) at the university of Calgary.

Though not limited to, my main interest are

  • Cryptology,
  • Computer Algebra,
  • Coding theory,
  • Algorithmic Number Theory.

Preprints

  • [1] J.-F. Biasse and C. Fieker, A polynomial time algorithm for computing the HNF of a module over the integers of a number field Preprint .
  • [2] J.-F. Biasse and G. Quintin, An algorithm for list decoding number field codes Preprint .
  • [3] J.-F. Biasse, An L(1/3) Algorithm for solving the DLP and PIP in certain number fields, Preprint (being rewritten in light of the comments made on [4]).

Journal papers

  • [4] J.-F. Biasse, An L(1/3) algorithm for ideal class group and regulator computation in certain number fields. To appear in Mathematics of Computation.
  • [5] J.-F. Biasse, Practical improvements to ideal class group computation in imaginary quadratic number fields, Advances in Mathematics of Comunications 4 (2), 2010, pp. 141-154.

Springer LNCS conference proceedings

  • [6] J.-F. Biasse and M. Jacobson, Practical improvements to class group and regulator computation in real number fields,. Algorithmic Number Theory Symposium - ANTS IX Lecture Notes in Computer Science vol. 6197, pp. 50-65.
  • [7] J.-F. Biasse, M. Jacobson and A. Silverster Security estimates for number field based cryptosystems, Australasian Conference in Information Security and Privacy- ACISP 2010 Lecture Notes in Computer Science vol. 6197, pp. 50-65.
  • [8] J.-F. Biasse, C. Berbain, M. Robshaw, S. Fisher and W. Meier, Non-randomness in eSTREAM Candidates Salsa20 and TSC-4, INDOCRYPT 2006, 7th International Conference on Cryptology in India Lecture Notes in Computer Science vol. 4329, pp. 2-16.

Other conference proceedings

  • [9] J.-F. Biasse, M. Jacobson and A. Silvester, Algebraic techniques for number fields 2nd International Conference on Symbolic Computation and Cryptography (SCC 2010, Egham, UK) Royal Holloway, University of London.

Teaching

2007-2010
TA (Moniteur) for the applied mathematics department of Ecole Polytechnique (CMAP).
  • INF557 Introduction to C++
  • MAP431 Numerical Analysis
  • MAP311 Probability

Talks

Seminars
Number Field Computations
  • LORIA, Nancy, France, April 2010
  • University of Calgary, Canada, February 2010
An L(1/3) algorithm for ideal class group and regulator computation
  • University of Bordeaux I, France, October 2009
  • University of Calgary, Canada, September 2009
Group structure computation LIRMM, Montpellier, France, October 2009
Conferences
Improvements to class group and regulator computations in real quadratic number fields Algorithmic Number Theory Symposium IX, Nancy , France
Security estimates for number fields cryptosystems 15th Australasian Conference on Information Security and Privacy, Sydney, Australia
Algebraic techniques for number fields 2nd International Conference on Symbolic Computation and Cryptography, London, UK
Improvements to ideal class group computation in imaginary quadratic number fields Conference on Hyperelliptic curves, discrete Logarithms, Encryption, etc., Frutilar, Chile