How many SSD's are sufficient? can anyone tell please? BR.
On Fri, Jun 17, 2011 at 6:00 AM, <a51-requ...@lists.reflextor.com> wrote: > Send A51 mailing list submissions to > a51@lists.reflextor.com > > To subscribe or unsubscribe via the World Wide Web, visit > http://lists.lists.reflextor.com/cgi-bin/mailman/listinfo/a51 > or, via email, send a message with subject or body 'help' to > a51-requ...@lists.reflextor.com > > You can reach the person managing the list at > a51-ow...@lists.reflextor.com > > When replying, please edit your Subject line so it is more specific > than "Re: Contents of A51 digest..." > > > Today's Topics: > > 1. time-consuming for the first cracking trial ( hunting ) > 2. Re: time-consuming for the first cracking trial (Joel Eriksson) > 3. Re: time-consuming for the first cracking trial (Karsten Nohl) > > > ---------------------------------------------------------------------- > > Message: 1 > Date: Fri, 17 Jun 2011 08:50:23 +0800 > From: " hunting " <hunt...@foxmail.com> > Subject: [A51] time-consuming for the first cracking trial > To: " a51 " <a51@lists.reflextor.com> > Message-ID: <tencent_036c199712da22c05255b...@qq.com> > Content-Type: text/plain; charset="iso-8859-1" > > Dear all: > > Recently, we do some experiments with the berlin tables and the kraken > code. The two graphic cards we use are of the type ATI HD 5670. To store the > rainbow table, the traditional HDDS type disk is adopted. We have done > several times of experiments. However, a phenomena which is described below > always appears and it semms so head-scratching. > > Each time we crack a new 114-bit stream, the time needed for table > looksup is always aobut three minutes, while for the same bit stream to be > cracked in the second, third, fourth, ... time, the task can be finshed > within 10 seconds (about 7~9 seconds) . Thus, when we want to crack a whole > 456-bit stream, we will consume about 12 minutes which is time-consuming and > is inefficient for most applications. > > Thus, I wonder why it always needs three minutes for the first time to > crack the 114-bit stream. Can this time be significantly reduced, for > example about 10 seconds just as the second or third trial? > > Wish all your help. > > Regards. > Lanma > -------------- next part -------------- > An HTML attachment was scrubbed... > URL: > http://lists.lists.reflextor.com/pipermail/a51/attachments/20110617/497fde77/attachment.html > > ------------------------------ > > Message: 2 > Date: Fri, 17 Jun 2011 11:10:46 +0200 > From: Joel Eriksson <joel.eriks...@gmail.com> > Subject: Re: [A51] time-consuming for the first cracking trial > To: hunting <hunt...@foxmail.com> > Cc: a51 <a51@lists.reflextor.com> > Message-ID: <banlktim7f0uljb_qv7rcerwmwwiy4jw...@mail.gmail.com> > Content-Type: text/plain; charset=ISO-8859-1 > > The reason that the second, third, fourth etc lookup is faster is that > all the 16320 required table lookups are already cached in memory. The > first time, it needs to read it from disk. If you get faster storage > (e.g SSD-disks), you will get much better results. > > -- > Best Regards, > Joel Eriksson > > On Fri, Jun 17, 2011 at 2:50 AM, hunting <hunt...@foxmail.com> wrote: > > Dear all: > > > > ??? Recently, we do some experiments with the berlin tables and the > kraken > > code. The two graphic cards we use?are of the type?ATI HD 5670. To?store > the > > rainbow table, the traditional HDDS type disk is adopted. We have done > > several times of experiments. However, a phenomena ?which is described > below > > always appears and it semms so?head-scratching. > > > > ?? Each time we crack?a new 114-bit stream, the time needed for table > > looksup?is always aobut three minutes, while for the same bit stream to > be > > cracked in the second, third, fourth, ... time,?the task?can be > > finshed?within 10 seconds (about 7~9 seconds) . Thus, when we want to > crack > > a whole 456-bit stream, we will consume about 12 minutes which is > > time-consuming and is inefficient for most applications. > > > > ?? Thus, I wonder why?it always needs three minutes for the first time to > > crack the 114-bit stream. Can this time be significantly reduced, for > > example about 10 seconds just as the second or third trial? > > > > ?? Wish all your help. > > > > Regards. > > ? Lanma > > _______________________________________________ > > A51 mailing list > > A51@lists.reflextor.com > > http://lists.lists.reflextor.com/cgi-bin/mailman/listinfo/a51 > > > > > > > > -- > Best Regards, > ? Joel Eriksson > > > ------------------------------ > > Message: 3 > Date: Fri, 17 Jun 2011 11:38:13 +0200 > From: Karsten Nohl <n...@virginia.edu> > Subject: Re: [A51] time-consuming for the first cracking trial > To: A51 List <a51@lists.reflextor.com> > Message-ID: <999dce29-cb7f-4bf0-923d-7eb44300c...@virginia.edu> > Content-Type: text/plain; charset=us-ascii > > Dear Lanma, > > Your performance is limited by the speed of your storage. Upgrade to fast > SSD disks and your should be able to get down to 10 seconds. > > Subsequent queries for the same key stream are cached and hence the storage > system performance bottleneck goes away. > > Cracking one 114bit segment is enough to decode the entire frame -- the key > is the same for all 456bits. > > Cheers, > > -Karsten > > On Jun 17, 2011, at 2:50 AM, hunting wrote: > > > Dear all: > > > > Recently, we do some experiments with the berlin tables and the > kraken code. The two graphic cards we use are of the type ATI HD 5670. To > store the rainbow table, the traditional HDDS type disk is adopted. We have > done several times of experiments. However, a phenomena which is described > below always appears and it semms so head-scratching. > > > > Each time we crack a new 114-bit stream, the time needed for table > looksup is always aobut three minutes, while for the same bit stream to be > cracked in the second, third, fourth, ... time, the task can be finshed > within 10 seconds (about 7~9 seconds) . Thus, when we want to crack a whole > 456-bit stream, we will consume about 12 minutes which is time-consuming and > is inefficient for most applications. > > > > Thus, I wonder why it always needs three minutes for the first time to > crack the 114-bit stream. Can this time be significantly reduced, for > example about 10 seconds just as the second or third trial? > > > > Wish all your help. > > > > Regards. > > Lanma > > _______________________________________________ > > A51 mailing list > > A51@lists.reflextor.com > > http://lists.lists.reflextor.com/cgi-bin/mailman/listinfo/a51 > > > > ------------------------------ > > _______________________________________________ > A51 mailing list > A51@lists.reflextor.com > http://lists.lists.reflextor.com/cgi-bin/mailman/listinfo/a51 > > > End of A51 Digest, Vol 25, Issue 1 > ********************************** > -- -Character is what u do, when u know no one is looking!-
_______________________________________________ A51 mailing list A51@lists.reflextor.com http://lists.lists.reflextor.com/cgi-bin/mailman/listinfo/a51
