Enlarging letters   Home   Information   Contacting   Map
Català   Castellano

Cryptography (C)

Credits Dept. Type Requirements
7.5 (6.0 ECTS) MAII
  • Elective for DIE
  • Elective for DCSFW
  • Elective for DCSYS
AL - Prerequisite for DIE , DCSYS , DCSFW
PRAP - Prerequisite for DIE , DCSYS , DCSFW

Instructors

Person in charge:  Ana Rio Doval (ana.rio@upc.edu)
Others:Anna De Mier Vinué (anna.de.mier@upc.edu)
Fernando Martínez Sáez (fernando.martinez@upc.edu)
Montserrat Maureso Sánchez (montserrat.maureso@upc.edu)

General goals

Upon finishing this subject, students should:
-  Be familiar with the basic principles (especially those related to public key cryptography) underlying the most important techniques in cryptography: symmetrical and asymmetrical coding-decoding and the digital signature.
-  Understand the most important algorithms behind each of the relevant techniques, especially those used in the most commonly-accepted standards.
-  Be familiar with some of the applications of cryptography.

Specific goals

Knowledges

  1. Secret key cryptography. Flow and block encryption. DES and AES.
  2. Public key cryptography. The integer factorising problem.



    The discrete logarithm problem.
  3. Digital signatures.
  4. Cryptography protocols.

Abilities

  1. Characteristics of secret key algorithms. Extracting the general characteristics of a given secret key algorithm. Understand and programme a given public key algorithm.
  2. Characteristics of public key algorithms. Knowing how to classify a digital signature algorithm depending on the problem it is based on. Understanding and programming a given public key algorithm.
  3. Knowing how to classify a digital signature algorithm depending on the problem it is based on. Understanding and programming a given public key algorithm.
  4. Understanding the workings of a given cryptographic protocol and finding its strengths and weaknesses.
  5. Telling the difference between sound cryptography and "snake-oil".

Competences

  1. Critical, logical-mathematical reasoning.
  2. Ability to create and use models of reality.
  3. Ability to design and carry out experiments and analyse the results.
  4. Ability to design a test to check the validity of the response after being given the answer.

Contents

Estimated time (hours):

T P L Alt Ext. L Stu A. time
Theory Problems Laboratory Other activities External Laboratory Study Additional time

1. Basic concepts
T      P      L      Alt    Ext. L Stu    A. time Total 
3,0 0 0 0 0 3,0 0 6,0
- Cryptology, Cryptography, and Cryptanalysis.



- Classic cryptography and modern cryptography.



- Basic techniques: encryption-decryption and signature.



- Private key cryptography and public key cryptography.



- The mathematical bases of cryptography.

2. Modern secret key techniques
T      P      L      Alt    Ext. L Stu    A. time Total 
9,0 0 12,0 0 12,0 9,0 0 42,0




- Block encryption, flow encryption.



- The Data Encryption Standard: Description, History, Standardisation, Cryptanalysis.



- The Advanced Encryption Standard: Description, Standardisation.



- Operation modes for block-encrypted systems.

3. Public key encryption systems
T      P      L      Alt    Ext. L Stu    A. time Total 
18,0 0 12,0 0 12,0 18,0 0 60,0
- Multi-precision arithmetic operations. Euclidean algorithms.



- Congruences, multiplication group, modular arithmetic, modular exponential, Chinese Remainder Theorem.



- Calculation of square roots.



- Prime numbers, probabilistic criteria of primeness, random generation of prime numbers.



- Factorising integers, current state of the problem and the outlook in this field.



- Concepts behind the unidirectional trap-door function.



- Power function trap-door.



- Discrete exponential function and the discrete algorithm problem. Finite body variants.



- The knapsack problem.



- RSA cryptosystem (Rivest, Shamir, Adleman).



- ElGamal cryptosystem.



- Diffie-Hellman system for distributing keys.



- Knapsack cryptosystem. Shamir"s cryptanalysis.

4. Digital signatures
T      P      L      Alt    Ext. L Stu    A. time Total 
3,0 0 4,0 0 4,0 3,0 0 14,0


