Live data from Hacker News

Passwordle

rsk0315.github.io

221–230 of 263 posts

Re: Passwordle

#221

Earlier quoted context omitted.

That sounds like Bitcoin with extra steps Jokes aside, that would actually be fun if the password is actually reasonably guess-able, I would definitely give it a try if that existed

Oh no, now someone will make wordlecoin, where you have to work with others sharing hints to mine each block.

Proof-of-Wordle

Re: Passwordle

#222
post #193

Earlier quoted context omitted.

so the puzzle author could "cheat" and just present a 256-bit number and not know the preimage at all, which would be a fun shortcut.

Huh, I realize I don’t know the answer to this seemingly simple question. Are all 256 bit vectors valid sha-256 hashes?

Yes.

In a secure hash function, all output bits are without bias. So all combinations exist.

Re: Passwordle

#223
post #166

Earlier quoted context omitted.

How does the first guess "peel off" 14 bits of entropy?

The digest is 64 characters long, so on average you should get 4 positions where your guess and the digest are the same, which would narrow it down to (1/16)*4 of the possibilities, corresponding to "peeling off" 16 bits of entropy. Figuring out how to enumerate only those values which generate a hex digest that matches the known characters in the hash is left as an exercise for the reader.

You may be trolling, but that "exercise for the reader" does not have a known solution. Anyone who found one may wish to keep it secret to get rich on Bitcoin mining...

Re: Passwordle

#224

There is like... four people I know I could send this to who'd laugh, it's so niche. Yet I also laughed out loud when I got how conventionally impossible it is.

It's not impossible. I hear Bruce Schneier got the correct hash on the first try.

https://www.schneierfacts.com/

(Sorry for the very HN:ish post, but I feel it's somewhat in the spirit of this story)

Re: Passwordle

#225

Earlier quoted context omitted.

You get a SHA256 hash of each guess. The hints you get on each guess are useless to help you with the next guess.

Nope. Try yourself with a, b, c, d, e, f, g as guesses. You will see that green letters that are coincident will be the same. So to reconstruct the original SHA256 of the password is easy. The problem then turns like every other hash -> password reconstruction: hard if the original secret is hard to guess via dictionary/brute-force, otherwise easy.

Ah, I misunderstood the point you were making. It's still true that each hash won't help you make the next password guess, but you can iteratively fill in parts of the overall hash.

I'm not sure that really helps you much though, as you don't have enough guesses to get the entire hash. And even with that, you may or may not succeed.

Still, good point!

Re: Passwordle

#226

Earlier quoted context omitted.

Nope. Try yourself with a, b, c, d, e, f, g as guesses. You will see that green letters that are coincident will be the same. So to reconstruct the original SHA256 of the password is easy. The problem then turns like every other hash -> password reconstruction: hard if the original secret is hard to guess via dictionary/brute-force, otherwise easy.

Ah, I misunderstood the point you were making. It's still true that each hash won't help you make the next password guess, but you can iteratively fill in parts of the overall hash. I'm not sure that really helps you much though, as you don't have enough guesses to get the entire hash. And even with that, you may or may not succeed. Still, good point!

Replying to self, if the password is based on a dictionary word, then it's much more doable, as you almost certainly don't need the entire hash. I think you made that point too...

Re: Passwordle

#227
post #222
post #193

Earlier quoted context omitted.

Huh, I realize I don’t know the answer to this seemingly simple question. Are all 256 bit vectors valid sha-256 hashes?

Yes. In a secure hash function, all output bits are without bias. So all combinations exist.

Sounds like the ideal. Can we prove that sha256 has this property?

Re: Passwordle

#229
post #47

Earlier quoted context omitted.

I wish it accepted a given password from a url query parameter, so this url would work: https://rsk0315.github.io/playground/passwordle.html?passwor... Or the way bikeshed.com lets you configure the color with the domain name, like: https://bisque.bikeshed.com/ Then they could monetize it by selling gullible suckers NFTs of urls pointing to Passwordle games of their passwords.

Even better would be to link to the hash of the password, then there would be no way to guess.

The point is that most people gullible enough to buy NFTs won't care about having their password in the URL. Those ignorant suckers are the same ones who complain that the government should step in and enforce their precious decentralized Libertarian "ownership" of their ape jpeg when somebody "steals" it with the "Save as..." menu. They fall for NFT scams for the same reason they fall for hunter2 password scams.

Re: Passwordle

#230
post #115
post #104

Earlier quoted context omitted.

If you can casually write an algorithm to break a modern cryptographic hash in 10 guesses... I would like to know. Because then I have to decide if I want to be a very good friend of you, once you get rich, or if I want to stay as far away from you as possible once the state intelligence agencies come after you.

It's not a cryptographic break. It's simply a regular password cracking algorithm, but with instead of knowing the full hash, you only know a partial hash. It should be viable, even without rainbow tables. That's why plain, unsalted sha256 is very unsafe for password storage.

It is not in the slightest bit viable. You’re seeking to reverse a one-way hash function. Knowing the full hash does not help you to find the original password; password cracking algorithms don’t work by reversing the hash, but by trying zillions of passwords, following typical human password patterns to increase the probability of success, and possibly using rainbow tables as precalculated hashess, until they find something that matches.
Post reply on HN