Encryption and decryption Using Prime numbers-The RSA algorithm
0( 0 REVIEWS )
0 STUDENTS
Instructors
Course Curriculum
| Mathematical tools required to understand the algorithm | |||
| Modulo Arithmetic (Lecture 1) | 00:00:00 | ||
| Congruence Modulo(lecture 2) | 00:00:00 | ||
| Properties of congruence | 00:00:00 | ||
| Properties of the Euler totient function | 00:08:00 | ||
| Proving divisibility using modular arithmetic | 00:05:00 | ||
| Problems for finding remainders | 00:00:00 | ||
| Another interesting problem in congruence | 00:05:00 | ||
| Introduction | |||
| Euler totient function | 00:10:00 | ||
| Idea of encryption and decryption to send data | 00:08:00 | ||
Instructor Details
Popular Courses
Class 12 Regular Maths
Apply to enroll 83Class 11 Regular Maths
Apply to enroll 61Class 11 Applied Mathematics
Apply to enroll 13
