1 / 17

Modern Cryptography Lecture 1

Modern Cryptography Lecture 1. Yongdae Kim. Who’s who?. Some movies :-). Introduction. Class Information Title: Modern Cryptography Course Number: CSci 5471 Lectures: MW 2:30pm - 3:45pm, KHKH 3-111 Has been experimental and challenging to teach this course…

yates
Télécharger la présentation

Modern Cryptography Lecture 1

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Modern CryptographyLecture 1 Yongdae Kim

  2. Who’s who?

  3. Some movies :-)

  4. Introduction • Class Information • Title: Modern Cryptography • Course Number: CSci 5471 • Lectures: MW 2:30pm - 3:45pm, KHKH 3-111 • Has been experimental and challenging to teach this course… • Trying to learn how to teach this course well

  5. Instructor Information • Yongdae Kim • 8 year old prof :-) • Hard working, not bright :-) • Contact information • E-mail: kyd(at)cs.umn.edu preferred • Office hours • Tentatively, M 1:15 PM~ 2:15 PM, W 4:00 PM ~ 5:00 PM • If impossible, let me know by e-mail • If I cannot make it, I’ll let you know in advance • Else by appointment • TA • Zi Lin (lin (at) cs.umn.edu) • Office Hour • Tentatively, M 10:30 ~ 11:30 AM, W 11:00 AM ~ 12:00 PM

  6. Prerequisite (Important!!!) • Must: Discrete Mathematics, Data Structure or Algorithm and some math • Recommended • Complexity, Network, Operating System • Introduction to Number Theory and Cryptography (Math) • Introduction to Computer Security (CS) • Quiz Today • To understand your mathematical knowledge • Nothing to do with your grade • 30 minutes will be given

  7. Course Objectives • To learn • mathematical background for cryptographic techniques • basic cryptographic techniques for computer and network security • how secure these techniques are • how to use these techniques securely • how to apply these techniques

  8. Textbooks • Required • Handbook of Applied Cryptography by Alfred J. Menezes, Paul C. Van Oorschot, Scott A. Vanstone (Editor), CRC Press, ISBN 0849385237, Available on-line at http://www.cacr.math.uwaterloo.ca/hac/ • Optional (If you want a textbook) • Cryptography: Theory and Practice 2/E, Douglas Stinson, Chapman & Hall, ISBN 1584882069

  9. Student Expectations • See CSci 5471 Survival Guide • Keep up with material • complete relevant readings before class • browse lecture slides • Slides will be on-line the same day, after class • Attend lectures • Understanding lecture is much more important than reading before class. • Feedback!!!! • Read your email regularly. No excuses! • Quizzes, Exams and homework: • Write your own answer • Violators will be prosecuted • An F in the course is guaranteed

  10. Class Information • Lecture format • Slides (will try to post before class, but not guaranteed) • Browse the course Web site often • http://www-users.itlabs.umn.edu/classes/Spring-2011/csci5471/ • check it regularly • news and lecture notes (in PDF, PPT) will all be there • Please read your email!

  11. Grading • Distribution • Final: 28%. (In-class) • 6 biweekly assignments: 12 %. (6 x 2 %) Hard • 6 biweekly quizzes: 30 %. (6 x 5% each) Easy • 30% of your grade will be based on the project. • Policy • 90.0% or above yields an A, 87.0% an A-, 83% = B+, 80% = B, 75% = B-, 70% = C+, 65% = C, 60% = C-, 55% = D, and less than 50% yields an F. • You can fail (<50%) quiz at most once (Twice or more fails = F)

  12. Assignment • Submission instruction • Type up your homework by text/pdf file. Send me (CC TA) as either mail body or attachment. • No html email, doc, … • Check Calendar. • First homework due: Jan 31st, 2:15 PM • First quiz: Feb 2. • No grading for late Homework/missing quizzes • If you cannot submit/take it, let me know in advance. • Provide evidence.

  13. Paper Writing Projects • Subject should be confirmed by instructor • Find partner (group of four or more!) • Due • Preproposal by Feb. 7 as mail body • Full proposal by Feb. 21 • Milestone: Mar. 28 • Final paper: May 2 (no extension) • Presentation day: TBD • Survey paper • Convey information to readers, original analysis of the papers , pros and cons, future work • Research paper • Though small, try to solve any problem. Extra credit will be given. • Implementation paper • Implement meaningful mechanism

  14. Useful Information (Cnt.) • Paper search • Google Scholar: http://scholar.google.com/ • Citeseer: http://citeseer.ist.psu.edu/ • Cryptology ePrint Archive: http://eprint.iacr.org/ • ACM Digital Library: http://portal.acm.org/ • IEEE Explorer: http://ieeexplore.ieee.org/

  15. Useful Information (Cnt.) • Crypto packages • OpenSSL: http://www.openssl.org : C • Miracl: http://indigo.ie/~mscott/ : C++ • Bouncy Castle: http://www.bouncycastle.org/ Java • Number Theory Library by Shoup: http://shoup.net/ntl/ • Crypto++ by Wei Dai: http://www.eskimo.com/~weidai/cryptlib.html • JCSI - Java Crypto and Security Implementation: http://www.wedgetail.com/jcsi/ • Mathematica, Matlab, Python

  16. Course Topic - tentative • Mathematics! Mathematics! Mathematics! • Symmetric Ciphers • Hash Functions and Integrity • Public Key Encryption • Digital Signatures • Identification and Authentication • Key Establishment and Management

  17. You may not be able to… • Become expert (needs time…) • Learn everything • Break well-known encryption algorithm • Wireless security, P2P security, … • You may be able to (I hope) • be interested in security • be very strong in mathematics (number theory, …)

More Related