Simple Lua based Encryption and Decryption (Developers)

[NickL]

Well, If someone uses a 10 digit password for 256 AES encryption it willl be cracked by my non-existant maciene in less than 1/2 of a second.

[Zaubermuffin]

Non-existant is a pretty good term for that. My non-existant machine solves it immediately.

[TGiFallen]

[QUOTE=NickL;31506957]Well, If someone uses a 10 digit password for 256 AES encryption it willl be cracked by my non-existant maciene in less than 1/2 of a second.[/QUOTE]

look at it this way,
There are 2^256 possible combinations for a 256 bit key
2^256 = 1.1579208923731619542357098500869e+77 (that's 77 zeros after the 1)
now say we had a supercomputer that could do 1 trillion combinations per second

1.1579208923731619542357098500869e+77 / 1 000 000 000 000 = 1.1579208923731619542357098500869e+65
that's how many seconds it would take

divide by 60 for minutes: 1.1579208923731619542357098500869e+65 / 60 = 1.9298681539552699237261830834781e+63

divide by 60 for hours 1.9298681539552699237261830834781e+63 / 60 = 3.2164469232587832062103051391302e+61

divide by 24 for days 3.2164469232587832062103051391302e+61 / 24 = 1.3401862180244930025876271413043e+60

divide by 7 for weeks 1.3401862180244930025876271413043e+60 / 7 = 1.9145517400349900036966102018632e+59

divide by 52 for years 1.9145517400349900036966102018632e+59 / 52 = 1.9145517400349900036966102018632e+59

In conclusion it would still take 1.9145517400349900036966102018632e+59 (that's 59 zero's after the 1) years to crack that.

If my math is flawed please someone point it out.

[editline]3rd August 2011[/editline]

Still in doubt? look at the first table on wikipedia. [URL="http://en.wikipedia.org/wiki/Brute-force_attack"]http://en.wikipedia.org/wiki/Brute-force_attack[/URL]

[Radapalf]

To take full advantage of AES's security you need a 64 character password.

[NickL]

[QUOTE=Zaubermuffin;31507123]Non-existant is a pretty good term for that. My non-existant machine solves it immediately.[/QUOTE]
Mine is actually possible though.