Puzzles: Difference between revisions
From charlesreid1
| Line 37: | Line 37: | ||
[[Puzzles/Crypto Level 2/Puzzle 5]] - Modular exponentiation, Fermat's Little Theorem, Euler's Theorem, relative prime | [[Puzzles/Crypto Level 2/Puzzle 5]] - Modular exponentiation, Fermat's Little Theorem, Euler's Theorem, relative prime | ||
[[Puzzles/Crypto Level 2/Puzzle 6]] - | [[Puzzles/Crypto Level 2/Puzzle 6]] - More advanced modular exponentiation | ||
[[Puzzles/Crypto Level 2/Puzzle 7]] - | [[Puzzles/Crypto Level 2/Puzzle 7]] - RSA baby steps | ||
[[Puzzles/Crypto Level 2/Puzzle 8]] - | [[Puzzles/Crypto Level 2/Puzzle 8]] - RSA bigger numbers | ||
[[Puzzles/Crypto Level 2/Puzzle 9]] - | [[Puzzles/Crypto Level 2/Puzzle 9]] - Finite fields - modular arithmetic with a different radix/base | ||
=Flags= | =Flags= | ||
Revision as of 09:00, 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 - more Caesar cipher cryptograms, with spaces
Puzzles/Crypto Level 1/Puzzle 3 - Caesar cipher cryptograms, no spaces (frequency or brute force)
Puzzles/Crypto Level 1/Puzzle 4 - blocks of 8 digit integers, rot 13, filled in with z's
Puzzles/Crypto Level 1/Puzzle 5 - blocks of 8 digit integers, rot non-13, filled in with z's
Puzzles/Crypto Level 1/Puzzle 6 - Affine cipher
Puzzles/Crypto Level 1/Puzzle 7 - Affine cipher
Puzzles/Crypto Level 1/Puzzle 8 - OTP
Puzzles/Crypto Level 1/Puzzle 9 - OTP with generating token
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 - Affine cipher, gcd, Euclid's algorithm
Puzzles/Crypto Level 2/Puzzle 4 - Modular arithmetic, multiplicative inverses, importance of prime modulus and factoring
Puzzles/Crypto Level 2/Puzzle 5 - Modular exponentiation, Fermat's Little Theorem, Euler's Theorem, relative prime
Puzzles/Crypto Level 2/Puzzle 6 - More advanced modular exponentiation
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
| Puzzles charlesreid1.com wiki puzzles
Josephus Problem
Category:Puzzles · Category:Programming · Flags · Template:PuzzleFlag · e |