Course Content

Other Courses

Tribhuvan university CSIT 2065 Syllabus Introduction to Cryptography Old Questions 2073

Introduction to Cryptography - Old Questions

Question Answer Details
Syllabus Notes Old Questions Unit Wise Questions Question Bank

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

Answer

Back to Question Paper
AI Generated Answer

AI is thinking...