Original title: The Description of the Program for Factorization of Large Numbers
Authors: Levek, Vladimír
Document type: Papers
Language: eng
Publisher: Vysoké učení technické v Brně, Fakulta elektrotechniky a komunikačních technologií
Abstract: 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.
Keywords: Cryptography; Factorization; Large Numbers; Order of magnitude; Prime number; RSA
Host item entry: Proceedings of the 22nd Conference STUDENT EEICT 2016, ISBN 978-80-214-5350-0

Institution: Brno University of Technology (web)
Document availability information: Fulltext is available in the Brno University of Technology Digital Library.
Original record: http://hdl.handle.net/11012/83954

Permalink: http://www.nusl.cz/ntk/nusl-383672


The record appears in these collections:
Universities and colleges > Public universities > Brno University of Technology
Conference materials > Papers
 Record created 2018-07-30, last modified 2021-08-22


No fulltext
  • Export as DC, NUŠL, RIS
  • Share