undefined | Better HN

0 pointsstjo6y ago0 comments

I would say no. 34 bytes is 256^32=7588550360256754183279148073529370729071901715047420004889892225542594864082845696 combinations, and even if you could easily narrow it down to only valid programs you would still need to simulate it, which is way slower than computing a hash.

0 comments

saagarjha6y ago

Only a fraction of those would be reasonable programs, and you can test almost all of them immediately by computing a MD5 hash.

userbinator6y ago

34 bytes is equivalent to bruteforcing a 272-bit key. It's already physically impossible to do that for a 256-bit key even if you ignore everything other than incrementing the key counter itself:

https://pthree.org/2016/06/19/the-physics-of-brute-force/

saagarjha6y ago

But as I said, you’re not brute forcing the entire key space because you likely have an idea of at least some of the bits.

janekm6y ago

Or, you could evaluate whether said program draws the crossed lines in an emulator. Might not take that much longer than calculating the hash... That makes this kind of an interesting "Genetic Programming" challenge... The solution space is "only" 29 bytes long...

IcePic6y ago

I don't think that would be this quick either. Since the code might/will mess up zeropage and/or other dataareas in use by the C64 basic, you would have to wipe it to a known state for each test, which almost means "boot up the KERNAL and let it run complete INIT".

Not that even this have to take a long while on a 3GHz computer running full speed, but doing it 2^272 times ...

1 more reply

j / k navigate · click thread line to collapse

0 comments

saagarjha6y ago

Only a fraction of those would be reasonable programs, and you can test almost all of them immediately by computing a MD5 hash.

userbinator6y ago

34 bytes is equivalent to bruteforcing a 272-bit key. It's already physically impossible to do that for a 256-bit key even if you ignore everything other than incrementing the key counter itself:

https://pthree.org/2016/06/19/the-physics-of-brute-force/

saagarjha6y ago

But as I said, you’re not brute forcing the entire key space because you likely have an idea of at least some of the bits.

janekm6y ago

IcePic6y ago

Not that even this have to take a long while on a 3GHz computer running full speed, but doing it 2^272 times ...

1 more reply

j / k navigate · click thread line to collapse