Form of presentation | Articles in Russian journals and collections |
Year of publication | 2019 |
Язык | английский |
|
Ishmukhametov Shamil Talgatovich, author
|
|
Amer Ismail , author
|
Bibliographic description in the original language |
Ismail Amer. Analysis of the k-ary Euclid for tuples of integers / Ismail Amer, Sh. TIshmukhametov // Journal of Physics: Conf. Series. - 2019. - Vol. 1352. - P. 1-4. |
Annotation |
Journal of Physics: Conf. Series |
Keywords |
greatest common divisor, Eucledean Algorithm, k-ary GCD algorithm |
The name of the journal |
Journal of Physics: Conf. Series
|
On-line resource for training course |
http://dspace.kpfu.ru/xmlui/bitstream/handle/net/152005/Amer_2019_J._Phys.pdf?sequence=1&isAllowed=y
|
URL |
https://iopscience.iop.org/article/10.1088/1742-6596/1352/1/012001/pdf |
Please use this ID to quote from or refer to the card |
https://repository.kpfu.ru/eng/?p_id=214237&p_lang=2 |
Resource files | |
|
Full metadata record |
Field DC |
Value |
Language |
dc.contributor.author |
Ishmukhametov Shamil Talgatovich |
ru_RU |
dc.contributor.author |
Amer Ismail |
ru_RU |
dc.date.accessioned |
2019-01-01T00:00:00Z |
ru_RU |
dc.date.available |
2019-01-01T00:00:00Z |
ru_RU |
dc.date.issued |
2019 |
ru_RU |
dc.identifier.citation |
Ismail Amer. Analysis of the k-ary Euclid for tuples of integers / Ismail Amer, Sh. TIshmukhametov // Journal of Physics: Conf. Series. - 2019. - Vol. 1352. - P. 1-4. |
ru_RU |
dc.identifier.uri |
https://repository.kpfu.ru/eng/?p_id=214237&p_lang=2 |
ru_RU |
dc.description.abstract |
Journal of Physics: Conf. Series |
ru_RU |
dc.description.abstract |
In our paper we discuss the k-ary Euclid Algorithm for counting the great common divisor (GCD) of two or more integers and suggest some improvements. This gives us a possibility to parallelize and speed up the calculating of GCD, which has a variety of applications in the Number Theory, Modular Arithmetic and the Cryptography Algorithms such as RSA, ElGamal encryption system and others. |
ru_RU |
dc.language.iso |
ru |
ru_RU |
dc.subject |
greatest common divisor |
ru_RU |
dc.subject |
Eucledean Algorithm |
ru_RU |
dc.subject |
k-ary GCD algorithm |
ru_RU |
dc.title |
Analysis of the k-ary Euclid for tuples of integers |
ru_RU |
dc.type |
Articles in Russian journals and collections |
ru_RU |
|