**
Home
•
Research
•
Résumé (PDF/DOC/TEXT)
•
Teaching
•
Photos
•
FunStuff
•
Contact
•
SPACE 2016
**

Cryptography (Classical and Quantum), Spring 2014

Friday 2:00pm-4:00pm, Classroom 1, CRRao AIMSCS

Office Hours: By appointment

**28-Mar:**- Midterm info available
**12-Mar:**- Third Midterm Exam will be on 28-Mar-2014 from 2:15pm-3:15pm.
**12-Mar:**- The schedule for student presentations is:
Wednesday

2-April-14

6:30pm-7:30pmEPR non-separability Aswathi

Vinod

NavitaFriday

4-April-14

2:00pm-3:00pmQuantum Dense Coding Bhavana

Pratyusha

Swami

SampathFriday

4-April-14

3:00pm-4:00pmQKD Jagdeesha

Akhil

ShankarMonday

7-April-14

6:00pm-7:00pmNo Cloning Nagesh

Ravi Shankar

PrabhakarMonday

7-April-14

7:00pm-8:00pmError Correcting Subbu

Gourav

NarottamFriday

11-April-14

2:00pm-3:00pmTeleportation Anku

Abhishek

MunjalFriday

11-April-14

3:00pm-4:00pmEavesdropping Suresh

Nishma

Vanaja **3-Mar:**- Friday (14-March) class has been rescheduled to Wednesday (12-March) 6pm-8pm
**3-Mar:**- Friday (7-March) class has been rescheduled to Wednesday (5-March) 6pm-8pm
**28-Feb:**- Midterm info available
**14-Feb:**- Second Midterm Exam will be on 28-Feb-2014 from 2:15pm-3:15pm.
**27-Jan:**- Midterm info available
**20-Jan:**- The class time has been changed from Wednesday 6pm-8pm to Friday 2pm-4pm.
**15-Jan:**- First Midterm Exam will be on 27-Jan-2014 from 6:30pm-7:30pm.
**06-Jan:**- Welcome to Cryptography: Spring 2014.

All the programming assignments are to be done in `C`

or `C++`

. Submit one single text (.c or .cpp) file with the "readme" section on the top. The name of the file must be of the format "id1-id2-id3-hw1.c" or "id1-id2-id3-hw1.cpp". The file should be emailed to me by the submission deadline with heading "Cryptography Homework #".

**Homework 1:**- Implement Euclidean and extended Euclidean algorithm to find the inverse, if any, of an integer
`a`modulo another integer`m`.

Your program should take as user inputs`a`and`m`and output`a`.^{-1}mod m **Homework 2:**- Implement the Euclidean algorithm to find the GCD of two polynomials
`f`and`g`with integers coefficients. Your program should take as user inputs`f`and`g`and output a polynomial`h`=`gcd`(`f`,`g`). **Extra Credit:**Same as above but for polynomials with coefficients fromfor some integer**Z**_{m}`m`> 1.**Homework 3:**- Homework 3
**Homework 4:**- Homework 4
**Homework 5:**- Homework 5

**28-Mar:**- Midterm 3 solution sketch
- The scores on the exam are as follows
- 19, 19, 18, 18, 16, 15, 15, 15, 14.5, 14, 14, 14, 14, 12, 11, 8, 8, 6, 6, 6, 6

*average*was**12.7**and the*median*was**14.0**. **12-Mar:**- Third Midterm Exam will be on 28-Mar-2014 from 2:15pm-3:15pm.
**28-Feb:**- Midterm 2 solution sketch
- The scores on the exam are as follows
- 16.5, 15.5, 15, 15, 15, 15, 14, 14, 13, 12, 12, 11.5, 11, 11, 11, 10, 9.5, 9.5, 8.5, 8.5, 7.5, 3

*average*was**11.73**and the*median*was**11.75**. **14-Feb:**- Second Midterm Exam will be on 28-Feb-2014 from 2:15pm-3:15pm.
**27-Jan:**- Midterm 1 solution sketch
- The scores on the exam are as follows
- 20, 20, 20, 18, 18, 18, 17, 17, 17, 16, 16, 16, 15, 14, 9, 8, 7, 6, 5, 3, 2

*average*was**13.4**and the*median*was**16.0**. **15-Jan:**- First Midterm Exam will be on 27-Jan-2014 from 6:30pm-7:30pm.
- CS6160:
*Cryptology* - Handbook of Applied Cryptography