- Cryptographic hash functions. Secure Hash Standard.



- Digital signatures: RSA and DSA



- Public key certificates.



- Certifying authorities.



- PKI

5. Cryptographic protocols
T      P      L      Alt    Ext. L Stu    A. time Total 
12,0 0 2,0 0 2,0 12,0 0 28,0


- Encryption and decryption transformations. Mixed private key - public key techniques.



- Identification schemes and protocols.



- SSL.



- SET.



- Micro-payments.



- Shared secrets.



- Electronic voting.



- Watermarks.



Others aspects of cryptography:



- Standardisations. Bodies involved.



- Patents.



- Policy aspects. Government control.



- The Telecommunications Act.



- The Digital Signature Act.



- International Laws.


Total per kind T      P      L      Alt    Ext. L Stu    A. time Total 
45,0 0 30,0 0 30,0 45,0 0 150,0
Avaluation additional hours 0
Total work hours for student 150,0

Docent Methodolgy

Theory classes and exercises.



The nature of the theme under consideration will determine the scheduling of problems and theory.











Lab classes will consolidate students" knowledge.

Evaluation Methodgy

The grade (out of 10) is calculated by adding the following:







* Lab exercises (4 points). It is planned to hold at least three sessions. The practical sessions consist of implementing a set of algorithms defined by the most recognised cryptographic standards.



Implementations have to pass a series of tests before being submitted.







* Final exam (6 points).

Basic Bibliography

  • Schneier, B Applied Cryptography. Protocols, Algorithms, and Source Code in C, John Wiley & Sons., 1996.
  • Pastor, J., Sarasa, M.A. Criptografia digital, Prensas Universitarias de Zaragoza, 1998.
  • Menezes, A.J., Oorschot, P.C., Vanstone, S.A. Handbook of applied cryptography, CRC Press (http://www.cacr.math.uwaterloo.ca/hac/), 2001.
  • Yan, S.Y. Number Theory for Computing, Springer, 2000.
  • Mollin, Richard A. RSA and public-key cryptography, Chapman & Hall/CRC , 2003.
  • Stallings, W. Cryptography and Network Security 3ed., Prentice Hall , 2003.

Complementary Bibliography

  • Ross Anderson Security Engineering, Wiley (http://www.cl.cam.ac.uk/~rja14/book.html), .
  • Kaliski, B.S. et. al. (Eds.) Answers to Frequenyly Asked Questions About Today's Cryptography, RSA Laboratories (http://www.rsa.com), .
  • Simmons, G.J. (Ed.) Contemporary Cryptology. The Science of Information Integrity, IEEE Press, 1992.
  • Stinson, D.R Cryptography: Theory and Practice, Chapman & Hall; , 2002.
  • Katzenbeisser, S., Petitcolas, F.A.P. Information hiding techniques for steganography and digital watermaking, Artech House, 2000.
  • Opplinger, R. Security tecnologies for the world wide web, Artech House, 2000.
  • Ingemar Cox, Matthew Miller, Jeffrey Bloom Digital Watermarking, Morgan Kaufmann Publishers,, 2001.
  • O'Mahony, D., Peirce, M., Tewari, H. Electronic Payment Systems for E-commerce, Artech House, 2001.
  • Salomaa, A. Public-key Cryptography, Springer-Verlag, 1990.
  • Koblitz, N. Algebraic Aspects of Cryptography, Springer, 1998.
  • Koblitz, N. A A course in Number Theory and Cryptography , Springer-Verlag, 1994.
  • Blake, Ian F. Elliptic curves in cryptography, Cambridge Cambridge University Press, 1999.
  • Lucena, Manuel Criptografía y Seguridad en Computadores, libro electrónico, publicado bajo licencia Creative Commons., .
  • Ramió Aguirre, Jorge Aplicaciones Criptográficas, Publicaciones de la Escuela Universitaria de Informática de MAdrid, .

Previous capacities

Students are recommended to take this course a few terms before completing the Selection Stage.



 
logo FIB © Barcelona school of informatics - webmaster@fib.upc.edu - RSS RSS