Author:
Verma Prashant,Sharma Kapil
Reference25 articles.
1. Wang, Q., Fan, X., Zang, H., Wang, Y.: The space complexity analysis in the general NFS integer factorization. Theor. Comput. Sci. 630, 76–94, (2016). ISSN: 0304–3975, https://doi.org/10.1016/j.tcs.2016.03.028
2. Sengupta, B., Das, A.: Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms. IACR Cryptol. 44 (2015)
3. Intel Corp.: Technical Report. https://en.wikipedia.org/wiki/Lanczos algorithm (2009)
4. Giorgi, P., Lebreton, R.: Online order basis algorithm and its impact on the block Wiedemann algorithm. In: Proceedings of 39th International Symposium on Symbolic and Algebraic Computation (ISSAC’14), pp. 202–209. ACM (2014)
5. Huang, A.G.: Parallel Block Wiedemann-Based GNFS Algorithm for Integer Factorization. Master thesis, St. Francis Xavier University, Canada (2010)