Latest revision as of 22:06, 17 March 2019

References

Nice collection of probability puzzles, solved with Python 3: https://github.com/BillCruise/Probability

handbook of applied cryptography: all chapters provided for free: http://cacr.uwaterloo.ca/hac/

@@ Line 1: / Line 1: @@
-=Fall 2016 Puzzles=
-The following cryptopuzzles follow a common format. See [[Puzzles/Crypto Puzzles]]
-Puzzles for Computer Science classes, fall 2016. These are primarily focused on simple-to-implement ciphers (Caesar, affine, OTP) and a little bit of game theory.
-[[Puzzles/Fall 2016/Puzzle 1]]: Hello POOKIE (Java encoded with Caesar cipher)
-[[Puzzles/Fall 2016/Puzzle 2]]: Et tu, brute? (Caesar cipher cryptograms with spaces)
-[[Puzzles/Fall 2016/Puzzle 3]]: Et three, brute? (Caesar cipher cryptograms with no spaces (frequency or brute force)
-[[Puzzles/Fall 2016/Puzzle 4]]: (Affine cipher, modular arithmetic, gcd, Euclid's algorithm)
-[[Puzzles/Fall 2016/Puzzle 5]]: Toga Party (Blocks of 8 integers, numbers -> letters -> message directly)
-[[Puzzles/Fall 2016/Puzzle 6]]: Game of Drones (Game theory with pairs of drones)
-[[Puzzles/Fall 2016/Puzzle 7]]: (OTP - modular arithmetic, chunks of data, first line of novels as OTP keys)
-[[Puzzles/Fall 2016/Puzzle 8]]: (OTP with generating token)
-[[Puzzles/Fall 2016/Puzzle 9]]: (Eddington and the Sand-Reckoner)
-[[Puzzles/Fall 2016/Puzzle 10]]: (Final Challenge Puzzle)
-=Old=
-Level 1 crypto puzzles: [[Puzzles/Crypto Level 1]]
-Level 2 crypto puzzles: [[Puzzles/Crypto Level 2]]
 =References=