Zobrazit minimální záznam

dc.contributor.authorLevek, Vladimír
dc.date.accessioned2018-07-10T12:48:16Z
dc.date.available2018-07-10T12:48:16Z
dc.date.issued2016cs
dc.identifier.citationProceedings of the 22st Conference STUDENT EEICT 2016. s. 348-352. ISBN 978-80-214-5350-0cs
dc.identifier.isbn978-80-214-5350-0
dc.identifier.urihttp://hdl.handle.net/11012/83954
dc.description.abstractThe 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.en
dc.formattextcs
dc.format.extent348-352cs
dc.format.mimetypeapplication/pdfen
dc.language.isoencs
dc.publisherVysoké učení technické v Brně, Fakulta elektrotechniky a komunikačních technologiícs
dc.relation.ispartofProceedings of the 22st Conference STUDENT EEICT 2016en
dc.relation.urihttp://www.feec.vutbr.cz/EEICT/cs
dc.rights© Vysoké učení technické v Brně, Fakulta elektrotechniky a komunikačních technologiícs
dc.subjectCryptographyen
dc.subjectFactorizationen
dc.subjectRSAen
dc.subjectPrime numberen
dc.subjectLarge Numbersen
dc.subjectOrder of magnitudeen
dc.titleThe Description of the Program for Factorization of Large Numbersen
eprints.affiliatedInstitution.departmentFakulta elektrotechniky a komunikačních technologiícs
but.event.date28.04.2016cs
but.event.titleStudent EEICT 2016cs
dc.rights.accessopenAccessen
dc.type.driverconferenceObjecten
dc.type.statusPeer-revieweden
dc.type.versionPublishers's versionen


Soubory tohoto záznamu

Thumbnail

Tento záznam se objevuje v následujících kolekcích

Zobrazit minimální záznam