Euclidean Algorithm in Cryptography: Finding the GCD of Two Numbers
This video explains the Euclidean Algorithm and how to determine the greatest common divisor (GCD) of two numbers, with applications in cryptography.
Sahil Mahajan
296 views • Sep 24, 2023
About this video
In this video, we will be discussing about the Euclidean Algorithm. How can you find the GCD of two numbers using the Euclidean Algorithm.
Answers to the question in the video -
1. gcd(60, 24) = 12
2. fcd(1160718174, 316258250) = 1078
#cryptography #euclidean #cybersecurity
Answers to the question in the video -
1. gcd(60, 24) = 12
2. fcd(1160718174, 316258250) = 1078
#cryptography #euclidean #cybersecurity
Video Information
Views
296
Likes
4
Duration
12:07
Published
Sep 24, 2023