The Blömer-May’s weak key revisited
Blömer-May's attack is a notable cryptanalysis towards RSA cryptosystem, which can be viewed as an extension of the Wiener's attack such that focused on its generalized for of key equation. Note that the said attack can lead a polynomial time factorisation of modulus N via continued fracti...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Academy of Sciences Malaysia
2019
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/82363/1/The%20Bl%C3%B6mer-May%E2%80%99s%20weak%20key%20revisited%20.pdf http://psasir.upm.edu.my/id/eprint/82363/ https://www.akademisains.gov.my/asmsj/asm-sc-j-vol-12-special-issue-5-2019-for-icoaims2019/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Universiti Putra Malaysia |
| Language: | English |
| Summary: | Blömer-May's attack is a notable cryptanalysis towards RSA cryptosystem, which can be viewed as an extension of the Wiener's attack such that focused on its generalized for of key equation. Note that the said attack can lead a polynomial time factorisation of modulus N via continued fraction method. Later, the attack was reformulated to satisfies xy<N/(4(p+q)). In this paper, we propose an improved bound of Blömer-May's generalized key exponents that satisfies xy<(3(p+q)N)/(2((p-q)N^(1/4+(p+q)^2))). We show that our result is marginally better than the previous study. |
|---|