Scribd
Upload
9 views3 pages

Cryptography 2022

This document outlines the examination structure for a B.E. degree in Computer Science and Engineering, focusing on Cryptography. It includes various parts with questions on security services, encryption algorithms, and cryptographic techniques, along with specific instructions for answering. The exam is designed to assess knowledge across multiple topics within the field of cryptography.

Uploaded by

alwin
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
9 views3 pages

Cryptography 2022

This document outlines the examination structure for a B.E. degree in Computer Science and Engineering, focusing on Cryptography. It includes various parts with questions on security services, encryption algorithms, and cryptographic techniques, along with specific instructions for answering. The exam is designed to assess knowledge across multiple topics within the field of cryptography.

Uploaded by

alwin
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Name of the Candidate: Reg. No.

:
18CSPB0
B.E. DEGREE– APRIL 2022 –EXAMINATIONS
BRANCH: COMPUTER SCIENCE AND ENGINEERING
CRYPTOGRAPHY
Duration : 3Hours Maximum: 100 Marks
SPECIAL INSTRUCTIONS: Data sheets for AES and DES to be provided.
Answer All Questions
PART – A (10 x 2 =20) CO Marks
A1. Define non-repudiation security service. CO1 (2)
A2. List the various security mechanisms. CO1 (2)
A3. Explain one-time pad encryption algorithm. CO1 (2)
A4. Recite Fermat’s theorem. CO2 (2)
A5. Give example for groups, rings and fields. CO2 (2)
A6. Describe cipher block chaining mode. CO3 (2)
A7. Differentiate stream cipher and block cipher. CO3 (2)
A8. Describe the steps in RC4 key stream generation. CO4 (2)
A9. Memorize the concept of cryptographic primitives used in bitcoin transactions . CO6 (2)
A10. Describe dual signature in SET. CO6 (2)

PART – B (4 x 5 =20) CO Marks


B1. Explain the security services of OSI security architecture. CO1 (5)
B2. Discuss the various types of transposition cipher with example. CO2 (5)
B3. Describe how PGP provides confidentiality and authentication service for e-mail CO6 (5)
applications.
B4. Explain the steps in Secure Socket Layer (SSL) Handshake protocol. CO6 (5)

PART – C (4 x 15 =60) CO Marks


C1. a. i)Compute the greatest common divisor of (300,42 )and the value of s and t CO2 (8)
using extended Euclidean algorithm,.
ii)Calculate the multiplicative inverse of the 23 in Z100 using extended
Euclidean algorithm .
b. Show the result of multiplying P1=(X3+X2+X+1) by P2= (X2+1) in GF(2^4) CO2 (7)
with irreducible polynomial (X4+X3+1).
(OR)
C2. a. Use Hill Cipher algorithm to encrypt the message “ATTACKATDAWN” using CO2 (8)
the given key values:

Show the necessary calculations.


b. Illustrate Miller Rabin primality testing algorithm and find if 561 is a prime CO2 (7)
number or not
CONTD.,
C3. Compute the values of next round of Data Encryption Standard with the following CO3 (15)
input values :
C7=1111000 0000000 1000000 0001111
D7=0000000 1100101 0010100 1010000
L7=1011 0110 1110 1100 0100 0011 0101 1011
R7=0100 0010 0011 0100 1001 1000 1001 1111
(OR)
C4. The input plain text matrix and key matrix for Advanced Encryption Standard are CO3 (15)
as follows:

Plain text:
4D 41 4E 54

45 47 43 49

53 45 52 4F

53 45 50 4E

54 53 50 31 Key :
45 43 49 32

41 4F 41 33

4D 52 4E 34

Compute the output in each of the following stages:


i) AddRoundKey.
ii) SubBytes.
iii) ShiftRows.
iv) Mix columns (two columns)

C5. Solve the following using Elliptic curve cryptography: CO4 (15)
Given : In the elliptic curve E(1,1) over the GF(11)
i) Find the equation of the curve.
ii) Find all the points on the curve.
iii) Check if the point (3,8) falls on the curve.
iv) Encrypt the plain text (4,6).
v) Calculate the public key and the private key.
(OR)
C6. a. Alice and Bob use the Diffie–Hellman key exchange technique with a common CO4 (8)
prime q = 7 and a primitive root a = 15.
i. Calculate the public key YA, if Alice has a private key XA = 6.
ii. Calculate the public key YB, if Bob has a private key XB = 4.
iii. Compute the shared secret key between Alice and Bob.
b. In a RSA cryptosystem, user A uses two prime numbers p = 13 and q = 17 to CO4 (7)
generate her public and private keys. Calculate the private key of A, if the
public key of A is 35 and encrypt the plain text message m=15.

C7. a. In order to ensure security while transactions it is essential to authenticate CO5 (10)
the message before communication using any signing algorithm and verify
the same at receiver side .Show how digital signature can be generated
using DSS with the following parameters and verify the signature.
H(m)=3,h=2
P=7,q=3,k=2,x=5
b. Demonstrate the various ways in which a hash code can be used to provide CO5 (5)
message authentication for Symmetric key encryption to ensure
confidentiality and authentication.
(OR)
C8. Authentication of a computer program in plaintext is an attractive service. The CO5 (15)
computer program can be executed without having to decrypt it every time, which
would be wasteful of processor resources. However, if a message authentication
code were attached to the program, it could be checked whenever assurance was
required of the integrity of the program. Demonstrate the use of Message
authentication code using various stages of MD5 algorithm for the above scenario.

***************

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy