Department of Computer science and Engineering

TEST-III (Assignment Examination)

COURSE NAME: Information Assurance & Security

COURSE CODE: 15CS3112

Note: each question carries 10Marks, one question from each group will
be given in the Question paper

Group-I
1. Choose GF(23) with elements {0,1,g,g2,g3,g4,g5,g6} using the irreducible
polynomial of g(x)=g3+g+1 g3 is computed as g3=g+1. Similarly calculate
the values of the remaining elements. Justify why the above computation
is not required for g and g 2.(Behrouz A Forouzan,3edition Page Number
287)

2. Using the elliptic Curve y2+xy=x3+g3x2+1, with a=g3 and b=1, Justify the
below points lie on the elliptic curve. Use the irreducible polynomial
g(x)=g3+g+1. .(Behrouz A Forouzan,3edition, Page Number 287)
a. (g2,1)
b. (g3,g2)
c. (g5,g4)

3. Illustrate with a neat Sketch and explain in keen the step by step process
of Elliptic curve cryptography simulating Elgamal. .(Behrouz A
Forouzan,3edition, Page Number 288)

4. Find R= P+Q,
Where P= (0, 1), Q= (g2,1) and a=g3 and b=1 using irreducible polynomial
g(x)=g3+g+1.(Behrouz A Forouzan,3edition, Page Number 288)

5. Find R= P+Q
Where P=(3,10), Q=(9,7),P=23, a=1,b=1 .(Behrouz A Forouzan,3edition,
Page Number 286)
 6. An Elliptic Curve E13(1,1), the equation is y2=x3+x+1 and the calculation
is done modulo 13.
Justify the following points lie on the elliptic curve or not. .(Behrouz A
Forouzan,3edition, Page number 286)
a. (1,4)
b. (8,1)
c. (11,12)
d. (10,6)

Group-II

RefernceBook :

Titile:Cryptography and Network security

Author: Behrouz A. Forouzan, DebdeepMukhopadhyay

Edition : 2

Publisher:McGrawHill

Page Nos : 345 -355

1.(a) In SHA-512, show the value of length field in hexadecimal if the message
length is 1000 bits (P.No:354)

(b)What is the padding for SHA-512 if the length of the message is 6143 bits
(P.No:355)

(c ) If the left most hexa decimal digits of buffers A,B and C are 0x7, 0xA and
0XE respectively. What is the output of the left most digit of Majority Function.

2.(a) In SHA-512, show the value of length field in hexadecimal if the message
length is 10000 bits (P.No:354)

(b)What is the padding for SHA-512 if the length of the message is 5121 bits
(P.No:355)

(c )) If the left most hexa decimal digits of buffers E,F and G are 0x9, 0xA and
0XF respectively. What is the output of the left most digit of Conditional
Function.
3.(a) In SHA-512, show the value of length field in hexadecimal if the message
length is 1000000 bits(P.No:354)

(b)What is the padding for SHA-512 if the length of the message is 5120 bits
(P.No:355)

(c ) Find the result of RotR12(x) if x= 1234 5678 ABCD 2345 34564 5678 ABCD
2468

4.(a) What is the minimum and maximum number of padding bits that can be
added to a message SHA-512.(P.No:347)

(b) Show how W60 is made in SHA-512.(P.No:347)

(c ) Find the result of ShL12(x) if x= 1234 5678 ABCD 2345 34564 5678 ABCD
2468(P.No:355)

5.(a) State and explain the security requirements for cryptographic hash
functions( cryptography network security-5th edition P.no335)

(b) state and explain Two simple Hash functions(cryptography network

security-5th edition P.no333)

6.(a) Find the result of Majority(x,y,z) if

X = 1234 5678 ABCD 2345 34564 5678 ABCD 2468

Y=2234 5678 ABCD 2345 34564 5678 ABCD 2468

Z=3234 5678 ABCD 2345 34564 5678 ABCD 2468

(b)Show that if two messages are the same, their last blocks are also the same
in case of SHA512.

Group -III
1. When a combination of symmetric encryption and an error control code
is used for message authentication, in what order must the two
functions be performed? (10Marks)
 Page Nos:365 to 369 Text Book: cryptography and network security
principles and practice 5th edition-William Stallings

2. How Message Authentication and Confidentiality be achieved using

Message Authentication Code(MAC),represent the same in the form of a
diagram and discuss it in detail. (10Marks)

Page Nos:370 to 372 Text Book: cryptography and network security

principles and practice 5th edition-William Stallings

3. The respective figure shows an alternative means of implementing

HMAC.
a. Describe the operation of this implementation.
b. What potential benefit does this implementation have over that
general HMAC Structure?

Page Nos: 94,Network Security Essentials: Applications And Standards

Fourth Edition-William Stallings
4. Illustrate the Pseudo random number generation using Hash Functions
and MACS ?a.) Relate the PRNG with Crypotographic Hash Function
and HMAC?
b.) List three PRNGs based on HMAC

Page Nos:413 to 416 Text Book: Cryptography and Network Security

Principles and Practice 5th edition-William Stallings

5. How can MACs based on block ciphers can be constructed? Compare

with DAA and CMAC with relevant diagrams?(10 M)
Page Nos:404 to 407 Text Book: Cryptography and Network Security
Principles and Practice 5th edition-William Stallings

6. Explain how the authenticated encryption is achieved through CCM and

GCM?(10M)
Page Nos:407 to 413 Text Book: Cryptography and Network Security
Principles and Practice 5th edition-William Stallings

Signature of Course coordinator signature of HOD

Signature of vetting member