THE DIFFI-HELLMANA PROTOCOL ON THE SET OF SINGULAR SIMPLE NUMBERS
DOI:
https://doi.org/10.18372/2310-5461.16.5216Keywords:
protocol of forming secret keys, simple numbers, singular simple numbersAbstract
Introduced the class of the singular prime numbers, based on which proposed the algorithm of significantly reduce computing time spent on the choice of suitable values for the Diffie–Hellman protocols.References
Diffe W. New Directions in Cryptography / W. Diffe, V. E. Hellman // IEEE Transact. On Information Theory, V. IT-22, no. 6, Nov, 1976. — Р. 644–654.
Лидл Р. Конечные поля / Р. Лидл, Г. Нидеррайтер. — Т. 1. — М. : Мир, 1988. — 432 с.
Василенко О. Н. Теоретико-числовые алгоритмы в криптографии / О. Н. Василенко. — M. : МЦНМО, 2003. — 328 c.
Гиндикин С. Г. Малая теорема Ферма // Квант / С. Г. Гиндикин. — 1972. — № 10.
Числа Кармайкла. — Электронный ресурс . — Режим доступа : Википедиа.
Downloads
Published
How to Cite
Issue
Section
License
The scientific journal adheres to the principles of Open Access and provides free, immediate, and permanent access to all published materials without financial, technical, or legal barriers for readers.
All articles are published in Open Access under the Creative Commons Attribution 4.0 International (CC BY 4.0) license.
Copyright
Authors who publish their works in the journal:
-
retain the copyright to their publications;
-
grant the journal the right of first publication of the article;
-
agree to the distribution of their materials under the CC BY 4.0 license;
-
have the right to reuse, archive, and distribute their works (including in institutional and subject repositories), provided that proper reference is made to the original publication in the journal.




