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.
제공자:
이 강좌에 대하여
최근 조회 14,819회
공유 가능한 수료증
완료 시 수료증 획득
100% 온라인
지금 바로 시작해 나만의 일정에 따라 학습을 진행하세요.
다음 특화 과정의 4개 강좌 중 2번째 강좌:
유동적 마감일
일정에 따라 마감일을 재설정합니다.
초급 단계
완료하는 데 약 14시간 필요
영어
자막: 영어, 스페인어
공유 가능한 수료증
완료 시 수료증 획득
100% 온라인
지금 바로 시작해 나만의 일정에 따라 학습을 진행하세요.
다음 특화 과정의 4개 강좌 중 2번째 강좌:
유동적 마감일
일정에 따라 마감일을 재설정합니다.
초급 단계
완료하는 데 약 14시간 필요
영어
자막: 영어, 스페인어
제공자:
콜로라도 대학교
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.
강의 계획 - 이 강좌에서 배울 내용
완료하는 데 4시간 필요
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.
완료하는 데 4시간 필요
5개 동영상 (총 60분), 10 개의 읽기 자료, 2 개의 테스트
5개의 동영상
Divisibility, Primes, GCD14m
Modular Arithmetic15m
Multiplicative Inverses12m
Extended Euclidean Algorithm13m
10개의 읽기 자료
Course Introduction10m
Lecture Slides - Divisibility, Primes, GCD10m
Video - Adam Spencer: Why I fell in love with monster prime numbers15m
L16: Additional Reference Material10m
Lecture Slides - Modular Arithmetic10m
L17: Additional Reference Material10m
Lecture Slides - Multiplicative Inverses10m
L18: Additional Reference Material10m
Lecture Slides - Extended Euclidean Algorithm10m
L19: Additional Reference Material10m
2개 연습문제
Practice Assessment - Integer Foundation30m
Graded Assessment - Integer Foundation30m
완료하는 데 4시간 필요
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시간 필요
4개 동영상 (총 51분), 9 개의 읽기 자료, 2 개의 테스트
4개의 동영상
Euler's Totient Theorem16m
Eulers Totient Function12m
Discrete Logarithms15m
9개의 읽기 자료
Lecture Slides - Square-and-Multiply10m
Video - Modular exponentiation made easy10m
L20: Additional Reference Material10m
Lecture Slide - Euler's Totient Theorem10m
L21: Additional Reference Material10m
Lecture Slide - Eulers Totient Function10m
L22: Additional Reference Material10m
Lecture Slide - Discrete Logarithms10m
L23: Additional Reference Material10m
2개 연습문제
Practice Assessment - Modular Exponentiation30m
Graded Assessment - Modular Exponentiation30m
완료하는 데 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시간 필요
3개 동영상 (총 25분), 5 개의 읽기 자료, 2 개의 테스트
3개의 동영상
Moduli Restrictions, CRT-to-Integer Conversions10m
CRT Capabilities and Limitations8m
5개의 읽기 자료
Lecture Slide - CRT Concepts, Integer-to-CRT Conversions30m
L24: Additional Reference Material10m
Lecture Slide - Moduli Restrictions, CRT-to-Integer Conversions30m
Lecture Slide - Moduli Restrictions, CRT-to-Integer Conversions30m
Video - How they found the World's Biggest Prime Number - Numberphile12m
2개 연습문제
Practice Assessment - Chinese Remainder Theorem30m
Graded Assessment - Chinese Remainder Theorem30m
완료하는 데 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.
완료하는 데 4시간 필요
3개 동영상 (총 36분), 8 개의 읽기 자료, 3 개의 테스트
8개의 읽기 자료
Lecture Slide - Trial Division10m
L27: Additional Reference Material10m
Lecture Slide - Fermat's Primality10m
L28: Additional Reference Material10m
Lecture Slide - Miller-Rabin10m
Video - James Lyne: Cryptography and the power of randomness10m
L29: Additional Reference Material10m
The Science of Encryption10m
3개 연습문제
Practice Assessment - Primality Testing30m
Graded Assessment - Primality Testing30m
Course Project30m
검토
MATHEMATICAL FOUNDATIONS FOR CRYPTOGRAPHY의 최상위 리뷰
AS 제공2020년 5월 1일
I enrolled for this course because Number Theory is my area of interest. This course has helped me to spend my time effectively during this lockdown period. Thank you Coursera.
CJ 제공2020년 7월 27일
Helped me a lot, i was using several algorithms without knowing the math behind them, know i understand a little more thanks to the course, thanks guys
SM 제공2020년 5월 21일
It was an awesome course, I found the idea of cryptography deeply. After 10 years I fullfilled one of my dream.
VT 제공2020년 7월 28일
The course content and the assignments were quite meticulously designed and delivered efficiently.
Introduction to Applied Cryptography 특화 과정 정보
Cryptography is an essential component of cybersecurity. The need to protect sensitive information and ensure the integrity of industrial control processes has placed a premium on cybersecurity skills in today’s information technology market. Demand for cybersecurity jobs is expected to rise 6 million globally by 2019, with a projected shortfall of 1.5 million, according to Symantec, the world’s largest security software vendor. According to Forbes, the cybersecurity market is expected to grow from $75 billion in 2015 to $170 billion by 2020. In this specialization, students will learn basic security issues in computer communications, classical cryptographic algorithms, symmetric-key cryptography, public-key cryptography, authentication, and digital signatures. These topics should prove useful to those who are new to cybersecurity, and those with some experience.
자주 묻는 질문
강의 및 과제를 언제 이용할 수 있게 되나요?
이 전문 분야를 구독하면 무엇을 이용할 수 있나요?
Is financial aid available?
궁금한 점이 더 있으신가요? 학습자 도움말 센터를 방문해 보세요.
