Specialized processors for distribution of secret keys based on recurrent sequences
Abstract
The paper presents principles of specialized processors for distribution of secret keys via an open communication channel based on recurrent sequences. We estimated the time required for the developed processors. A speed comparison of the developed processors with the known analogues showed that under certain conditions, they can provide a significantly lower computational complexity for each user.References
1. Menezes A. J. Handbook of Applied Cryptography / A. J. Menezes, van P. C. Oorschot, S. A. Vanstone. — CRC Press, 2001. — 816 p.
2. Diffie W. New directions in cryptography / W. Diffie, M. E. Hellman // IEEE Transactions on Information Theory. — 1976. — No 22, — Р. 644—654.
3. Smith P. A public-key cryptosystem and a digital signature system based on the Lucas function analogue to discrete logarithms / P. Smith and C. Skinner // In Advances in Cryptology Asiacrypt ’94, Springer-Verlag. — 1995. — P. 357—364.
4. Bleichenbacher D. Some remarks on Lucas-based cryptosystems / D. Bleichenbacher, W. Bosma, and A. Lenstra // In Advances in Cryptology Crypto ’95, Springer-Verlag. — 1995. — P. 386—396.
5. Smart N. The Discrete Problem on Elliptic Curves of Trace One / N. Smart // Journal of Cryptology. — 1999. — No 12.
P. 29—34.
6. Ростовцев А. Г. Подпись и шифрование на эллиптической кривой: анализ безопасности и безопасная реализация / А. Г. Ростовцев, Е. Б. Маховенко // Проблемы информационной безопасности. Компьютерные системы. — 2003. — № 1. — С. 64—73.
7. Яремчук Ю. Є. Використання рекурентних послідовностей для побудови криптографічних методів з відкритим ключем / Ю. Є. Яремчук // Захист інформації. — 2012. — № 4. — С. 120—127.
2. Diffie W. New directions in cryptography / W. Diffie, M. E. Hellman // IEEE Transactions on Information Theory. — 1976. — No 22, — Р. 644—654.
3. Smith P. A public-key cryptosystem and a digital signature system based on the Lucas function analogue to discrete logarithms / P. Smith and C. Skinner // In Advances in Cryptology Asiacrypt ’94, Springer-Verlag. — 1995. — P. 357—364.
4. Bleichenbacher D. Some remarks on Lucas-based cryptosystems / D. Bleichenbacher, W. Bosma, and A. Lenstra // In Advances in Cryptology Crypto ’95, Springer-Verlag. — 1995. — P. 386—396.
5. Smart N. The Discrete Problem on Elliptic Curves of Trace One / N. Smart // Journal of Cryptology. — 1999. — No 12.
P. 29—34.
6. Ростовцев А. Г. Подпись и шифрование на эллиптической кривой: анализ безопасности и безопасная реализация / А. Г. Ростовцев, Е. Б. Маховенко // Проблемы информационной безопасности. Компьютерные системы. — 2003. — № 1. — С. 64—73.
7. Яремчук Ю. Є. Використання рекурентних послідовностей для побудови криптографічних методів з відкритим ключем / Ю. Є. Яремчук // Захист інформації. — 2012. — № 4. — С. 120—127.
Downloads
-
PDF (Українська)
Downloads: 66
Abstract views: 100
How to Cite
[1]
Y. Y. Yaremchuk, “Specialized processors for distribution of secret keys based on recurrent sequences”, Вісник ВПІ, no. 1, pp. 123–127, Mar. 2013.
Issue
Section
Information technologies and computer sciences
License
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
