RELIABILITY OF RSA ALGORITHM AND ITS COMPUTATIONAL COMPLEXITY
Mykola Karpinskyy, Y I Kinakh
Abstract
Open-access reader
Mykola Karpinskyy, Y I Kinakh
Abstract
Open-access reader
This article deals with the RSA encryption algorithm. Its safety is analyzed using the number field sieve method. The algorithm work results allow to define a define a secret key in a simple way.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This article deals with the RSA encryption algorithm. Its safety is analyzed using the number field sieve method. The algorithm work results allow to define a define a secret key in a simple way.
Key concepts: Computer science, Encryption, Reliability (semiconductor), Algorithm, Computational complexity theory, Field (mathematics), Public-key cryptography, Simple (philosophy)