7月31日投IEEE Access，今天8月19日收到初审意见，4位评审都是Reject (update and resubmit encouraged)。
请问，重投录用的概率大吗？


4个审稿人意见如下：


Reviewer(s)' Comments to Author:

Reviewer: 1

Recommendation: Reject (update and resubmit encouraged)

Comments:
This paper presents a new idea of Integer Factorization based on Pisano period.
I think the idea is interesting. However, the claim that this can be used for RSA cracking is rather superficial. As we know, RSA security is not provably equivalent to factoring, so to break RSA, in fact we do not really have to go through integer factorization.
While this paper presents a new approach for integer factorization, the example provided is toy example. If the author provides with a large number of composite which can be somehow factorized with this method and not other means, then it would be more convincing.

In the recent years, there have been many advances in the effort to break RSA algorithm. All of the new references are missing in the manusript. Please check some papers in the recent conferences.

Additional Questions:
Does the paper contribute to the body of knowledge?: Yes

Is the paper technically sound?: Yes

Is the subject matter presented in a comprehensive manner?: Yes

Are the references provided applicable and sufficient?: Can be improved


Reviewer: 2

Recommendation: Reject (update and resubmit encouraged)

Comments:
An abstract should start with a brief overview of the topic.
A narration should be given without any numeration nor formula.
A comma should not be located prior to an and.
What is it? A pronounce should be limited to a special case of expression.
There are many extra spaces throughout the paper.
A symbol n has been used for several different variables. For instance, n should be reserved for the bit size of N only.
The author should maintain a consistent notation such as N = PQ.
… thereby transforming the NP problem into P problem. The authors have made an over claimed statement. No one has shown that IF on RSA is in fact an NPC problem.

A superscript notation should be adhered to. There is missing power of n in the Theorem 4. What is an r?
In Theorem 3, what is the power of s?
When ?0 = 0, {??(??? ?)} is considered to be purely constrained periodic 返回小木虫查看更多