Talk:Birthday paradox: Difference between revisions
Jump to navigation
Jump to search
imported>Subpagination Bot m (Add {{subpages}} and remove checklist (details)) |
imported>Sandy Harris |
||
| Line 7: | Line 7: | ||
:I've just put your data into a table - have a look at how it's constructed. [[User:Anthony Argyriou|Anthony Argyriou]] 10:58, 22 July 2007 (CDT) | :I've just put your data into a table - have a look at how it's constructed. [[User:Anthony Argyriou|Anthony Argyriou]] 10:58, 22 July 2007 (CDT) | ||
::Thanks, it looks great.--[[User:David W Gillette|David W Gillette]] 15:45, 22 July 2007 (CDT) | ::Thanks, it looks great.--[[User:David W Gillette|David W Gillette]] 15:45, 22 July 2007 (CDT) | ||
== Is there a mathematician in the house? == | |||
I've just added an article [[birthday attack]] on a cryptographic application of the birthday paradox, with a link from here. | |||
Part of the text there is: "In general, for a cryptographic primitive of size n bits, the attack cost is 2<sup>n/2</sup>." That's a well-known rule among crypto folk; it's in the standard references and is used in government standards, see the last paragraph of [[birthday attack]]. However, I've never seen a proof and do not know if it is a theorem or just a handy approximation. Can anyone clarify this? [[User:Sandy Harris|Sandy Harris]] 13:32, 1 November 2008 (UTC) | |||
Revision as of 08:32, 1 November 2008
Table for data
Is there an easy way to put data, like in this article, into a table? --David W Gillette 14:55, 21 July 2007 (CDT)
- I've just put your data into a table - have a look at how it's constructed. Anthony Argyriou 10:58, 22 July 2007 (CDT)
- Thanks, it looks great.--David W Gillette 15:45, 22 July 2007 (CDT)
Is there a mathematician in the house?
I've just added an article birthday attack on a cryptographic application of the birthday paradox, with a link from here.
Part of the text there is: "In general, for a cryptographic primitive of size n bits, the attack cost is 2n/2." That's a well-known rule among crypto folk; it's in the standard references and is used in government standards, see the last paragraph of birthday attack. However, I've never seen a proof and do not know if it is a theorem or just a handy approximation. Can anyone clarify this? Sandy Harris 13:32, 1 November 2008 (UTC)