/prog/ - PROG CHALLENGE <EASY>

Name: Anonymous 2013-01-20 4:16

Find the mathematical backdoor in AES

Due date: 2/1/2013

Name: Anonymous 2013-01-20 4:21

http://en.wikipedia.org/wiki/Advanced_Encryption_Standard#Security

Name: Anonymous 2013-01-20 6:58

http://www.w3.org/TR/NOTE-datetime

Name: Anonymous 2013-01-20 16:35

>>1
>mathematics

OP is a jew

Name: Anonymous 2013-01-20 16:38

>>4
fuck off back to the ima/g/e/b/oards unfunny fagshit

Name: Anonymous 2013-01-20 17:05

>>1
2/1/2013 was 18 days ago

Name: Anonymous 2013-01-20 18:58

>>6
eurofagshit

Name: Anonymous 2013-01-20 20:13

>>7
You mean every single fucking country in the world, except the USA and a couple of nigger countries?

Name: Anonymous 2013-01-20 20:38

>>8
``faggot''

Name: Anonymous 2013-01-20 21:22

>>1 i had a quick look, certainly didn't 'break' it, but I would focus on finding any weakness in the MixColumn step first...

Name: Anonymous 2013-01-20 21:30

+ I don't really like how almost all of it is built using 'Const' look-up tables... Only the XOR part has any real variability, and even then, it's key schedule is reusing those look-up tables once again... (ie it really is asking to be broken, if it hasn't already..)

Name: Anonymous 2013-01-21 3:38

>>7,9 -> >>3

>>10-11
You should begin by reading a book about cryptography.

Name: Anonymous 2013-01-21 3:42

>>12 probably, but that just ain't my style ;)

Name: Anonymous 2013-01-21 3:54

Not that i'd expect to be able to break it anytime soon... or even at all..

Name: Anonymous 2013-01-21 4:10

What comes next? TripleAES256 -- a whole 768 bits of AES256 goodness? Or some faggoty new algorithm?

Name: Anonymous 2013-01-21 6:11

I can easily break AES using the power of [i][b]QUANTUM COMPUTING[b][i]

Name: Anonymous 2013-01-21 10:35

Goyim can't into cryptography.

Name: Anonymous 2013-01-21 10:50

>>16
Now I'm wondering. Is there any (theoretical) quantum-computing-safe encryption standard? Can something like that even exist?

Name: Anonymous 2013-01-21 11:25

>>18
A encryption method that uses quantum computing. Duh.

Name: Anonymous 2013-01-21 12:14

>>16
No you can't.

>>16,18-19
Morons.

Name: Anonymous 2013-01-21 12:16

>>19
Haha! Forget that last comment. I'm going back to reddit.

Name: sage 2013-01-21 12:23

>>18
Yeah, look for "The code book" by simon singh, it's a bestselling paperback pocket often found in airport kiosks. It explains the uncrackable quantum crypto.

Name: Anonymous 2013-01-21 12:35

It has been proven that applying Grover's algorithm to break a symmetric (secret key) algorithm by brute force requires time equal to roughly 2n/2 invocations of the underlying cryptographic algorithm, compared with roughly 2n in the classical case,[15] meaning that symmetric key lengths are effectively halved: AES-256 would have the same security against an attack using Grover's algorithm that AES-128 has against classical brute-force search (see Key size). Quantum cryptography could potentially fulfill some of the functions of public key cryptography.

PROG CHALLENGE <EASY>

1 Name: Anonymous 2013-01-20 4:16

2 Name: Anonymous 2013-01-20 4:21

3 Name: Anonymous 2013-01-20 6:58

4 Name: Anonymous 2013-01-20 16:35

5 Name: Anonymous 2013-01-20 16:38

6 Name: Anonymous 2013-01-20 17:05

7 Name: Anonymous 2013-01-20 18:58

8 Name: Anonymous 2013-01-20 20:13

9 Name: Anonymous 2013-01-20 20:38

10 Name: Anonymous 2013-01-20 21:22

11 Name: Anonymous 2013-01-20 21:30

12 Name: Anonymous 2013-01-21 3:38

13 Name: Anonymous 2013-01-21 3:42

14 Name: Anonymous 2013-01-21 3:54

15 Name: Anonymous 2013-01-21 4:10

16 Name: Anonymous 2013-01-21 6:11

17 Name: Anonymous 2013-01-21 10:35

18 Name: Anonymous 2013-01-21 10:50

19 Name: Anonymous 2013-01-21 11:25

20 Name: Anonymous 2013-01-21 12:14

21 Name: Anonymous 2013-01-21 12:16

22 Name: sage 2013-01-21 12:23

23 Name: Anonymous 2013-01-21 12:35