courses:csdd[PoliMi Cryptography Group] [PDF]

18/5, Room C (Bdg. 11), L, Public Key Cryptography - RSA Cryptosystem, Slides · Slides 4x4 grayscale. Smart. Chap. 11. S

5 downloads 21 Views 71KB Size

Recommend Stories


PDF-Download- Applied Cryptography
Where there is ruin, there is hope for a treasure. Rumi

PDF Applied Cryptography
Don’t grieve. Anything you lose comes round in another form. Rumi

[PDF] Understanding Cryptography
Where there is ruin, there is hope for a treasure. Rumi

Cryptography
The happiest people don't have the best of everything, they just make the best of everything. Anony

White-Box Cryptography Cryptography
I tried to make sense of the Four Books, until love arrived, and it all became a single syllable. Yunus

cryptography
Everything in the universe is within you. Ask all from yourself. Rumi

Cryptography
You often feel tired, not because you've done too much, but because you've done too little of what sparks

PDF Cryptography and Network Security
Just as there is no loss of basic energy in the universe, so no thought or action is without its effects,

[PDF] Cryptography and Network Security
Never let your sense of morals prevent you from doing what is right. Isaac Asimov

[PDF] Cryptography and Network Security
Be grateful for whoever comes, because each has been sent as a guide from beyond. Rumi

Idea Transcript


Politecnico di Milano

PoliMi Cryptography Group Cerca

INDEX Homepage Team Research Topics Courses Projects

Cryptography and Architectures for Computer Security - 095947 The course aims to provide a systematic formation on cryptographic techniques currently employed in communications and data storage, focusing on algorithms and architectures and protocols. Lectures: Monday (14:30-16:15) classroom B.5.4, Building 14 Thursday (14:30-16:15) classroom C, Building 11 Instructor: Gerardo Pelosi (gerardo.pelosi -at- polimi.it) Teaching Assistant: Alessandro Barenghi (alessandro.barenghi -at- polimi.it) Office hours: Wednesday (16:00-19:00), Building 20, 1st floor, Office 127 or upon appointment through e-mail Topics for the optional course PROJECT Reference Material Course Schedule Exam Layout Exam Sessions Past Exam Papers

Reference Material There is no single assigned textbook for this course, Slides and lecture notes will be made available during the course. A very good reference for most of the course topics is: Nigel P. Smart, Cryptography, An Introduction: Third Edition, PDF freely available here (Version 3.0.1.2). Latest version online at http://www.cs.bris.ac.uk/~nigel/Crypto_Book/ Additional material that you might find useful: Alfred J. Menezes, Paul C. van Oorschot and Scott A. Vanstone, Handbook of Applied Cryptography,avaliable online freely at http://cacr.uwaterloo.ca/hac/ Jonathan Katz, Introduction to Modern Cryptography, August 2007, Chapman & Hall/CRC Press Christopher Swenson, Modern Cryptanalysis: Techniques for Advanced Code Breaking March 2008, Wiley Stefan Mangard, Elisabeth Oswald, Thomas Popp, Power Analysis Attacks - Revealing the Secrets of Smartcards Springer (available online via Polimi subscription to Springer) If you are willing to try some practical challenges in the field of cryptography for fun, you can have a look here

Course Schedule Day

Classroom L/E

Mon. Room B.5.4 1 L 6/3 (Bdg. 14)

Topic Introduction to cryptography, confidentiality, integrity, authentication and non-repudiation. Adversaries and classes of attacks

2

Thu. Room C 9/3 (Bdg. 11)

3

Mon. Room B.5.4 L 13/3 (Bdg. 14)

Block Ciphers: Feistel structure, DES, 3DES, DES-X, Modes of Operation

4

Thu. Room C 16/3 (Bdg. 11)

Exercises on Historical Substitution Ciphers, Permutation Ciphers

L

E

Mon. Room B.5.4 5 L 20/3 (Bdg. 14)

Historical ciphers, Perfect secrecy, Shannon's proof, OTP, confusion and diffusion principles

Block Ciphers: SPN structure, AES; Stream ciphers: LFSR, RC4

6

Thu. Room C 23/3 (Bdg. 11)

7

Mon. Room B.5.4 L 27/3 (Bdg. 14)

Block Cipher Cryptanalyses: Linear Cryptanalysis

8

Thu. Room C 30/3 (Bdg. 11)

Block Cipher Cryptanalyses: Differential Cryptanalysis + exercises

9

Mon. Room B.5.4 L 03/4 (Bdg. 14)

Thu. 06/4 Mon. 11 10/4 - — Thu. 12 20/4 - — Mon. 13 08/5 Thu. 14 11/5 Mon. 15 15/5 10

Room C (Bdg. 11) Room B.5.4 (Bdg. 14) Room C (Bdg. 11) Room B.5.4 (Bdg. 14) Room C (Bdg. 11) Room B.5.4 (Bdg. 14)

L

E

L

Algebraic Groups - Definitions of Rings and Fields

Notes (part 1)

-

Easter Holidays

E

Password Storage, Memory hard functions and disk encryption

-

National Holiday

L

Modular Arithmetic - Finite Fields

Notes (part 2)

L

Polynomial Fields and numerical examples

Notes (part 2)

L

Extension Fields - Examples

Notes (part 3)

Public Key Cryptography - RSA Cryptosystem

Slides Slides 4x4 grayscale Smart. Chap. 11 Smart. Chap. 15

Mon. Room B.5.4 E 22/5 (Bdg. 14)

L

18

Thu. Room C 25/5 (Bdg. 11)

