Shi Bai

Orcid: 0000-0002-0746-3054

Affiliations:
  • Florida Atlantic University, Department of Mathematical Sciences, USA


According to our database1, Shi Bai authored at least 25 papers between 2008 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
TINA: TMVP-Initiated Novel Accelerator for Lightweight Ring-LWE-Based PQC.
IEEE Trans. Very Large Scale Integr. Syst., May, 2024

Compact Encryption based on Module-NTRU problems.
IACR Cryptol. ePrint Arch., 2024

2023
Concrete Analysis of Quantum Lattice Enumeration.
IACR Cryptol. ePrint Arch., 2023

2022
Fiat-Shamir Signatures Based on Module-NTRU.
Proceedings of the Information Security and Privacy - 27th Australasian Conference, 2022

2020
MPSign: A Signature from Small-Secret Middle-Product Learning with Errors.
IACR Cryptol. ePrint Arch., 2020

Lattice Reduction with Approximate Enumeration Oracles: Practical Algorithms and Concrete Performance.
IACR Cryptol. ePrint Arch., 2020

Faster Enumeration-based Lattice Reduction: Root Hermite Factor k^(1/(2k)) in Time k^(k/8 + o(k)).
IACR Cryptol. ePrint Arch., 2020

Faster Enumeration-Based Lattice Reduction: Root Hermite Factor k<sup>1/(2k)</sup> Time k<sup>k/8+o(k)</sup>.
Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

2019
Improved Combinatorial Algorithms for the Inhomogeneous Short Integer Solution Problem.
J. Cryptol., 2019

A refined analysis of the cost for solving LWE via uSVP.
IACR Cryptol. ePrint Arch., 2019

Middle-Product Learning with Rounding Problem and its Applications.
IACR Cryptol. ePrint Arch., 2019

2018
Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather than the Statistical Distance.
J. Cryptol., 2018

Measuring, simulating and exploiting the head concavity phenomenon in BKZ.
IACR Cryptol. ePrint Arch., 2018

2016
Better polynomials for GNFS.
Math. Comput., 2016

Tuple lattice sieving.
LMS J. Comput. Math., 2016

Effects of Some Lattice Reductions on the Success Probability of the Zero-Forcing Decoder.
IEEE Commun. Lett., 2016

Improved Reduction from the Bounded Distance Decoding Problem to the Unique Shortest Vector Problem in Lattices.
IACR Cryptol. ePrint Arch., 2016

A subfield lattice attack on overstretched NTRU assumptions: Cryptanalysis of some FHE and Graded Encoding Schemes.
IACR Cryptol. ePrint Arch., 2016

2015
Root optimization of polynomials in the number field sieve.
Math. Comput., 2015

Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance.
IACR Cryptol. ePrint Arch., 2015

2014
Improved Exponential-time Algorithms for Inhomogeneous-SIS.
IACR Cryptol. ePrint Arch., 2014

2013
Lattice Decoding Attacks on Binary LWE.
IACR Cryptol. ePrint Arch., 2013

An improved compression technique for signatures based on learning with errors.
IACR Cryptol. ePrint Arch., 2013

2012
Factorisation of RSA-704 with CADO-NFS.
IACR Cryptol. ePrint Arch., 2012

2008
On the Efficiency of Pollard's Rho Method for Discrete Logarithms.
Proceedings of the Theory of Computing 2008. Proc. Fourteenth Computing: The Australasian Theory Symposium (CATS 2008), 2008


  Loading...