11.07.2014 Views

Cryptanalysis of RSA Factorization - Library(ISI Kolkata) - Indian ...

Cryptanalysis of RSA Factorization - Library(ISI Kolkata) - Indian ...

Cryptanalysis of RSA Factorization - Library(ISI Kolkata) - Indian ...

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

51 3.1 Our Basic Technique<br />

• For a fixed α, the value <strong>of</strong> γ decreases when τ increases, and<br />

• given a fixed τ, the value <strong>of</strong> γ increases as α increases.<br />

In Table 3.1, we present the numerical values <strong>of</strong> γ corresponding to α following<br />

Theorem 3.2 for three different values <strong>of</strong> τ, namely 1 4 , 1 2 and 3 4 .<br />

α 1 1.1 1.2 1.3 1.4 1.5 1.6 1.7 1.8 1.875<br />

τ = 1 4<br />

0.482 0.555 0.629 0.704 0.780 0.856 0.934 1.012 1.091 1.150<br />

τ = 1 2<br />

0.284 0.347 0.412 0.477 0.544 0.612 0.681 0.751 0.821 0.875<br />

τ = 3 4<br />

0.131 0.188 0.245 0.305 0.365 0.427 0.489 0.553 0.618 0.667<br />

Table 3.1: The numerical upper bounds <strong>of</strong> γ (in each cell) following Theorem 3.2,<br />

given different values <strong>of</strong> α and τ.<br />

In the work <strong>of</strong> [96], the value <strong>of</strong> τ has been taken as 1 . Thus we discuss some<br />

2<br />

cases when τ = 1 to highlight the improvements we achieve over [96]. Note that<br />

2<br />

for randomly chosen e with e < φ(N), the value <strong>of</strong> e will be O(N) in most <strong>of</strong> the<br />

cases. In such a case, putting α = 1 and τ = 1 , we get that γ < 0.284.<br />

2<br />

When α < 1 and τ = 1 , the bound on γ will decrease and it will become 0<br />

2<br />

at α = 1 . However, for randomly chosen e with e < φ(N), this will happen in<br />

2<br />

negligibly small proportion <strong>of</strong> cases.<br />

Most interestingly, the bound <strong>of</strong> γ will increase further beyond 0.284 when<br />

α > 1. Wiener’s attack [130] becomes ineffective when e > N 1.5 and the attack<br />

proposedbyBonehandDurfee[15]becomesineffectivewhene > N 1.875 . Similarto<br />

theresult<strong>of</strong>[15], equations<strong>of</strong>theformeX−ZY = 1cannotbeusedfore > N 1.875 ,<br />

since in such case no X will exist given the bound on Y. For τ = 1 , we have<br />

2<br />

presented the theoretical results for e reaching N 1.875 in Table 3.1. Experimental<br />

results will not reach this bound as we work with small lattice dimensions in<br />

practice, but even then the experimental results for e reach close to the value<br />

N 1.875 as we demonstrate results for N 1.774 in Section 3.2.3 for 1000-bit N.<br />

Note that here we present a theoretical estimate on the bound <strong>of</strong> γ. These<br />

bounds may not be achievable in practice due to the large lattice dimensions.<br />

However, the experimental results, presented in Sections 3.2.3, 3.3.1, are close to<br />

the theoretical estimates.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!