An Efficient Method of Factoring Integers

Abstract

At the beginning we introduce the most popular public-key cryptosystem called RSA and its application in real life With this cryptosystem there exists much more methods to crack it In this thesis we discuss one of these method in the following called general number field sieve which is also more efficient than others Since the idea of this method is come from Fermat we will introduce some history and compare what different between them Finally we introduce general number field sieve completing its details in practice and show an example by program

Date of Award	2014 Aug 14
Original language	English
Supervisor	Po-Yi Huang (Supervisor)