Talk:Coppersmith's attack: Difference between revisions
No edit summary |
No edit summary |
||
Line 13: | Line 13: | ||
I updated the article to reflect this. [[Special:Contributions/2001:470:D08D:0:0:0:0:1|2001:470:D08D:0:0:0:0:1]] ([[User talk:2001:470:D08D:0:0:0:0:1|talk]]) 00:34, 6 July 2013 (UTC) |
I updated the article to reflect this. [[Special:Contributions/2001:470:D08D:0:0:0:0:1|2001:470:D08D:0:0:0:0:1]] ([[User talk:2001:470:D08D:0:0:0:0:1|talk]]) 00:34, 6 July 2013 (UTC) |
||
No, it's still wrong. You need *5* multiplications for 65537, and I don't know how to correctly calculate the number required for a random e of similar size. [[Special:Contributions/2001:470:D08D:0:0:0:0:1|2001:470:D08D:0:0:0:0:1]] ([[User talk:2001:470:D08D:0:0:0:0:1|talk]]) 18:46, 7 July 2013 (UTC) |
Revision as of 18:46, 7 July 2013
Cryptography: Computer science B‑class High‑importance | |||||||||||||
|
I think there's a mistake in Theorem 1 (Coppersmith): Instead of X = N^(1/4 - eps) for eps ≤ 0 I think it should be X = N^(1/d - eps) for eps ≥ 0
It says that using e = 2^16 + 1 takes only 17 multiplications as opposed to over 1000 when a random e of similar size is used; surely using successive squaring, a random e of similar size would only take at most 31 multiplications or thereabouts? Julian Gilbey (talk) 10:45, 4 October 2011 (UTC)
I updated the article to reflect this. 2001:470:D08D:0:0:0:0:1 (talk) 00:34, 6 July 2013 (UTC)
No, it's still wrong. You need *5* multiplications for 65537, and I don't know how to correctly calculate the number required for a random e of similar size. 2001:470:D08D:0:0:0:0:1 (talk) 18:46, 7 July 2013 (UTC)