Introduction to Cryptography 2068

Tribhuwan University
Institute of Science and Technology
2068
Bachelor Level / Fifth Semester / Science
Computer Science and Information Technology ( CSC-313 )
( Introduction to Cryptography )
Full Marks: 60
Pass Marks: 24
Time: 3 hours
Candidates are required to give their answers in their own words as far as practicable.
The figures in the margin indicate full marks.

Attempt all questions.

1.  Answer the following questions in short (Any Five).                                         (5 × 2 = 10) 

        a. All classical ciphers are based on symmetric key encryption. What does that mean?

2 marks view

        b. What makes Vigenere cipher more secure than say, the Playfair cipher?

2 marks view

        c. AES is a block cipher. What sized blocks are used by AES?

2 marks view

        d. When does a set become a group?

2 marks view

        e. What is the difference between the notation a mod n and the notation a ≡ b (mod n)?

2 marks view

        f. What is the difference between a virus and a worm?

2 marks view

        g. How do you define a prime number? When are two numbers A and B considered to be coprimes?

2 marks view

2.     a) What do you mean by a "Feistel Structure for Block Ciphers"? Explain.                     (5) 

5 marks view

        b) Divide 23x2 + 4x + 3 by 5x + c, assuming that the polynomials are over the field Z7.      (5)    

5 marks view

            OR

What are the asymmetries between the modulo n addition and modulo n multiplication over Zn

5 marks view

3.     a) Describe the ''mix columns'' transformation that constitutes the third step in each round of AES.                                                                                                                              (5)

5 marks view

      b) What is the difference between algorithmically generated random numbers and true random numbers?                                                                                                                   (5)

5 marks view

4.     a) Miller-Rabin algorithm for primality testing is based on a special decomposition of odd  numbers. What is that? Explain                                                                                         (5) 

5 marks view

     b) In RSA algorithm, the necessary condition for the encryption key e is that it be coprime  to the totient of the modulus. But, in practice, what is e typically set to and why?            (5) 

5 marks view

5.     a) What is meant by the strong collision resistance property of a hash function?               (5) 

5 marks view

        b) How can public-key cryptography be used for document authentication?                     (5)

OR

       What seems so counterintuitive about the counter mode (CTR) for using a block cipher?

5 marks view

6.     a) What is the role of the SSL Record Protocol in SSL/TLS? Explain.                              (5)

OR

How many layers are in the TCP/IP protocol suite for internet communications? Name the  layers. Name some of the protocols in each layer. 
5 marks view

    b) What does PGP stand for? What is it used primarily for? And what are the five services provided by the PGP protocol? 

5 marks view