the Algorithm for determining the secret key of the RSA encryption algorithm
Algorithm for determining the secret key of the RSA encryption algorithm
Keywords:
RSA, Euler's function, mathematical complexity, prime numbers, factorizationAbstract
This article proposes an algorithm for determining the secret key using the public key of the RSA encryption algorithm, which belongs to the group of asymmetric encryption algorithms. The effectiveness of the proposed algorithm depends on the complexity of dividing the interval (a, b) into smaller intervals as possible and determining the interval in which the sought numbers p and q are located. This algorithm differs in efficiency from many algorithms known to date.
References
Talbot, John and Dominic Welsh. Complexity and Cryptography. Cambridge: Cambridge University Press, 2006.
Rothe, Jörg. Complexity Theory and Cryptology. Berlin: Springer, 2005.
Diffie, W., Hellman, M.E. New directions in cryptography // IEEE Transactionson Information Theory, vol. IT-22, 1976. – Рр. 644-654.
Шнайер Б. Прикладная криптография. Протоколы, алгоритмы, исходные тексты на языке Си. –М.: издательство ТРИУМФ, 2003 - 816 с.
Венбо Мао. Современная криптография. Теория и практика. – Москва - Санкт-Петербург - Киев: Лори Вильямс, 2005.
Нильс Фергюсон, Брюс Шнайер. Практическая криптография –Москва: "Диалектика", 2004.
ElGamal T. On computing logarithm over finite fields // Advances in cryptology—CRYPTO‘85 (Santa Barbara, Calif., 1985). (Lect. Notes in Comput. Sci.; V. 218). – Рр. 396-402.
ElGamal T., A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms // IEEE Transactions on Information Theory, 1985, vol. IT-31. – Рp. 469-472.
Столлингс В. Криптография и защита сетей. Принципы и практика. Изд.:Лори Вильямс, 2001.
Молдовян А.А., Молдовян Н.А. Введение в криптосистемы с открытым ключом. Санкт – Петербург «БХВ-Петербург» 2005.
Additional Files
Published
How to Cite
License
Copyright (c) 2024 Ilhom Rahmatullayev, Ilxom Boyquziyev, O‘g‘iloy Axadova
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
