Open AccessRELIABILITY OF RSA ALGORITHM AND ITS COMPUTATIONAL COMPLEXITY
Author(s) -
Mykola Karpinskyy,
Yaroslav Kinakh
Publication year - 2014
Publication title -
international journal of computing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.184
H-Index - 11
eISSN - 2312-5381
pISSN - 1727-6209
DOI - 10.47839/ijc.2.3.241
Subject(s) - computer science , encryption , reliability (semiconductor) , algorithm , computational complexity theory , field (mathematics) , public key cryptography , simple (philosophy) , theoretical computer science , mathematics , computer security , power (physics) , philosophy , physics , epistemology , quantum mechanics , pure mathematics
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom