ScholarLens Back to search
2006•Unpublished venueRequires access

Can Integer Factorization be in P?

Song Yuan Yan, Glyn James

Open publisher page 3 citations

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

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

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.

Key concepts: Cryptosystem, Integer factorization, Factorization, Integer (computer science), Computer science, Key (lock), Public key cryptosystem, Polynomial

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Can Integer Factorization be in P? — Research Paper | ScholarLens