From charlesreid1

Line 21: Line 21:
[[Puzzles/Crypto Level 1/Puzzle 8]] - OTP with generating token
[[Puzzles/Crypto Level 1/Puzzle 8]] - OTP with generating token


[[Puzzles/Crypto Level 1/Puzzle 9]] - Enigma
 
(Enigma?)


==Level 2==
==Level 2==

Revision as of 19:18, 15 September 2016

Crypto Puzzles

Level 1

Level 1 crypto puzzles:

Puzzles/Crypto Level 1/Puzzle 1 - Java encoded with Caesar cipher

Puzzles/Crypto Level 1/Puzzle 2 - Caesar cipher cryptograms with spaces

Puzzles/Crypto Level 1/Puzzle 3 - Caesar cipher cryptograms with no spaces (frequency or brute force)

Puzzles/Crypto Level 1/Puzzle 4 - Blocks of 8 integers, numbers -> letters -> message directly, filled in with DDDs

Puzzles/Crypto Level 1/Puzzle 5 - Blocks of 8 integers, numbers -> letters -> ROT 13 encoded message, filled with DDDs again

Puzzles/Crypto Level 1/Puzzle 6 - Affine cipher ax+b, gcd modular arithmetic

Puzzles/Crypto Level 1/Puzzle 7 - OTP - modular arithmetic, chunks of data, first line of novels as OTP keys.

Puzzles/Crypto Level 1/Puzzle 8 - OTP with generating token


(Enigma?)

Level 2

Level 2 crypto puzzles:

Puzzles/Crypto Level 2/Puzzle 1 - Java encoded with Caesar cipher

Puzzles/Crypto Level 2/Puzzle 2 - more Caesar cipher cryptograms, no spaces (frequency or brute force)

Puzzles/Crypto Level 2/Puzzle 3 - Caesar encoded with numbers in blocks of 8

Puzzles/Crypto Level 2/Puzzle 4 - Affine cipher, gcd, Euclid's algorithm

Puzzles/Crypto Level 2/Puzzle 5 - Modular arithmetic, multiplicative inverses, importance of prime modulus and factoring

Puzzles/Crypto Level 2/Puzzle 6 - Modular exponentiation, Fermat's Little Theorem, Euler's Theorem, relative prime

Puzzles/Crypto Level 2/Puzzle 7 - RSA baby steps

Puzzles/Crypto Level 2/Puzzle 8 - RSA bigger numbers

Puzzles/Crypto Level 2/Puzzle 9 - Finite fields - modular arithmetic with a different radix/base

Flags