FTS-100: Secrets, Secret Codes, and Privacy
Fall 2005

Reading and class schedule	Project	FTS-100  homepage
Homework	Short writing assignments	Course description
Homework guidelines	Criteria for grading writing	kaiser@gustavus.edu

Reading  and homework assignments, Sept. 8- Oct. 22
This page was last modified on 10/17/05

Date:	Preparation:	Topic:	Hand in:
9/8	Read the syllabus, be ready to introduce classmate	Introductions, Lassi, Syllabus, Secrets
9/9		Problem solving strategies
9/12		Library tour (meet in library)
9/13	Flannery, chapters 1 &2	Problem solving
9/15	Barr, section1.1	Overview of coding methods	Secrets paper
9/16		Binary numbers
9/19		Finish 1.1	Hw 1 due
9/20		Lassi, writing
9/22	Barr, section 1.2; Flannery, chapters 3 &4	Functions
9/23	Flannery, chapter 6 Barr, section 2.1	Modular arithmetic
9/26		Paul Saulnier, intro to Nobel	Survive GAC paper
9/27		No class, Nobel
9/29		Peer  review of papers
9/30		Modular arithmetic	Nobel summary due
10/3	Barr, section 2.1, Flannery, chapter 6	Modular arithmetic, shift ciphers	Hw 2 due
10/4		cont.
10/6	Barr, section 1.2, Flannery, pages 106 -110	Review of functions	Hw 3 due
10/7	Barr, section 2.2, Flannery, chapter 5	Affine ciphers
10/10		cont.
10/11		Meet at International Ed Center
10/13	Barr, section 2.3	Substitution ciphers	Hw 4 due
10/14	Barr, section 2.4	Transposition ciphers
10/17	Barr, section 2.5	Polyalphabetic Substitutions
10/18	Barr, section 2.6	Probability and Expectation
10/20		cont.	Hw 5 due
10/21
		Readings for 2nd half