DocumentCode :
2349099
Title :
Reliability of RSA algorithm and its computational complexity
Author :
Karpinskyy, Mykola ; Kinakh, Yaroslav
Author_Institution :
Universytet Bjelsku-Bjala
fYear :
2003
fDate :
8-10 Sept. 2003
Firstpage :
494
Lastpage :
496
Abstract :
We deal with the RSA encryption algorithm. Its safety is analyzed using the number field sieve method. The algorithm work results allow to define a secret key in a simple way
Keywords :
computational complexity; computer networks; cryptography; RSA encryption algorithm; computational complexity; computer network; factorization; number field sieve method; secret key; Computational complexity; Computer networks; Computer security; Credit cards; Cryptography; Electronic mail; Information security; Information technology; National security; Safety;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications, 2003. Proceedings of the Second IEEE International Workshop on
Conference_Location :
Lviv
Print_ISBN :
0-7803-8138-6
Type :
conf
DOI :
10.1109/IDAACS.2003.1249613
Filename :
1249613
Link To Document :
بازگشت