[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <CAFMma9MXk45aSUeE87Kp-7vDvUE0Ug4Mh+MTbH4VRAkH_ZY0Bw@mail.gmail.com>
Date: Fri, 16 Nov 2012 19:14:52 -0600
From: Richard Miles <richard.k.miles@...glemail.com>
To: john-users@...ts.openwall.com
Subject: Re: How does incremental mode works?
Hi Rich,
Thanks for your answer. Nice to know I'm not the only one that is unable to
understand how it works and the difference in a high level between
incremental and markov. :)
Maybe Solar or Simon may help us?
Thanks.
Best regards.
On Fri, Nov 16, 2012 at 3:22 PM, Rich Rumble <richrumble@...il.com> wrote:
> On Fri, Nov 16, 2012 at 4:12 PM, Richard Miles
> <richard.k.miles@...glemail.com> wrote:
> > I was reading it and other documentation but it's very complex. For a
> > non-math person or for someone that is not that technical, how could you
> > describe the difference between incremental and markov mode? My
> > understanding is that both use statistics and try better candidates not
> in
> > sequential mode. However I don't understand how they are different.
> I'd have no idea, Markov is hard for me to even attempt to use let
> alone understand, I've said as much before on this list. The simplest
> way to describe how they both work, is to statistically predict letter
> combinations to try, but how they conclude which letter are more
> likely is beyond me. I studied some CS in school, but was in over my
> head then, I've been meaning to look into Soundex/Double-Metaphone
> "indexed" words. It's a half-brained idea that probably won't pan out,
> but if I get time I'll try to flesh out at least a test of it, just to
> see if it can also "predict" likely words based on already cracked
> passes.
> > Thanks and sorry for dumb question.
> No such thing, just my stupid answers (see above)
> -rich
>
Powered by blists - more mailing lists
Confused about mailing lists and their use?
Read about mailing lists on Wikipedia
and check out these
guidelines on proper formatting of your messages.
