<<  >> (p.13)
    Author Topic: This message was too old and has been purged  (Read 50835 times)
    jaesyn
    Newbie
    *
    Offline

    Activity: 10
    Merit: 1


    View Profile
    February 04, 2014, 02:03:12 AM
     #241

    I think you got it.  That is my understanding also.

    Assuming for now 240 known keypairs all we need is an estimate for the average comparison time given that some of them will be a short quick comparison as you suggested and others will be very long, having to do full comparisons.

    Then we can easily calculate how long, on average, to crack a key pair.
    Is the assumption here is that you can find 240 keypairs all with the same lower 32-bits to use in a rainbow table? I think that task alone is equivalent to O(N).

Page 12
Viewing Page: 13