Publication detail
THE DESCRIPTION OF THE PROGRAM FOR FACTORIZATION OF LARGE NUMBERS
LEVEK, V. ŠTEFFAN, P.
Original Title
THE DESCRIPTION OF THE PROGRAM FOR FACTORIZATION OF LARGE NUMBERS
English Title
THE DESCRIPTION OF THE PROGRAM FOR FACTORIZATION OF LARGE NUMBERS
Type
conference paper
Language
en
Original 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.
English 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, RSA, Prime number, Large Numbers, Order of magnitude
Released
28.04.2016
Publisher
Vysoké učení technické v Brně, Fakulta elektrotechniky a komunikačních
Location
Brno
ISBN
978-80-214-5350-0
Book
Proceedings of the 22nd Conference STUDENT EEICT 2016
Edition number
1
Pages from
348
Pages to
352
Pages count
5
URL
Documents
BibTex
@inproceedings{BUT124940,
author="Vladimír {Levek} and Pavel {Šteffan}",
title="THE DESCRIPTION OF THE PROGRAM FOR FACTORIZATION OF LARGE NUMBERS",
annote="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.",
address="Vysoké učení technické v Brně, Fakulta elektrotechniky a komunikačních",
booktitle="Proceedings of the 22nd Conference STUDENT EEICT 2016",
chapter="124940",
howpublished="online",
institution="Vysoké učení technické v Brně, Fakulta elektrotechniky a komunikačních",
year="2016",
month="april",
pages="348--352",
publisher="Vysoké učení technické v Brně, Fakulta elektrotechniky a komunikačních",
type="conference paper"
}