2014•International Journal of ComputingOpen access

RELIABILITY OF RSA ALGORITHM AND ITS COMPUTATIONAL COMPLEXITY

Mykola Karpinskyy, Y I Kinakh

Open full text 0 citations

Abstract

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.

Open-access reader

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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)

Related papers

Back to paper searchBrowse research topicsOriginal source
RELIABILITY OF RSA ALGORITHM AND ITS COMPUTATIONAL COMPLEXITY — Research Paper | ScholarLens