Introduction to Cryptography - Old Questions
2. a) Describe Extended Euclidean Algorithm. Use this algorithm to test whether any two number n1, n2 are co-prime or not?
4 marks
|
Asked in 2073