# 白石 (Shi Bai)

I am an assistant professor in the Department of Mathematical Sciences at Florida Atlantic University. I am also a faculty member in the Center for Cryptology and Information Security (CCIS). My research interests are in cryptography and computational number theory. My research is (and has been) supported by the NSF CAREER Award, by NIST grants, and by CyberFlorida capacity building grant.

### Bio

I have completed my PhD under the supervision of Prof. Richard Brent in the Algorithms & Data group at College of Engineering & Computer Science of the Australian National University. My PhD thesis is on Polynomial selection for the number field sieve. In 2012, I was an IT staff in the Mathematical Sciences Institute of ANU. In 2013-2014, I was a postdoctoral researcher at the University of Auckland, working with Prof. Steven Galbraith. In 2015-2016, I was a postdoctoral researcher at ENS Lyon, working with Prof. Damien Stehlé. In Fall 2016, I joined the Department of Mathematical Sciences at Florida Atlantic University as an assistant professor in cryptology.

### Program Committees

ACISP '18, ACISP '19, Asiacrypt '19, Asiacrypt '20, CFail '21, CT-RSA '20, CT-RSA '21, Indocrypt '18, Inscrypt '21, Latincrypt '17, MathCrypt '19, MathCrypt '21, PQCrypto '18, PQCrypto '19, ProvSec '20, ProvSec '21.

### Software

• CADO-NFS, an implementation of the number field sieve algorithm for integer factorization.

• FPLLL, an implementation of several lattice reduction algorithms.

### Integer factorization

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.

c142 in 3,678+ (re-factored)
c151 in 3,649-
c160 in 11,275- (re-factored)
c164 in 5,905L
c172 in 5,490+
c173 in Bernoulli(202) (with Bill Hart)
c177 in Bernoulli(226) (with Sam Wagstaff)
RSA180 (re-factored)
RSA190 (stopped at sieving)
c191 in 2,2090M (with Sam Wagstaff)
c191 in 2,2110M (with Sam Wagstaff)
c204 in Bernoulli(200)
RSA704 (report)
RSA220 (report)

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.

### Projections for GNFS polynomials

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.

Jörg Arndt - book "Matters Computational"
Richard Brent
Keith Matthews - Number Theory Web
Sam Wagstaff - the Cunningham project
Paul Zimmermann
Mersenne Forum
FLINT (fast library for number theory)

Email:
sbai AT fau.edu