Assignment 1
COMP 4109: Applied Cryptography
Due: In class on February 14 (or via email before class ends)
Assignments are to be completed individually. Any reference to external material should be cited.
Each student has available one slip day for use on
March 19: Zero-Knowledge (cont.) and
Signatures
March 26, 2013
1
Zero-Knowledge (review)
1.1
Review
Alice has y, g, p and claims to know x such that y = g x mod p. Alice proves
knowledge of x to Bob w/o revealing x. No information leakage. How? Zeroknowle
Schnorr signature:
Public parameters: g which is a generator of Gq, p which is a safe prime, and q. To sign,
we have a function S = Sigx(m, r). x is the secret key. m is the message being signed. r
is a random factor.
Key generation is only done once. x i
The Twin Die-Hellman Problem and Applications
David Cash1
Eike Kiltz2
Victor Shoup3
February 10, 2009
Abstract
We propose a new computational problem called the twin Die-Hellman problem. This
problem is closely related to the usual (computational) Die-Hel
Lecture 20
March 21
COMP 4109
Schnorr Signatures
Signatures prevent forgeries, infeasible to sign a message without knowledge of key.
Public parameters:
g, p, q
g is in Gq
p is a safe prime p = 2q + 1
Keys used for Schnorr Signatures
Secret key:
x q
Publi
Scribe Notes for
RSA Encryption and Signatures
By Kevin Fournier
RSA
- Module n where n = pq and p,q -> safe primes
- pq -> (2p+1)(2q+1)
Inverses
- Element a Zn from [0,n-1]
- a is invertible iff gcd(a,n)=1
- Set of invertible elements is Z n*
Ord(a) | (p
COMP 4109:Scribe notes - HTTPS
Andrew Soknacki
March 28, 2013
HTTPS(SSL/TLS) - (SSL/TLS) is the crypto part
HTTPS is HTTP-secure
SSL 2.0,3.0 (Netscape)
TLS 1.0,1.1,1.2 (IETF)
- Most servers support 1.0 TLS where as most modern browsers can support 1.2 TL
COMP 4109
Scribe Notes
Prepared by: Matthew Brown
100763459
March 28, 2013
Last Class
Sketch of TLS:
1. Alice gets servers public key: pks ; related: PKIs and CAs;
2. Alice and server perform a key-exchange: k = KeyExchange(pks ); they now have a shared s
sAllan Wee
Cryptography
HTTPS (Continued)
A3 > Due next class April 4th
Evaluations > online (see your email)
Scribes: Rabil Nyssanbayeu, Allan Wee (backup Dylan Troop)
HTTPS Protocol:
1) Handshake > establish key
Number Theory, Discrete Logs, DieHellman key exchange
CARPA Radu
February 14, 2013
1
Summary from last lecture
For asymmetric cryptography there are mainly 3 possible common settings. The rst 2 are much slower then the
last one. This is due to the need of
Assignment 2
COMP 4109: Applied Cryptography
Due: In class on March 21 (or via email before class ends)
Assignments are to be completed individually. Any reference to external material should be cited.
Each student has available one slip day for use on on
COMP4109
Applied Cryptography
Lecture 1
A course presented by: Jeremy W. Clark
Compiled & Typed by: Matthew Tucciarone
Term: Winter 2013
University of Carleton
Note: This course covers the following areas: Practical aspects of cryptography. Pseudo random
Lecture 4: Randomness
Topics for today: Pseudo-Random Number Generators (PRNGs), Extractors
Pseudo-Random Number Generators
(PRG/PNRG/CS-PRNG)
y = PRG(x)
where y is the (arbitrarily long) output
PRG is a keyless function
x is a d-bit long input/seed
A PRG
A model and architecture for pseudo-random generation with
applications to /dev/random
Boaz Barak
Department of Computer Science
Princeton University
[email protected]
Shai Halevi
IBM
[email protected]
September 1, 2005
Abstract
We present a formal m
COMP 4109 Lecture # 5
Professor: Dr. Jeremy Clark
Applied Cryptography
Carleton University
Date of Lecture: January 24, 2013
1
Outline of the lecture
Todays Discussion will be on One-Time Pads and Stream Ciphers
2
Question from the previous lecture (Janua
Block ciphers: AES and Modes of Operation
January-31-13
1:05 PM
Admin:
- Midterm test (in class)
Th Feb 28
- Assignment 1 (Out Today)
Due Feb 14 (two weeks)
- Assignment 2
Mar 14 (double check)
- Assignment 3
April 4 (double check)
- Scribe Notes: Jas
Lecture: Security and MACs
Notes Feb 5th:
Topics covered: Security games, Security modes of operation, MACs
Topic one: One time security
Models the case where encryption is used just once
Weakest security of a
MACs and Authenticated Encryption
February 7, 2013
Introduction
Information Security consists of:
Confidentiality (achieved through encryption, aims to prevent adversary from reading a
message)
Integrity (achieved through MACs, attempts to provide a mec
Generator Table for N
In[104]:=
ModExpTable n_ : Module t, g ,
t Table PowerMod i, j, n , i, 0, n 1 , j, 0, n 1 ;
t Prepend t, Range n
1;
t MapThread Prepend, t, Prepend Range n
1, "
;
g Grid t, Dividers
False, False ,
Spacings
1, 1 , Background
LightBlue
Assignment 3
COMP 4109: Applied Cryptography
Due: In class on April 4 (or via email before class ends)
Assignments are to be completed individually. Any reference to external material should be cited.
Each student has available one slip day for use on one