Об этом курсе: Welcome to Course 2 of Introduction to Applied Cryptography. In this course, you will be introduced to basic mathematical principles and functions that form the foundation for cryptographic and cryptanalysis methods. These principles and functions will be helpful in understanding symmetric and asymmetric cryptographic methods examined in Course 3 and Course 4. These topics should prove especially useful to you if you are new to cybersecurity. It is recommended that you have a basic knowledge of computer science and basic math skills such as algebra and probability.
Для кого этот курс: Learners with CS experience or education looking to: ○ Enhance/refresh critical skills; ○ Seeking to expand their opportunities. Learners undecided about pursuing a bachelor’s degree: ○ Seeking professional credit that may be applied towards a bachelor’s degree.
Автор: University of Colorado System
Преподаватели: William Bahn, Lecturer
Computer Science
Преподаватели: Richard White, Assistant Research Professor
Computer Science
Преподаватели: Sang-Yoon Chang, Assistant Professor
Computer Science
| Основные сведения | Course 2 of 4 in the Introduction to Applied Cryptography Specialization |
| Уровень | Beginner |
| Выполнение | This is Course 2 in a 4-course specialization. Estimated workload: 15-hours per week. |
| Язык | English |
| Как пройти курс | Чтобы пройти курс, выполните все оцениваемые задания. |
| Оценки пользователей |
Программа курса
НЕДЕЛЯ 1
Integer Foundations
Building upon the foundation of cryptography, this module focuses on the mathematical foundation including the use of prime numbers, modular arithmetic, understanding multiplicative inverses, and extending the Euclidean Algorithm. After completing this module you will be able to understand some of the fundamental math requirement used in cryptographic algorithms. You will also have a working knowledge of some of their applications.
5 видео, 10 материала для самостоятельного изучения, 1 тренировочный тест
- Reading: Course Introduction
- Видео: Divisibility, Primes, GCD
- Reading: Lecture Slides - Divisibility, Primes, GCD
- Reading: Video - Adam Spencer: Why I fell in love with monster prime numbers
- Reading: L16: Additional Reference Material
- Видео: Modular Arithmetic
- Reading: Lecture Slides - Modular Arithmetic
- Reading: L17: Additional Reference Material
- Видео: Multiplicative Inverses
- Reading: Lecture Slides - Multiplicative Inverses
- Reading: L18: Additional Reference Material
- Видео: Extended Euclidean Algorithm
- Reading: Lecture Slides - Extended Euclidean Algorithm
- Reading: L19: Additional Reference Material
- Practice Quiz: Practice Assessment - Integer Foundation
- Discussion Prompt: What do you think?
Оцениваемый: Graded Assessment - Integer Foundation
НЕДЕЛЯ 2
Modular Exponentiation
A more in-depth understanding of modular exponentiation is crucial to understanding cryptographic mathematics. In this module, we will cover the square-and-multiply method, Eulier's Totient Theorem and Function, and demonstrate the use of discrete logarithms. After completing this module you will be able to understand some of the fundamental math requirement for cryptographic algorithms. You will also have a working knowledge of some of their applications.
4 видео, 9 материала для самостоятельного изучения, 1 тренировочный тест
- Reading: Lecture Slides - Square-and-Multiply
- Reading: Video - Modular exponentiation made easy
- Reading: L20: Additional Reference Material
- Видео: Euler's Totient Theorem
- Reading: Lecture Slide - Euler's Totient Theorem
- Reading: L21: Additional Reference Material
- Видео: Eulers Totient Function
- Reading: Lecture Slide - Eulers Totient Function
- Reading: L22: Additional Reference Material
- Видео: Discrete Logarithms
- Reading: Lecture Slide - Discrete Logarithms
- Reading: L23: Additional Reference Material
- Practice Quiz: Practice Assessment - Modular Exponentiation
- Discussion Prompt: What do you think?
Оцениваемый: Graded Assessment - Modular Exponentiation
НЕДЕЛЯ 3
Chinese Remainder Theorem
The modules builds upon the prior mathematical foundations to explore the conversion of integers and Chinese Remainder Theorem expression, as well as the capabilities and limitation of these expressions. After completing this module, you will be able to understand the concepts of Chinese Remainder Theorem and its usage in cryptography.
3 видео, 5 материала для самостоятельного изучения, 1 тренировочный тест
- Reading: Lecture Slide - CRT Concepts, Integer-to-CRT Conversions
- Reading: L24: Additional Reference Material
- Видео: Moduli Restrictions, CRT-to-Integer Conversions
- Reading: Lecture Slide - Moduli Restrictions, CRT-to-Integer Conversions
- Видео: CRT Capabilities and Limitations
- Reading: Lecture Slide - Moduli Restrictions, CRT-to-Integer Conversions
- Reading: Video - How they found the World's Biggest Prime Number - Numberphile
- Practice Quiz: Practice Assessment - Chinese Remainder Theorem
- Discussion Prompt: What do you think?
Оцениваемый: Graded Assessment - Chinese Remainder Theorem
НЕДЕЛЯ 4
Primality Testing
Finally we will close out this course with a module on Trial Division, Fermat Theorem, and the Miller-Rabin Algorithm. After completing this module, you will understand how to test for an equality or set of equalities that hold true for prime values, then check whether or not they hold for a number that we want to test for primality.
3 видео, 8 материала для самостоятельного изучения, 1 тренировочный тест
- Reading: Lecture Slide - Trial Division
- Reading: L27: Additional Reference Material
- Видео: Fermat's Primality
- Reading: Lecture Slide - Fermat's Primality
- Reading: L28: Additional Reference Material
- Видео: Miller-Rabin
- Reading: Lecture Slide - Miller-Rabin
- Reading: Video - James Lyne: Cryptography and the power of randomness
- Reading: L29: Additional Reference Material
- Practice Quiz: Practice Assessment - Primality Testing
- Discussion Prompt: What do you think?
- Reading: The Science of Encryption
Оцениваемый: Graded Assessment - Primality Testing
Оцениваемый: Course Project
Часто задаваемые вопросы
Как это работает
Coursework
Each course is like an interactive textbook, featuring pre-recorded videos, quizzes and projects.
Help from Your Peers
Connect with thousands of other learners and debate ideas, discuss course material, and get help mastering concepts.
Certificates
Earn official recognition for your work, and share your success with friends, colleagues, and employers.
Авторы
University of Colorado System
The University of Colorado is a recognized leader in higher education on the national and global stage. We collaborate to meet the diverse needs of our students and communities. We promote innovation, encourage discovery and support the extension of knowledge in ways unique to the state of Colorado and beyond.
Стоимость
| Приобрести курс | |
|---|---|
| Получить доступ к материалам курса | Доступен |
| Получить доступ к оцениваемым материалам курса | Доступен |
| Получить итоговую оценку | Доступен |
| Earn a shareable Course Certificate | Доступен |
Рейтинги и отзывы
Coursera делает лучшее в мире образование доступным каждому, предлагая онлайн-курсы от ведущих университетов и организаций.
© Coursera Inc., 2018 Все права защищены.
