|
Message-ID: <7ca8f2b3e1893ff11f8eb503d21eb947@smtp.hushmail.com> Date: Wed, 18 Aug 2021 17:21:28 +0200 From: magnum <john.magnum@...hmail.com> To: john-users@...ts.openwall.com Subject: Re: is it possible to run jumbo john 1.9 on multiple windows machines? On 2021-08-18 12:09, Harlock wrote: > Hi all, > > I 'm actually running this task on windows: > > john.exe --format=bitlocker-opencl > --mask=?d?d?d?d?d?d[-]?d?d?d?d?d?d[-]?d?d?d?d?d?d[-]?d?d?d?d?d?d[-]?d?d?d?d?d?d[-]?d?d?d?d?d?d[-]?d?d?d?d?d?d[-]?d?d?d?d?d?d > hash_to_crack.txt > > I read about the --node option and I was wondering if I can split the > work among multiple machines, if yes, can you please support me to > configure the process? Let's say you divide the work among 10 machines. On the first one you'd say --node=1/10, on the second you'd say --node=2/10 instead, and so on. Or you could divide it into work-pieces using the same option: Pick a huge node number such as 1000000, then have something keep track of which pieces are done and which are not. To attack piece number 42, the syntax is --node=42/1000000. Having said that, your task is impossible: The keyspace for 48 unknown digits is 1.0E+48 (ten to the power of 48). If you split the job among all GPU's in the entire world, it will *still* take way way *way* longer to crack (given average luck) than the time since last Big Bang. Winning the EuroJackpot five consecutive times in a row would be more likely (literally, unless I miscalculated it). Or put another way: Not even the first piece from the second example above, --node=1/1000000, would "ever" complete. magnum
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.