dc.contributor.author |
Dolgov D. |
|
dc.date.accessioned |
2018-09-19T22:10:54Z |
|
dc.date.available |
2018-09-19T22:10:54Z |
|
dc.date.issued |
2016 |
|
dc.identifier.issn |
1995-0802 |
|
dc.identifier.uri |
https://dspace.kpfu.ru/xmlui/handle/net/144824 |
|
dc.description.abstract |
© 2016, Pleiades Publishing, Ltd.Integer n is called pseudoprime (psp) relative to base a if n is composite, (a, n) = 1, and an−1 mod n = 1. Integer n is called strong pseudoprime (spsp) relative to base a if n is composite, (a, n) = 1, and, ad mod n = 1, or, ad2i mod n = −1, where n −1 = 2s * d, d is odd, 0 ≤ i < s. Pseudoprime and strong pseudoprime numbers are used in public-key cryptography in probabilistic tests. We use recurrent sequences in the task of search pseudoprime and strong pseudoprime numbers. This article describes acceleration of GCD calculation. |
|
dc.relation.ispartofseries |
Lobachevskii Journal of Mathematics |
|
dc.subject |
Euclidean algorithm |
|
dc.subject |
gcd |
|
dc.subject |
Pseudoprime integers |
|
dc.subject |
strong pseudoprime |
|
dc.subject |
Weber algorithm |
|
dc.title |
GCD calculation in the search task of pseudoprime and strong pseudoprime numbers |
|
dc.type |
Article |
|
dc.relation.ispartofseries-issue |
6 |
|
dc.relation.ispartofseries-volume |
37 |
|
dc.collection |
Публикации сотрудников КФУ |
|
dc.relation.startpage |
734 |
|
dc.source.id |
SCOPUS19950802-2016-37-6-SID84994537869 |
|