The Description of the Program for Factorization of Large Numbers
MetadataShow full item record
The article describes the algorithm for factorization of large numbers. If there is the result of the product of two prime numbers, then the program can find the factors. The first part of the article generally introduces the problem of factoring large integers and its impact in the field of the cryptography. The next part describes the algorithm and the program for calculation. At the end of the article there is a summary of the possibilities of the program.
Document typePeer reviewed
Document versionFinal PDF
SourceProceedings of the 22nd Conference STUDENT EEICT 2016. s. 348-352. ISBN 978-80-214-5350-0
- Student EEICT 2016