Abstract
This paper analyzes the algorithm of general number field sieve and suggesting some ofits solving in the problem of larger integers factorization. And a design of its implementation via thelibrary GMP for polynomial selection is discussed. Our work has the advantages of easy extensionsto various applications such as RSA, Discrete logarithm problems, Primality testing and so on.
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.