MATH 115B
WINTER 2009

MW 12:35-1:50
SH 6635

J. Zelmanowitz
SH 6518
Office Hours:
MW 11:30-12:30 by prearrangement
MW   1:50-2:30
E-mail:  julius@math.ucsb.edu, Subject Line: MATH 115B

Text:  "Introduction to Cryptography with Coding Theory," 
W. Trappe & L.C. Washington, 2nd ed, 2006, Prentice-Hall.

Readings:
For Monday, January 12:  Chapter 1; Chapter 3.1-3.6; Chapter 2.1, 2.2; See examples &
         computations in the Appendices.
For Wednesday, January 21:  Remainder of Chapter 2; Chapter 3.8; Chapter 6.1.
For Monday, January 26: Chapter 3.7-3.9
For Monday, February 2: Chapter 6.2, 6.5-6.7; Chapter 7.1.
For Monday, February 9: Chapter 3.11; Chapter 7.2-7.5.
For Wednesday, February 18: Chapter 18.1.   Copy of Chapter 18
For Monday, March 2: Chapter 18.2-18.4.
For Monday, March 9: Chapter 18.5-18.9

MIDTERM EXAM (1:22pm, 2/17/09):  Available Online Tuesday, February 17 @ 8am.
Due in class on Wednesday, February 18 @ 12:35pm.
SOLUTIONS TO MIDTERM

FINAL EXAM (8:00am, 3/14/09). Due in class or by e-mail attachment by 12:00pm, Monday 3/16/09.
Be sure to periodically check this site for updates/clarifications/corrections.
Update (3/14/09, 11:15am) In Problem 2a, if time is an issue for you, it is enough to calculate the ciphertext
for the first 4 positions in "SEND_$7500"; that is you do not have to encipher "_$7500", but you should
indicate what calculations would be needed to be done to complete the ciphertext (and stop at the point of
actually performing the calculations).
SOLUTIONS TO FINAL EXAM

Homework:
Set #1, due January 14 - 2.13 (#1-#9, #23)     Copy of Section 2.13
Set #2, due January 21 - 2.13 (#10-#18, #24, #25)    Copy of Section 3.13  
Set #3, due January 28 - 3.13 (9,10,12,13,16,19), 6.8 (1-4)   Copy of Section 6.8
Set #4, due February 4 - 6.8 (6,9,16,17,19,21,22,23), 7.6 (1,2)   Copy of Section 7.6
Set #5, due February 11 - 3.13 (21,22,33,34), 7.6 (4,6,7,9,10,11). 
Set #6, due March 4 - 18.12 (1,2,3,5,6,7,15,16) Copy of Section 8.12
Set #7, due March 11 - 18.12 (4,8,10,12-15,18-20)

Sample Homework Solutions:
    Section 2.13 - #1, #2, #3 (José Gutierrez), #4 (Allison Fox), #5 (Hannah Tanio), #6 (Sam Miller),
#7 (Tami Weston), #8 (Aaron Petersen), #9 (Aleksey Generosov), #11 (Joe Garand), #13 (Sam Miller),
#14 (Sean Haney), #18 (Claire Deken), #24 (Joshua Biedenweg)
    Section 3.13 - #10 (Sean Haney), #12(Hannah Tanio), #13 (Tami Weston), #16 (José Gutierrez),
#19 (Bonnie Burke), #21 (Joshua Biedenweg)
    Section 6.8 - #1 (Allison Fox), #2 (Joshua Biedenweg), #6 (Aaron Petersen), #9 (Joe Garand),
#16 (Claire Deken), #17 Joe Garand, #21(Aaron Petersen), #23 (Aleksey Generosov),
    Section 7.1 - #1 (Claire Deken), #3 (Bonnie Burke),

Tables:
1.   Primes < 10,000.
2.   Table of Prime Factors of n < 1000.
3.   Indices (Discrete Logs) for primes < 200.

Miscellany:
    •   Casanova, 1757
    •   Block Code (Example 1)
    •   Block Code (Example 2)
    •   New York Times: "Credit Card Processor Says Some Data Was Stolen"
    •   New York Times: "Cryptanalyze This" (book review 11/7/1999)
    •   New York Times: "A Tool to Verify Digital Records, Even as Technology Shifts"