Feeling lucky?

[kgsws]

Well, this might not be really good way to crack kirk 7 keys, it still might work. Chance is getting bigger by number of users.
This is simple app that will try random keys on all kirk 7 outputs. Maybe someone will be lucky enough to find usefull key
There are 3 possible actions:
1) dump already found keys and exit (keyfind -d)
2) try to find keys in file (keyfind -f isolated.elf)
3) just random key generation (keyfind)

"keys.bin" is simple database, it contains already known keys from isolated module, "empty.bin" is empty and might be used for testing with "isolated.elf" (which is not included, of course).

It will be good if someone can make windows EXE so more users can try luck.

[Davee]

The probability of guessing a single key randomly is almost zero.

[Proxima]

With the use of rand() as coded, the chance is literally 0.

[kgsws]

I know it is very small chance, but what if

[AM new i guess]

so what this for and if we find idk the key or whatever ur talking bout what well happen?

[ultimakillz]

so what this for and if we find idk the key or whatever ur talking bout what well happen?

if you dont know, please don't comment. this topic is for security discussion only. if you dont understand, you would be able to help anyway, sorry.

[AM new i guess]

so what this for and if we find idk the key or whatever ur talking bout what well happen?

if you dont know, please don't comment. this topic is for security discussion only. if you dont understand, you would be able to help anyway, sorry.

oh wow just asking someone cant learn something new now a days?

[haslomaslo2]

How about doing it the sane way and setting up a BOINC project for this?

EDIT: An FPGA implementation might be possible as well.

[Davee]

How about doing it the sane way and setting up a BOINC project for this?

EDIT: An FPGA implementation might be possible as well.

The sane way is not doing it at all.
340282366920938463463374607431768211456

keys = 340282366920938463463374607431768211456
time = 31536000s (seconds in a year)
keys per second = 10790283070806014188970529154991.

^ That is for completing it in a year.

To complete in 1 million years, you need to test:
10790283070806014188970530 keys per second

Now, the known age of the universe is 13.75 billion years. That is 13750000000 years. So, in seconds that is 433620000000000000.
Now, lets say we were hanging around 13.75 years ago and decided to bruteforce the AES key for today we'd still need to be processing keys at...:

Spoiler

784747859694982850107 Keys per second.
That is, 784 quintillion, 747 quadrillion, 859 trillion, 694 billion, 982 million, 850 thousand and 107 keys per second.

Say you can get a device or a series of devices that collectively process 900 billion keys per second, you've only got to wait 11989203412006682433 years.

If you're feeling lucky, get a lottery ticket, you've got a lot more chance of winning that.

[kgsws]

That's right. But with random generation you might be very lucky and find one of keys.
If you have 1% chance to something, it does not mean that it will happen after 99 tries every time (but of course it can).