Показать сокращенную информацию
dc.contributor.author | Boiko A. | |
dc.contributor.author | Ziyatdinov D. | |
dc.contributor.author | Ishmukhametov S. | |
dc.date.accessioned | 2018-09-18T20:16:53Z | |
dc.date.available | 2018-09-18T20:16:53Z | |
dc.date.issued | 2011 | |
dc.identifier.issn | 1066-369X | |
dc.identifier.uri | https://dspace.kpfu.ru/xmlui/handle/net/138252 | |
dc.description.abstract | Factorization of positive integers into primes is a hard computational task. Its complexity lies in the base of the most popular method of cryptography, the RSA method. In this paper we propose a new technique in a factorization procedure which combines ideas of the Number Field Sieve (NFS) and the Quadratic Sieve (QS) in a special manner. © Allerton Press, Inc., 2011. | |
dc.relation.ispartofseries | Russian Mathematics | |
dc.subject | Factorization | |
dc.subject | NFS | |
dc.subject | Number field sieve | |
dc.subject | QS | |
dc.subject | Quadratic sieve | |
dc.title | One approach to factorization of positive integers | |
dc.type | Article | |
dc.relation.ispartofseries-issue | 4 | |
dc.relation.ispartofseries-volume | 55 | |
dc.collection | Публикации сотрудников КФУ | |
dc.relation.startpage | 12 | |
dc.source.id | SCOPUS1066369X-2011-55-4-SID79958763390 |