DocumentCode
3101642
Title
Can Integer Factorization be in P?
Author
Yan, Song Y. ; James, Glyn
Author_Institution
Inst. for Res. in Applicable Comput., Univ. of Bedfordshire, Luton
fYear
2006
fDate
Nov. 28 2006-Dec. 1 2006
Firstpage
266
Lastpage
266
Abstract
Can the integer factorization problem be solved in polynomial time? or is the RSA public-key cryptosystem breakable in polynomial time? Answers to these questions are not only important in mathematics but also important in network and information security. In this paper, a motivation for solving IFP from RSA will be introduced, and then some methods for IFP will be discussed. Finally, some ideas, comments and advice on the practical use of RSA will be presented.
Keywords
computational complexity; public key cryptography; information security; integer factorization; network security; polynomial time; public-key cryptosystem; Automatic control; Computational intelligence; Computational modeling; Gaussian processes; Information security; Intelligent agent; Mathematics; Polynomials; Public key cryptography; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Intelligence for Modelling, Control and Automation, 2006 and International Conference on Intelligent Agents, Web Technologies and Internet Commerce, International Conference on
Conference_Location
Sydney, NSW
Print_ISBN
0-7695-2731-0
Type
conf
DOI
10.1109/CIMCA.2006.62
Filename
4052871
Link To Document