Acquire a basic understanding of the notions and methods of public-key encryption theory, providing an overview of the models which are most widely used in this field.
Curriculum
teacher profile teaching materials
Introduction to public-key cryptography.
The RSA cryptosystem.
Primality tests.
Factorization algorithms.
Some attacks on the RSA.
The discrete logarithm problem. Diffie-Hellman key exchange.
Elgamal cryptosystem.
Massey-Omura cryptosystem.
Digital signatures.
Overview of some cryptographic protocols.
D. Stinson: Cryptography - theory and practice
Fruizione: 20410625-1 CR410-CRITTOGRAFIA A CHIAVE PUBBLICA - MODULO A in Scienze Computazionali LM-40 MEROLA FRANCESCA
Programme
ntroduction to cryptography. Classic ciphers. Introduction to cryptanalysis.Introduction to public-key cryptography.
The RSA cryptosystem.
Primality tests.
Factorization algorithms.
Some attacks on the RSA.
The discrete logarithm problem. Diffie-Hellman key exchange.
Elgamal cryptosystem.
Massey-Omura cryptosystem.
Digital signatures.
Overview of some cryptographic protocols.
Core Documentation
Baldoni, Ciliberto, Piacentini: Aritmetica, crittografia e codiciD. Stinson: Cryptography - theory and practice
Type of evaluation
written examination: usually 4 exercises, both theoretical and practical, duration: usually 2 hours 30 mins. oral examination: optional if the grade is <=26 teacher profile teaching materials
Introduction to public-key cryptography.
The RSA cryptosystem.
Primality tests.
Factorization algorithms.
Some attacks on the RSA.
The discrete logarithm problem. Diffie-Hellman key exchange.
Elgamal cryptosystem.
Massey-Omura cryptosystem.
Digital signatures.
Overview of some cryptographic protocols.
D. Stinson: Cryptography - theory and practice
Fruizione: 20410625-1 CR410-CRITTOGRAFIA A CHIAVE PUBBLICA - MODULO A in Scienze Computazionali LM-40 MEROLA FRANCESCA
Programme
ntroduction to cryptography. Classic ciphers. Introduction to cryptanalysis.Introduction to public-key cryptography.
The RSA cryptosystem.
Primality tests.
Factorization algorithms.
Some attacks on the RSA.
The discrete logarithm problem. Diffie-Hellman key exchange.
Elgamal cryptosystem.
Massey-Omura cryptosystem.
Digital signatures.
Overview of some cryptographic protocols.
Core Documentation
Baldoni, Ciliberto, Piacentini: Aritmetica, crittografia e codiciD. Stinson: Cryptography - theory and practice
Type of evaluation
written examination: usually 4 exercises, both theoretical and practical, duration: usually 2 hours 30 mins. oral examination: optional if the grade is <=26