loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (CIMCA'06)
Can Integer Factorization be in P?
Sydney Australia
November 28-December 01
ISBN: 0-7695-2731-0
ASCII Text
x 
 
Song Y Yan, Glyn James, "Can Integer Factorization be in P?," Computational Intelligence for Modelling, Control and Automation, International Conference on, pp. 266, International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (CIMCA'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/CIMCA.2006.62,
author = {Song Y Yan and Glyn James},
title = {Can Integer Factorization be in P?},
journal ={Computational Intelligence for Modelling, Control and Automation, International Conference on},
volume = {0},
year = {2006},
isbn = {0-7695-2731-0},
pages = {266},
doi = {http://doi.ieeecomputersociety.org/10.1109/CIMCA.2006.62},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Computational Intelligence for Modelling, Control and Automation, International Conference on
TI - Can Integer Factorization be in P?
SN - 0-7695-2731-0
SP
EP
A1 - Song Y Yan,
A1 - Glyn James,
PY - 2006
KW - null
VL - 0
JA - Computational Intelligence for Modelling, Control and Automation, International Conference on
ER -
 
Song Y Yan, University of Bedfordshire, Park Square Luton LU1 3JU, UK
Glyn James, Coventry University, Coventry CV1 5FB, UK
Can the integer factorization problem be solved in poly- nomial time? or is the RSA public-key cryptosystem breakable in polynomial time? Answers to these ques- tions 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 dis- cussed. Finally, some ideas, comments and advice on the practical use of RSA will be presented.
Citation:
Song Y Yan, Glyn James, "Can Integer Factorization be in P?," cimca, pp.266, International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (CIMCA'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.