ITA | ENG
B006822 - CODING THEORY AND COMPUTER SECURITY
Main information
Course Content
Suggested readings
Learning Objectives
Prerequisites
Teaching Methods
Further information
Type of Assessment
Course program
Academic Year 2013-14
Coorte 2013 - Second Cycle Degree in COMPUTER SCIENCE
Course year
First year - Second Semester
Belonging Department
Mathematics and Computer Science "Ulisse Dini" (DIMAI)
Course Type
Single education field course
Scientific Area
INF/01 - INFORMATICS
Credits
6
Teaching Hours
48
Teaching Term
03/03/2014 ⇒ 13/06/2014
Attendance required
No
Type of Evaluation
Final Grade
Course Content
show
Course program
show
Lectureship
Mutuality
Course teached as:
B006822 - CODICI E SICUREZZA
3-years First Cycle Degree (DM 270/04) in COMPUTER SCIENCE
B006822 - CODICI E SICUREZZA
3-years First Cycle Degree (DM 270/04) in COMPUTER SCIENCE
Course Content
Network security. Shared key cryptography. Perfect Ciphers according to Shannon, One-Time-Pad, unicity distance. Feistel ciphers. Public-key cryptography. Elements of modular arithmetic. RSA and El Gamal ciphers, the Diffie-Hellman protocol. Cryptographic one-way hash functions. Authentication and digital signature.
Elements of Information Theory. Compression codes: 1st Shannon theorem. Huffman codes. Noisy channels, capacity and error correction codes. Linear codes.
Elements of Information Theory. Compression codes: 1st Shannon theorem. Huffman codes. Noisy channels, capacity and error correction codes. Linear codes.
Suggested readings (Search our library's catalogue)
Michele Boreale. Note per il corso di Codici e Sicurezza.
Notes available online.
Other texts:
Th M. Cover, J.A. Thomas. Elements of Information Theory, 2 / E Wiley & Sons, 2006.
Notes available online.
Other texts:
Th M. Cover, J.A. Thomas. Elements of Information Theory, 2 / E Wiley & Sons, 2006.
Learning Objectives
The course aims at providing students with a thorough understanding of the scientific principles underlying the efficient, reliable and secure transmission of data.
Acquired skills.
At the end of the course, the student should be capable of building models at a high level, but rigorous, of communication systems, and of analyzing its criticalities from the point of view of Security.
Acquired skills.
At the end of the course, the student should be capable of building models at a high level, but rigorous, of communication systems, and of analyzing its criticalities from the point of view of Security.
Prerequisites
Courses required: Algorithms and Data Structures, Computer Architecture, Discrete Mathematics and Logic Programming, Probability and Statistics.
Teaching Methods
Number of hours for personal study and other individual learning: 98
Number of hours for classroom activities: 48
Number of hours for classroom activities: 48
Further information
Office hours:
by appointment.
Dipartimento di Statistica, Informatica, Applicazioni
Viale Morgagni, 65 I 50134 Florence, Italy
Tel: +39 055 4237453
Fax: +39 055 4237436
e-mail: michele.boreale@unifi.it
by appointment.
Dipartimento di Statistica, Informatica, Applicazioni
Viale Morgagni, 65 I 50134 Florence, Italy
Tel: +39 055 4237453
Fax: +39 055 4237436
e-mail: michele.boreale@unifi.it
Type of Assessment
Written and oral examination on the course topics.
Course program
Network security. Shared key cryptography. Perfect Ciphers according to Shannon, One-Time-Pad, unicity distance. Feistel ciphers. Public-key cryptography. Elements of modular arithmetic. RSA and El Gamal ciphers, the Diffie-Hellman protocol. Cryptographic one-way hash functions. Authentication and digital signature.
Elements of Information Theory. Compression codes: 1st Shannon theorem. Huffman codes. Noisy channels, capacity and error correction codes. Linear codes
Elements of Information Theory. Compression codes: 1st Shannon theorem. Huffman codes. Noisy channels, capacity and error correction codes. Linear codes