IDENTIFYING DATA

2015_16

Subject (*)

CRYPTOLOGY AND INFORMATION SECURITY

Code

17665108

Study programme

Computer Engineering: Computer Security and Intelligent Systems (2013)

Cycle

2nd

Descriptors

Credits

Type

Year

Period

Compulsory

First

Language

Anglès

Department

Enginyeria Informàtica i Matemàtiques

Coordinator

DOMINGO FERRER, JOSEP

E-mail

josep.domingo@urv.cat

Lecturers

DOMINGO FERRER, JOSEP

Web

http://crises-deim.urv.cat/cryptosec/

General description and relevant information

Acquire a broad vision of the various applications of cryptology. Learn the foundations of information theory upon which modern cryptology rests. Acquire advanced knowledge on the main shared-key cryptosystems. Learn the mathematical foundations and assumptions of the main public-key cryptosystems and digital signature algorithms. Learn and understand cryptographic protocols used in a broad range of applications. Acquire basic notions of security proofs and cryptanalysis. Become familiar with cryptographic software.

Competences

Type A	Code	Competences Specific
	D1	Integrate the fundamental technology, applications, services and systems of computer engineering, in general, and in a broader, multidisciplinary context.
	T4	Design, develop, manage and evaluate mechanisms to certify and guarantee security in handling information and access to it in a local or distributed processing system.
Type B	Code	Competences Transversal
	B2	Aplicar el pensament crític, lògic i creatiu, demostrant capacitat d’innovació.
Type C	Code	Competences Nuclear

Learning outcomes

Type A	Code	Learning outcomes
	D1	Present options that are, for the most part, effective for solving problems. Have an analytical method that enables them to identify causes that are not obvious and evaluate their impact on the problems. Find appropriate solutions.
	T4	Apply cryptographic systems with homomorphic properties. Apply techniques of advanced encryption. Apply advanced cryptographic protocols to guarantee information security. Apply advanced signature techniques. Apply advanced encryption techniques. Understand elliptic curve cryptography. Understand the implementation of cryptographic protocols.
Type B	Code	Learning outcomes
	B2	Put forward new ideas, opportunities or solutions to familiar problems and/or processes. Analyze the risks and benefits of innovation.
Type C	Code	Learning outcomes

Contents

Topic	Sub-topic
Introduction to cryptology.	Terminology. Historical evolution. Applications of cryptography.
Historical and information-theoretic foundations of cryptology.	Historical cryptosystems. Foundations of information theory. Optimal compression. Perfect secrecy and authenticity. Elementary cryptanalysis.
Shared-key encryption: stream cryptosystems.	Requirements on pseudorandom sequences for stream cryptosystems. Linear generators. Non-linear generators.
Shared-key encryption: block cryptosystems.	Structure of block cryptosystems. The Data Encryption Standard. The Advanced Encryption Standard. The IDEA cryptosystem. Attacks on block cryptosystems. Indistinguishability. Key management.
Mathematical foundations of public-key cryptography.	Modular arithmetic. Finite fields. Elliptic curves. Complexity theory. Difficult problems in modular arithmetic and elliptic curves.
Public-key encryption.	One-way and trapdoor functions. Diffie-Hellman key exchange. Elliptic curve Diffie-Hellman key exchange. The RSA cryptosystem. The ElGamal cryptosystem. The digital envelope. Probabilistic public-key encryption.
Digital signatures.	Concept. Hash functions. RSA signatures. ElGamal signatures. Digital Signature Algorithm. Elliptic curve Digital Signature Algorithm. Threshold signatures. Group signatures. Public-key infrastructures.
Cryptographic protocols.	Identification and authentication: Shamir's three pass protocol, Fiat-Shamir identification, zero-knowledge proofs. Secret sharing. Mutual distrust situations: bit commitment, oblivious transfer, simultaneous exchange of secrets, secure contract signing, secure multi-party computation, computing on encrypted data. Electronic cash. Electronic voting. Quantum cryptography.

Planning

Methodologies :: Tests

Competences

(*) Class hours

Hours outside the classroom

(**) Total hours

Introductory activities

Supervision

Problem solving, classroom exercises

Lecture

Problem solving, classroom exercises

Practicals using information and communication technologies (ICTs) in computer rooms

Presentations / expositions

Personal tuition

(*) On e-learning, hours of virtual attendance of the teacher.
(**) The information in the planning table is for guidance only and does not take into account the heterogeneity of the students.

Methodologies

Methodologies

	Description
Introductory activities	Motivation of students by showing them how useful is cryptology for information security.
Supervision	Exam consisting of several problems and exercises.
Problem solving, classroom exercises	Individual problem solving.
Lecture	Theory classes.
Problem solving, classroom exercises	Problem solving individually or by groups of 2-3 students.
Practicals using information and communication technologies (ICTs) in computer rooms	Use of cryptographic software and implementation of one cryptosystem and one protocol.
Presentations / expositions	Presentacions en grup a les classes de pràctiques.
Personal tuition	Mentoring and orientation at the professor's office or by e-mail.

Personalized attention

Description

Personalized mentoring during office hours or by e-mail.

Assessment

Methodologies

Competences

Description

Weight

Supervision

Exam consisting of problems and exercises administered during the last course week.

50%

Problem solving, classroom exercises

During the last course week, the students solve individually a battery of problems in the classroom.

10%

Problem solving, classroom exercises

By groups of 2-3, students present to the rest of the class a block of solved exercises.

10%

Practicals using information and communication technologies (ICTs) in computer rooms

By groups of 2-3, students submit the practical implementation of a cryptosystem and a protocol.

20%

Presentations / expositions

By groups of 2-3, students present a specific topic.

10%

Others


Other comments and second exam session
La segona convocatòria s'avaluarà al 100% basada en un examen amb exercicis teòrics i problemes.

Sources of information

Basic	J. Domingo Ferrer i J. Herrera Joancomartí, “Criptografia per als serveis telemàtics i el comerç electrònic”, EdiUOC, 1999 J. Domingo Ferrer, crises-deim.urv.cat/cryptosec, , 0 S. Goldwasser and M. Bellare, Lecture Notes on Cryptography, autoeditat, 2008

Complementary	D. E. Denning, “Cryptography and Data Security”, Addison-Wesley, 1982 B. Schneier, “Applied Cryptography” (2nd ed.), John Wiley&amp;amp;amp;sons,, 1996 G. J. Simmons, “Contemporary Cryptology: The Science of Information Integrity”, IEEE Press, 1992 S. Goldwasser i M. Bellare, Lecture Notes on Cryptography, MIT, 2001

Recommendations

(*)The teaching guide is the document in which the URV publishes the information about all its courses. It is a public document and cannot be modified. Only in exceptional cases can it be revised by the competent agent or duly revised so that it is in line with current legislation.