Course Content

Other Courses

Tribhuvan university CSIT 2074 Syllabus Cryptography Old Questions 2076 (new)

Cryptography - Old Questions

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

2. State the Fermat's theorem with example. Given the prime number p=29 and the primitive root g=8, private key of sender with X=9  and random integer K=11, encrypt the message m=13 using Elgamal cryptosystem.

10 marks
Asked in 2076 (new)

Answer

Back to Question Paper
AI Generated Answer

AI is thinking...