Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Wiener's famous attack on RSA with d < N0.25 shows that using a small d for an efficient decryption process makes RSA completely insecure. As an alternative, Wiener proposed to use the Chinese Remainder Theorem in the decryption phase, where dp = d mod (p - 1) and dq = d mod (q - 1) are chosen significantly smaller than p and q. The parameters dp, dq are called private CRT-exponents. Since Wiener's proposal in 1990, it has been a challenging open question whether there exists a polynomial time attack on small private CRT-exponents. ,  give an affirmative ansr to this question, and show that a polynomial time attack exists if dp and dq are smaller than N0.073.
['Ellen Jochemsz', 'Alexander May']
I am writing a research paper on a idea A polynomial time attack on RSA with private CRT-exponents smaller than N 0.073
[{"from": "human", "value": "I am writing a research paper on a idea A polynomial time attack on RSA with private CRT-exponents smaller than N 0.073"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Wiener's famous attack on RSA with d < N0.25 shows that using a small d for an efficient decryption process makes RSA completely insecure. As an alternative, Wiener proposed to use the Chinese Remainder Theorem in the decryption phase, where dp = d mod (p - 1) and dq = d mod (q - 1) are chosen significantly smaller than p and q. The parameters dp, dq are called private CRT-exponents. Since Wiener's proposal in 1990, it has been a challenging open question whether there exists a polynomial time attack on small private CRT-exponents. ,  give an affirmative ansr to this question, and show that a polynomial time attack exists if dp and dq are smaller than N0.073."}]