a question about the random subgraph attack

From: BigWhiteMouse (dengyongze_at_hotmail-dot-com.no-spam.invalid)
Date: 03/29/05 

Date: 28 Mar 2005 19:37:45 -0600

Dr. David Wagner,
At the end of Section 5.8 Extracting the Key From a Single Red State ,
you wrote ,

>
>
> We thus have to probe the disk only once in each one of the t = 2^12
tables, and the total probing time is reduced to 24 seconds.
>
>

But I think we should probe the disk log(2^24)=24 times in each one of
the t = 2^12 tables, and the total probing time is reduced to 576
seconds, because I do not know what the index of the computed
end-point is in one table.

Best regard,
Posted at: http://www.groupsrv.com

 Posted Via Usenet.com Premium Usenet Newsgroup Services
----------------------------------------------------------
    ** SPEED ** RETENTION ** COMPLETION ** ANONYMITY **
----------------------------------------------------------
                http://www.usenet.com