1. Bernstein, D.J., Heninger, N., Lou, P., Valenta, L., 2017. Post-quantum RSA, in: 8th International Workshop, PQCrypto2017, Springer. pp. 311–329.
2. Brandt, J., Damgård, I., 2003. On generation of probable primes by incremental search, in: Advances in Cryptology—CRYPTO’92: 12th Annual International Cryptology Conference, Santa Barbara, California, USA, August 16–20, 1992. Proceedings, Springer. p. 358.
3. Grosshans, F., Lawson, T., Morain, F., Smith, B., 2015. Factoring safe semiprimes with a single quantum query. arXiv:1511.04385.
4. Johnston, A.M., 2017. Shor’s algorithm and factoring: Don’t throw away the odd orders. Cryptology ePrint Archive, Report 2017/083.
5. Odd orders in Shor’s factoring algorithm;Lawson;Quantum Information Processing,2015