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.
이 강좌는 Introduction to Applied Cryptography 전문 분야의 일부입니다.
Mathematical Foundations for Cryptography
4.6
(53개의 평가)
2,474명이 이미 등록했습니다!
제공자:
강의 계획 - 이 강좌에서 배울 내용
주
1완료하는 데 3시간 필요
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 videos (Total 60 min), 10 readings, 2 quizzes
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 Foundation18m
Graded Assessment - Integer Foundation16m
주
2완료하는 데 3시간 필요
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 videos (Total 51 min), 9 readings, 2 quizzes
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 Exponentiation12m
Graded Assessment - Modular Exponentiation20m
주
3완료하는 데 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 videos (Total 25 min), 5 readings, 2 quizzes
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 Theorem12m
Graded Assessment - Chinese Remainder Theorem20m
주
4완료하는 데 3시간 필요
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 videos (Total 36 min), 8 readings, 3 quizzes
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 Testing12m
Graded Assessment - Primality Testing20m
Course Project8m
강사
William Bahn
LecturerComputer Science
Richard White
Assistant Research ProfessorComputer Science
Sang-Yoon Chang
Assistant ProfessorComputer Science
콜로라도 대학교 정보
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.
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.
자주 묻는 질문
강의 및 과제를 언제 이용할 수 있게 되나요?
강좌에 등록하면 바로 모든 비디오, 테스트 및 프로그래밍 과제(해당하는 경우)에 접근할 수 있습니다. 상호 첨삭 과제는 이 세션이 시작된 경우에만 제출하고 검토할 수 있습니다. 강좌를 구매하지 않고 살펴보기만 하면 특정 과제에 접근하지 못할 수 있습니다.
이 전문 분야를 구독하면 무엇을 이용할 수 있나요?
강좌를 등록하면 전문 분야의 모든 강좌에 접근할 수 있고 강좌를 완료하면 수료증을 취득할 수 있습니다. 전자 수료증이 성취도 페이지에 추가되며 해당 페이지에서 수료증을 인쇄하거나 LinkedIn 프로필에 수료증을 추가할 수 있습니다. 강좌 내용만 읽고 살펴보려면 해당 강좌를 무료로 청강할 수 있습니다.
환불 규정은 어떻게 되나요?
재정 지원을 받을 수 있나요?
궁금한 점이 더 있으신가요? 학습자 도움말 센터를 방문해 보세요.
Coursera는 세계 최고의 교육에 대한 보편적인 접근 기회를 제공하며,
최고의 대학 및 기관들과 제휴하여 온라인 강좌를 제공합니다.
© 2019 Coursera Inc. All rights reserved.
