KFU. Card publication. GCD calculation in the search task of pseudoprime and strong pseudoprime numbers

KAZAN
FEDERAL UNIVERSITY

- RUS
- 中文
- ES

GCD CALCULATION IN THE SEARCH TASK OF PSEUDOPRIME AND STRONG PSEUDOPRIME NUMBERS

Form of presentation

Articles in international journals and collections

Year of publication

2016

��

��

Authors, employees of KFU

Dolgov Dmitriy Aleksandrovich, author

Bibliographic description in the original language

Dolgov D., GCD calculation in the search task of pseudoprime and strong pseudoprime numbers//Lobachevskii Journal of Mathematics. - 2016. - Vol.37, Is.6. - P.734-739.

Keywords

Euclidean algorithm, Weber gcd, gcd, pseudoprime, strong pseudoprime

The name of the journal

Lobachevskii Journal of Mathematics

URL

https://www.scopus.com/inward/record.uri?eid=2-s2.0-84994537869&partnerID=40&md5=b00b5eaa06b89a89fe870bb7151ac804

Please use this ID to quote from or refer to the card

https://repository.kpfu.ru/eng/?p_id=148853&p_lang=2

Full metadata record

Field DC	Value	Language
dc.contributor.author	Dolgov Dmitriy Aleksandrovich	ru_RU
dc.date.accessioned	2016-01-01T00:00:00Z	ru_RU
dc.date.available	2016-01-01T00:00:00Z	ru_RU
dc.date.issued	2016	ru_RU
dc.identifier.citation	Dolgov D., GCD calculation in the search task of pseudoprime and strong pseudoprime numbers//Lobachevskii Journal of Mathematics. - 2016. - Vol.37, Is.6. - P.734-739.	ru_RU
dc.identifier.uri	https://repository.kpfu.ru/eng/?p_id=148853&p_lang=2	ru_RU
dc.description.abstract	Lobachevskii Journal of Mathematics	ru_RU
dc.language.iso	ru	ru_RU
dc.subject	Euclidean algorithm	ru_RU
dc.subject	Weber gcd	ru_RU
dc.subject	gcd	ru_RU
dc.subject	pseudoprime	ru_RU
dc.subject	strong pseudoprime	ru_RU
dc.title	GCD calculation in the search task of pseudoprime and strong pseudoprime numbers	ru_RU
dc.type	Articles in international journals and collections	ru_RU