[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: Search through the string's space for find the target string whose m
From: |
Hongyi Zhao |
Subject: |
Re: Search through the string's space for find the target string whose md5sum matches the required condition. |
Date: |
Wed, 13 Oct 2021 10:29:45 +0800 |
On Tue, Oct 12, 2021 at 9:13 PM Emanuel Berg via Users list for the
GNU Emacs text editor <help-gnu-emacs@gnu.org> wrote:
>
> Hongyi Zhao wrote:
>
> > import re
> > from hashlib import md5
> > from string import ascii_uppercase
> >
> > alphabet_uppercase = ascii_uppercase
> > re_md5_str = re.compile(r"""^E903[A-F0-9]{3}
> > 4DAB[A-F0-9]{4}
> > 08[A-F0-9]{5}
> > 51[A-F0-9]
> > 80[A-F0-9]{2}
> > 8A[A-F0-9]""", re.X)
> >
> > for i in alphabet_uppercase:
> > i_str = 'TASC' + i
> > for j in alphabet_uppercase:
> > j_str = i_str + 'O3RJMV' + j
> > for k in alphabet_uppercase:
> > _str = j_str + 'WDJKX' + k + 'ZM'
> > md5_str = md5(_str.encode('utf-8')).hexdigest().upper()
> > if re_md5_str.match(md5_str):
> > print('string: ' + _str + '\n' + 'md5sum: ' + md5_str)
>
> Python ... ugly but efficient.
>
> Lisp ... wonderful but ... yeah, to some extent.
Bash based UNIX tool one line solution:
$ for i in TASC{A..Z}O3RJMV{A..Z}WDJKX{A..Z}ZM;
do
echo $i; echo -n $i | md5sum | cut -d ' ' -f1;
done | tr '[a-z]' '[A-Z]' |
egrep -m1 -B1
'E903[A-Z0-9]{3}4DAB[A-Z0-9]{4}08[A-Z0-9]{5}51[A-Z0-9]80[A-Z0-9]{2}8A[A-Z0-9]'
TASCJO3RJMVKWDJKXLZM
E9032994DABAC08080091151380478A2
> Now do it in Lisp and let's compare. But the biggest
> difference (aside for beauty) will be the time spent writing
> the code - an expert lisper and beginner/medium level Python
> programmer should spend a comparable amount of time :) - not
> time in execution.
>
> Then I include googling solutions ...
>
> The true expert does everything very rapidly. But who is
> a Lisp expert? I can think of one person on this list and it
> sure ain't me :)
>
> --
> underground experts united
> https://dataswamp.org/~incal