Course Content

Other Courses

Tribhuvan university > CSIT - 2065 Syllabus > Introduction to Cryptography > Old Questions > 2070

Introduction to Cryptography - Old Questions

Syllabus Notes Old Questions Unit Wise Questions Question Bank

2.     a) What is Euclid’s algorithm for finding the GCD of two numbers? Explain.                (5)

OR

What is Euler’s theorem? What is the totient of a prime number? 

5 marks | Asked in 2070