19

Mon. Room B.5.4 L 29/5 (Bdg. 14)

24

L

L

Room B.5.4 L (Bdg. 14) Room C E (Bdg. 11)

Mon. Room B.5.4 L 12/6 (Bdg. 14)

Thu. 15/6 Mon. 26 19/6 Thu. 27 22/6 25

Slides Slides 4x4 Smart. Chap.s 7,8 Slides Slides 4x4 ITU X.680, X.690, X.509, IETF RFC 4880 Slides Slides 4x4 grayscale C calculator for linear biases Linear cryptanalysis implementation Slides Slides 4x4 grayscale C calculator for linear biases Linear cryptanalysis implementation Slides Slides 4x4 grayscale Smart. Chap. 10 Exercise book v1.4.2, Chapter 2,3,4

17

Mon. 05/6 Thu. 23 08/6

Exercise book v1.4.2, Chapter 1

Exercises on block ciphers, LFSR and Hash functions

Thu. Room C 18/5 (Bdg. 11)

21

Hash functions: definitions, properties, birthday paradox, Design principles, MACs

Slides Slides 4x4 Menezes Chap.1 Slides Slides 4x4 grayscale Smart. Chap. 3 Smart. Chap. 5 Shannon's_paper Slides Slides 4x4 Smart. Chap. 8 Menezes Chap. 7

E

16

Thu. Room C 20 01/6 (Bdg. 11)

Hybrid Cryptoschemes and Public Key Authentication

Reference Material

Slides Slides 4x4

Exercises on Finite Fields Discrete Logarithm Problem, Diffie-Hellmann Protocol, ElGamal cryptosystem, ElGamal Signature scheme, CCA2-Secure ElGamal, Digital Signature Algorithm (DSA)

Slides Slides 4x4 grayscale Smart. Chap. 11 Smart. Chap. 14

Continuation of Discrete Logarithm based cryptosystems

-

Elliptic Curve Cryptography Montgomery multiplication and fast arithmetic algorithms Exercises on Montgomery Multiplication and RSA Primality Testing. Number theoretical cryptanalysis: factoring algorithms, Discrete log extraction algorithms

Room C L/E Pohlig-Hellman Attack + Exercises (Bdg. 11) Room B.5.4 E TLS and SSH, Kerberos, Tor (Bdg. 14) Room C E Side Channel Attacks (Bdg. 11)

Slides Slides 4x4 grayscale Smart. Chap. 2 Notes on Fast Modular Arithmetic Menezes Chap. 14 Sections 1–3 Exercises from the Exercise book v1.4.2, Chapter 6,7 and Notes on Fast Modular Arithmetic Slides Slides 4x4 grayscale Smart. Chap. 12 (Factoring) Smart. Chap. 13 (Discrete Logs) Slides Slides 4x4 grayscale Slides Slides 4x4 grayscale Slides Slides 4x4 grayscale

Exam layout There will be a 2h/2h30 written examination on the subjects of the course, which will include both questions and exercises. It is possible to integrate the exam score with an optional practical project yielding at most a +6 increase in the evaluation (groups with at most 2 people). However, a sufficient score in the written part must be obtained. Project Guidelines In order to take on a project you must contact both the teacher and the instructor (keep them both as CC) for both asking details and the natural communication which will ensue during the project development. For the sake of unambiguity you must always keep both of them in all your communications. Contact e-mails not complying with this will not be answered. The project includes a reasonably-sized report and a short (10-15 minutes) presentation to be delivered to the teacher and the instructor. If the project involves the production of code, a Polimi-hosted git repository will be provided, with ssh public-key based access. The project should be delivered at least a week in advance with respect to the exam date in which you want it to be evaluated (it may be different from the date of the written examination). A preliminary list of projects is available with more project descriptions to come. The assignment policy is “first-come-first-served”. The projects proposals are available here; autonomous project proposals are welcome and will be taken into consideration.

Exam Sessions Check the Poliself for further information on the exact time and place. 1st call on July 5th 2017, 12:15, Room: S.0.2 2nd call on July 25th 2017, 16:30, Room: C.I.1 3rd call on September 12th 2017, 9:30, Room: L.26.11 The subscription to the exam session you want to take is mandatory in order to have the grade registered.

Past Exam Papers September 12th, 2017 - Solutions September 12th, 2017 - Grades July 5th, 2017 - Questions July 5th, 2017 - Solutions February 9th, 2017 - Solutions September 28th, 2016 - Questions September 28th, 2016 - Solutions September 14th, 2016 - Questions July 20th, 2016 - Questions July 20th, 2016 - Solutions July 4th, 2016 - Questions July 4th, 2016 - Solutions July 1st, 2015 - Questions July 1st, 2015 - Solutions July 22nd, 2015 - Questions July 22nd, 2015 - Solutions September 9th, 2015 - Questions September 9th, 2015 - Solutions September 30th, 2015 - Questions

This courseware is licensed under the Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License. http://www.google.it/ To view a copy of this license, visit http://creativecommons.org/licenses/by-nc-sa/3.0/ or send a letter to Creative Commons, 171 Second Street, Suite 300, San Francisco, California, 94105, USA.

Entra

Torna su Indietro Puntano qui Theme provided by Acquia, Inc. under GPL license from TopNotchThemes Drupal themes Modified by Jeremy Caldwell of Eternalistic Designs and Alessandro Barenghi

Smile Life

When life gives you a hundred reasons to cry, show life that you have a thousand reasons to smile

Get in touch

© Copyright 2015 - 2024 PDFFOX.COM - All rights reserved.