601.433/633 Introduction to Algorithms
Topic: Asymptotic Analysis, recurrences
2.1
Lecturer: Michael Dinitz
Date: 9/7/17
Notes
Homework 1 will be released today, and is due a week from today by the b
601.433/633 Introduction to Algorithms
Topic: Dynamic Programming I
11.1
Lecturer: Michael Dinitz
Date: 10/10/17
Introduction
Dynamic programming can be very confusing until youve used it a bunch of t
601.433/633 Introduction to Algorithms
Topic: Dynamic Programming II
12.1
Lecturer: Michael Dinitz
Date: 10/12/17
Introduction
Today were going to do a couple more examples of dynamic programming. Whi
601.433/633 Introduction to Algorithms
Topic: Algorithmic Game Theory
24.1
Lecturer: Michael Dinitz
Date: 12/7/17
Introduction
Today were going to spend some time discussing game theory and algorithms
601.433/633 Introduction to Algorithms
Topic: Max-Flow Min-Cut
17.1
Lecturer: Michael Dinitz
Date: 11/2/17
Introduction
These are basically identical to Jeff Ericksons notes (posted). For the same mat
To access the contents, click the chapter and section titles.
Applied Cryptography, Second Edition: Protocols, Algorthms, and Source
Code in C (cloth)
Go!
Keyword
q
Brief
Full
Advanced
Search
Search T
Lecture 3: Perfect Secrecy & One-Time Pad
Last modied 2015/01/02
This section is mostly about developing a reasonable denition of security for encryption. This
security denition is meant to apply to a
Lecture 3
One-time Pad
1
One-Time Pad
Basic Idea: Extend Vigenre cipher so that the
key is as long as the plaintext
No repeat, cannot be broken by finding key length
+ frequency analysis
Key is a r
CHAPTER II: CONGRUENCES
Section 1: Linear Congruences
After discussing primes and divisibility, the next natural topic is the theory of
congruences. Introduced by Carl Friedrich Gauss in 1801, congrue