I am an assistant professor in the Department of Mathematical Sciences at Florida Atlantic University. My research interests are in cryptography and computational number theory.
MAC-2312 Calculus-Analytic Geometry II, Spring 2019.
MAS-3203 Introductory Number Theory, Spring 2019.
MAD-6403 Computational Mathematics, Fall 2018.
MAC-2311 Calculus-Analytic Geometry I, Fall 2018.
MAD-2502 Introduction to Computational Mathematics, Spring 2018.
MAS-3203 Introductory Number Theory, Spring 2018.
MAS-6215 Algebraic Number Theory, Fall 2017.
MAD-6478 Cryptanalysis, Spring 2017.
MAC-2311 Calculus-Analytic Geometry I, Spring 2017.
Shi Bai, Steven Galbraith, Liangze Li and Daniel Sheffield. Improved exponential-time algorithms for inhomogeneous-SIS. Journal of Cryptology. 32 (2019), 35-83.
Shi Bai, Damien Stehlé and Weiqiang Wen. Measuring, simulating and exploiting the head concavity phenomenon in BKZ. Asiacrypt, 2018.
Shi Bai, Adeline Langlois, Tancrède Lepoint, Damien Stehlé, Amin Sakzad and Ron Steinfeld. Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance. Journal of Cryptology. 31 (2018), 610-640.
Jinming Wen, Chao Tong and Shi Bai. Effects of Some Lattice Reductions on the Success Probability of the Zero-Forcing Decoder. IEEE Communications Letters. 20 (2016), 2031-2034.
Shi Bai, Adeline Langlois, Tancrède Lepoint, Damien Stehlé and Ron Steinfeld. Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance. Asiacrypt, 2015. (Best paper award).
Shi Bai, Richard Brent and Emmanuel Thomé. Root optimization of polynomials in the number field sieve. Mathematics of Computation. 84 (2015), 2447-2457.
Shi Bai and Steven Galbraith. An improved compression technique for signatures based on learning with errors. CT-RSA, 2014.
CADO-NFS, an implementation of the number field sieve algorithm for integer factorization.
FPLLL, an implementation of several lattice reduction algorithms.
Here are some integers factored by the general number field sieve and their parameters. Some are re-factored due to the lack of communication. I claim no originality for the factorization of those numbers and contributions should be made to those who first factored them. These numbers range from 140 to 212 decimal digits, it might be interested to see various parameters for these numbers.
Acknowledgement goes to Richard Brent, Paul Zimmermann for many suggestions,
Joshua Rich for help on the cluster, authors of "CADO-NFS", "Msieve", "Lasieve" for writing efficient software.
Thanks to MSI of ANU and NeSI of UoA for providing HPC facilities.
Some GNFS polynomials are collected here together with their actual and expected Murphy's E values. The expected values are computed by ignoring the o(1) in the number field sieve asymptotic complexity.