You need to activate javascript for this site.
Menu Conteúdo Rodapé
  1. Home
  2. Courses
  3. Mathematics and Applications
  4. Cryptography and Coding Theory

Cryptography and Coding Theory

Code 13923
Year 2
Semester S2
ECTS Credits 6
Workload TP(60H)
Scientific area Mathematics
Entry requirements N.A.
Learning outcomes - Learn some fundamental concepts and examples in coding theory and cryptography;
- Apply the studied results and techniques in the analysis of several codes;
- Analyse and understand proofs;
- Communicate, written and orally, using mathematical language.
Syllabus 1. Information and entropy
1.1 Alphabets and codes
1.2 Information rate and entropy
1.3 Shannon’s theorems
2. Codes
2.1 Hamming distance
2.2 Linear codes
2.3 Hamming codes
2.4 Golay codes
2.5 Cyclic codes

3. Cryptographic Codes
3.1 Symmetric-key Cryptosystems
3.2 RSA Cryptosystem
3.3 Rabin public key Cryptosystem
3.4 Cryptosystems based on discrete logarithms
Main Bibliography - Cover, T. M., and Thomas, J. A. (2006), Elements of Information Theory (2.ª edição), Wiley
- R. Hill (1997), A First Course in Coding Theory, Oxford University Press
- J. P. Hoffstein, J. Pipher e J. H. Silverman (2014), An Introduction to Mathematical Cryptography (2.ª edição), Springer
- J.H. van Lint (1991), Introduction to Coding Theory, Graduate Texts in Mathematics (3.ª edição), Springer
- D. Welsh (2000), Codes and Cryptography, Oxford University Press, Oxford University Press
Language Portuguese. Tutorial support is available in English.
Last updated on: 2019-07-10

The cookies used in this website do not collect personal information that helps to identify you. By continuing you agree to the cookie policy.