RiseUpp Logo
Educator Logo

Number Theory and Cryptography

This course is part of Introduction to Discrete Mathematics for Computer Science.

This course cannot be purchased separately - to access the complete learning experience, graded assignments, and earn certificates, you'll need to enroll in the full Introduction to Discrete Mathematics for Computer Science Specialization program. You can audit this specific course for free to explore the content, which includes access to course materials and lectures. This allows you to learn at your own pace without any financial commitment.

4.5

(595 ratings)

38,144 already enrolled

English

پښتو, বাংলা, اردو, 3 more

Powered by

Provider Logo
Number Theory and Cryptography

This course includes

16 Hours

Of Self-paced video lessons

Beginner Level

Completion Certificate

awarded on course completion

Free course

What you'll learn

  • Understand and apply fundamental concepts of number theory

  • Implement basic cryptographic algorithms using Python

  • Master modular arithmetic and its applications

  • Analyze and apply the RSA cryptosystem

  • Develop skills in mathematical proof and algorithm analysis

Skills you'll gain

Number Theory
Cryptography
RSA Algorithm
Modular Arithmetic
Python Programming
Cryptographic Protocols
Mathematical Proofs
Algorithm Analysis
Digital Security
Encryption

This course includes:

4.5 Hours PreRecorded video

26 assignments

Access on Mobile, Tablet, Desktop

FullTime access

Shareable certificate

Closed caption

Get a Completion Certificate

Share your certificate with prospective employers and your professional network on LinkedIn.

Certificate

Top companies offer this course to their employees

Top companies provide this course to enhance their employees' skills, ensuring they excel in handling complex projects and drive organizational success.

icon-0icon-1icon-2icon-3icon-4

There are 4 modules in this course

This comprehensive course explores the fascinating intersection of number theory and cryptography, starting with fundamental concepts in modular arithmetic and progressing to advanced topics in modern cryptographic systems. Students learn the mathematical foundations of secure communication, including the RSA algorithm, while developing practical skills through hands-on programming assignments in Python. The course combines theoretical knowledge with real-world applications, making complex cryptographic concepts accessible to beginners.

Modular Arithmetic

Module 1 · 4 Hours to complete

Euclid's Algorithm

Module 2 · 3 Hours to complete

Building Blocks for Cryptography

Module 3 · 4 Hours to complete

Cryptography

Module 4 · 4 Hours to complete

Fee Structure

Individual course purchase is not available - to enroll in this course with a certificate, you need to purchase the complete Professional Certificate Course. For enrollment and detailed fee structure, visit the following: Introduction to Discrete Mathematics for Computer Science

Instructors

Distinguished Computer Scientist and Algorithms Expert

Alexander S. Kulikov serves as a visiting professor at the University of California, San Diego, and a leading research fellow at the Steklov Institute of Mathematics in St. Petersburg. His academic journey includes earning his Ph.D. in 2009 and Dr.Sci. in 2017 from the St. Petersburg Department of Steklov Institute of Mathematics. His research focuses on algorithms for NP-hard problems and circuit complexity, with significant contributions to computational complexity theory and algorithm design. He has authored several influential educational resources, including "Learning Algorithms Through Programming and Puzzle Solving" and co-created major online courses on platforms like Coursera and edX. His teaching experience spans more than eight years, during which he has developed innovative approaches to algorithms education. Currently at JetBrains as a researcher, he continues to advance the field through his work on algorithmic problem-solving and computational complexity, while maintaining his academic connections through his visiting professorship at UCSD and research position at Steklov Institute.

Michael Levin
Michael Levin

7 Courses

Distinguished Data Scientist and Algorithms Expert

Michael Levin serves as Chief Data Scientist at Yandex.Market, Russia's leading price comparison and online shopping service, while also maintaining a position as Lecturer in Computer Science at the National Research University Higher School of Economics since 2015. His academic excellence began at Moscow State University, where he earned his degree in mathematics and achieved both silver and bronze medals at the ACM ICPC World Finals as part of the university's team. His expertise in algorithms, machine learning, and data science has made him a prominent figure in both industry and education, leading to his role as an instructor for the University of California San Diego's online courses in algorithms and data structures, which have reached over 345,000 students worldwide. His teaching portfolio includes comprehensive courses in algorithmic design, graph algorithms, string processing, and advanced complexity theory, making him a influential figure in computer science education while maintaining his leadership role in one of Russia's largest tech companies.

Number Theory and Cryptography

This course includes

16 Hours

Of Self-paced video lessons

Beginner Level

Completion Certificate

awarded on course completion

Free course

Testimonials

Testimonials and success stories are a testament to the quality of this program and its impact on your career and learning journey. Be the first to help others make an informed decision by sharing your review of the course.

Frequently asked questions

Below are some of the most commonly asked questions about this course. We aim to provide clear and concise answers to help you better understand the course content, structure, and any other relevant information. If you have any additional questions or if your question is not listed here, please don't hesitate to reach out to our support team for further assistance.