Ви переглядаєте архівну версію офіційного сайту НУЛП (2005-2020р.р.). Актуальна версія: https://lpnu.ua

Cryptography

Major: System Analysis
Code of Subject: 7.124.01.E.32
Credits: 4
Department: Information Systems and Networks
Lecturer: Kravec Petro Oleksiyovuc
Semester: 2 семестр
Mode of Study: денна
Learning outcomes:
have profound knowledge of methods and mathematical foundations of cryptographic systems development as well as of tools for the implementation of these systems.
A qualified expert has to be able to:
to analyse, design, administer and operate the cryptographic systems.
Required prior and related subjects:
Problem-Oriented Programming
System Programming
Operating Systems
Object-Oriented Programming
Discrete Mathematics
Systems Analysis
Probability Theory and Mathematical Statistics
Distributer information systems security
Summary of the subject:
Course subject and tasks: Encrypting and cryptographic analysis, classical encrypting methods and algorithms. Caesar's cipher (shift cipher), substitution cipher, homophonic substitution cipher (Gauss cipher), polygraphic substitution cipher, polialphabetic cipher (Vigenere cipher), autokey cipher, bloc cipher. Trabsposition cipher, matrix cipher, Cardan grille. Symmetric encryption system, one-time pad (Vernam cipher), multiple encryption, ADFGVX cipher, Enigma rotor cipher, Data Encryption Standard. Advanced Encryption Standard.Cryptographic hash functions. Mathematical foundations of cryptograpfy, Euclidean algorithm gor computng the GCD, prime and coprime numbers,congruent numbers and congruence features, the concept of quotient ring, inverse in a quotient ring under addition or multiplication. Euler's totient function, Euler's theorem, Fermat's little theorem, Chinese remainder theorem, Affine substitution cipher. Binary method of exponentiation. Primitive root modulo, quadratic residues. Prime and pseudoprime numbers, natural numbers primality test, Solovay-Strassen primality test, Miller-Rabin primality test, generating random primes of the fixed scale. The concept of factoring (decomposition of an natural number into prime factors). Primitive modulo quadratic residues identification. The extraction of the square root by primitive modulo. Primitive root modulo identification. Taking discrete logarpthms by primitive modulo. Assymretric encryption systems,public-key encryption systems, Rivest-Shamir-Adleman system, Rabin cryptosystem, public-key stochasticsystems, ElGamal encryption. Strem ciphers, Blum-Goldwasser cryptosystem, PGP hybrid cryptosystem. Digital signature, signature in RSA system, ElGamal digital signature, Schnorr scheme, Digital Signature Algorithm, Digital Signature Standard.
Recommended Books:
• Вербіцький О.В. Вступ до криптології / О.В. Вербіцький. – Львів: ВНТЛ, 1998. – 247 с.
• Баричев С.Г. Основы современной криптографии / С.Г. Баричев, В.В. Гончаров, Р.Е. Серов. – М.: Горячая линия – Телеком, 2002. – 175 с.
• Шнайер Б. Прикладная криптография. Протоколы, алгоритмы, исходные тексты
на языке Си / Б. Шнайер. – М.: Триумф, 2002. – 816 с.
• Масленников М. Практическая криптография / М. Масленников. – СПб.: БХВ-Петербург, 2003. – 464 с.
• Столлингс В. Криптография и защита сетей: принципы и практика / В. Столлингс. – 2-е изд. – М.:Вильямc, 2001. – 672 с.
• Венбо Мао. Современная криптография. Теория и практика = Modern Cryptography: Theory and Practice / Мао Венбо. – М.: Вильямс, 2005. – 768 с.
• Рябко Б.Я. Основы современной криптографии для специалистов в информационных технологиях / А.Н. Фионов. – М.: Научный мир, 2004.
• Мельников В.В. Защита информации в компьютерных системах / В.В. Мельников. – М.: Финансы и статистика, 1997. – 386 с.
Assessment methods and criteria:
• Current control (40%): written reports on laboratory work,desing work ,oral examination;
• Final control (60% of exam): in written.