1. Bach, E.: Explicit bounds for primality testing and related problems. Math. Comput. 55(191), 355–380 (1990)
2. Lecture Notes in Computer Science;J Bauch,2017
3. Bernard, O., Lesavourey, A., Nguyen, T.H., Roux-Langlois, A.: Log-S-unit lattices using Explicit Stickelberger Generators to solve Approx Ideal-SVP. Cryptology ePrint Archive, Report 2021/1384 (2021). https://ia.cr/2021/1384
4. Biasse, J.F., Erukulangara, M.R., Fieker, C., Hofmann, T., Youmans, W.: Mildly short vectors in ideals of cyclotomic fields without quantum computers. Math. Cryptol. 2(1), 84–107 (2022)
5. Biasse, J.F., Fieker, C., Hofmann, T., Page, A.: Norm relations and computational problems in number fields. J. Lond. Math. Soc. 105(4), 2373–2414 (2022)