[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <CAKDRQS6A2-fv+1NdGc7hROQMynuSYY69rkC42zpF5KW7DMpUKQ@mail.gmail.com>
Date: Thu, 9 Nov 2023 21:16:31 +0000
From: Jimmy Yuen Ho Wong <wyuenho@...il.com>
To: john-users@...ts.openwall.com
Subject: Re: 1password memorable passwords
On Thu, Nov 9, 2023 at 5:18 PM magnum <magnumripper@...hmail.com> wrote:
>
> A rainbow table is something vastly different and the term should not be
> misused. You are merely compiling a wordlist!
>
>
You are right. Thank you for the reminder.
For a slow mode such as DMG, a trivial perl script is probably just fine
> (you may even be able to find similar such scripts in this list's
> archives). We have a PRINCE cracking mode that could almost do what you
> need with the 18K words list as input. But it lacks support for putting
> the hyphens inbetween words, and if we try to work around that by
> appending a hyphen to each input word, we instead hit the max length
> limit (would need 35 for 4*8+3 while max for PRINCE is 32).
>
> Or you could persuade someone to fix
> https://github.com/openwall/john/issues/2268 (which would also fix
> https://github.com/hashcat/princeprocessor/issues/49) - that would solve
> the problem canonically and it should actually be pretty trivial. Alas,
> I do not have time for it.
>
> In case you write or find a script/tool that outputs the candidates to
> stdout, you'll just pipe it like this:
>
> some_tool | ./john dmghash.txt -stdin
>
>
That's what I'm doing now with a simple Rust program generating 3 word
combos. I'm only hitting around 1300 tries per second with
--format=dmg-opencl on my MBP M1 Pro 32GB, does that sound about right? How
many more tries can I get if I rent a beefier machine on the cloud?
Thanks
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.
