Abstract
The object of the research is performance of integer factorization algorithms and possibility of mathematical methods using in these algorithms. The subject of the research is cryptographic properties GNFS method. Methods of research are methods of the theory of elliptic curves, finite fields, abstract algebra and advanced the theory of factorization algorithms. As a result of this work, the dependence of the properties of a minimal time of factorization and choice of algebraic factor bases over the ring Zn, where n=pq was established. Moreover, we have implemented the general number field sieve (GNFS), which is the most efficient classical algorithm known for factoring integers.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: WSEAS TRANSACTIONS ON INFORMATION SCIENCE AND APPLICATIONS
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.
