Abstract
Currently, the best known algorithm for factoring RSA modulus is the General Number Field Sieve. Through the software optimized implementation of GNFS with RSA-768, we extracted nine main calculation components from the lattice sieve. Detail descriptions and comprehensive analysis of the properties about calculation, memory and communication to the nine components were given in this paper, which makes it possible to use of a variety of computing platforms, such as CPU, FPGA, CELL, and GPU etc, to accelerate the realization of GNFS.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.