|
Message-ID: <79B3E7308B4D4F6DBEF6B819B55C93D6@apple9d23c8f76> Date: Fri, 7 Feb 2014 10:29:05 +0100 From: "JohnyKrekan" <krekan@...nykrekan.com> To: <john-users@...ts.openwall.com> Subject: Re: questions about Incremental attack Hello, Thanx for information, I was only interested whether all this code is your idea, or have you taken some inspiration from some other books/papers about probability which could be informative for me. Nice day Jan Krekan ----- Original Message ----- From: "Solar Designer" <solar@...nwall.com> To: <john-users@...ts.openwall.com> Sent: Thursday, February 06, 2014 4:45 PM Subject: Re: [john-users] questions about Incremental attack > On Thu, Feb 06, 2014 at 10:29:39AM +0100, JohnyKrekan wrote: >> Hello, I would like to ask what mathematical principles are used in >> John's Incremental attack >> I use John to generate potential passwords for testing WPA PSK network's >> security. >> I have generated my own chr file from my wordlist and then use >> john -i=alpha --stdout >> (I replaced standard alpha with my own) >> to generate those candidates which are very useful. >> My questions are: >> 1. What mathematical method is used to generate the chr file from the >> wordlist? Where could I read more about that? > > I'm afraid the best place is charset.c in the source tree. It does have > some comments. > >> 2. What is the algorithm which is used to generate the potential >> candidates using this table? > > I'm afraid the best "description" is inc.c, especially inc_key_loop(). > It is not commented, but it is not very complicated. > > Alexander >
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.