0% found this document useful (0 votes)
32 views8 pages

NSP Exam Syllabus for Cryptography

The document discusses cryptography and network security topics for a university exam. It contains questions about cryptographic algorithms, protocols, and concepts like AES, RSA, digital signatures, and IPsec.

Uploaded by

ASHNA A
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
0% found this document useful (0 votes)
32 views8 pages

NSP Exam Syllabus for Cryptography

The document discusses cryptography and network security topics for a university exam. It contains questions about cryptographic algorithms, protocols, and concepts like AES, RSA, digital signatures, and IPsec.

Uploaded by

ASHNA A
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

Scanned with CamScanner

Scanned with CamScanner


E G7907 Pages: 2

Reg No.:_______________ Name:__________________________

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY


SEVENTH SEMESTER [Link] DEGREE EXAMINATION, DECEMBER 2018
Course Code: CS409
Course Name: CRYPTOGRAPHY AND NETWORK SECURITY
Max. Marks: 100 Duration: 3 Hours

PART A
Answer all questions, each carries 4 marks. Marks

1 Differentiate between computationally secure cipher and unconditionally secure (4)


cipher. Write examples with reasoning.
2 Encrypt the message “this is an exercise” using the additive Cipher with key=20 (4)
3 What is the necessity of block cipher modes of operation? List out the (4)
advantages and disadvantages of output feedback mode.
4 Generate the key attributes for the values p = 11 and q = 3. Also encrypt the (4)
message m = 2 with the generated keys.
5 Find gcd (1970, 1066) (4)
6 Discuss digital signature scheme using RSA (4)
7 Write the general structure of Private Key Ring used in Pretty Good Privacy (4)
(PGP).
8 What are the functionalities provided by Secure MIME (S/MIME)? (4)
9 What is the significance of Alert Protocol in Transport Layer Security? (4)
10 Why the attacker is not able to recognize the actual sender of the message in (4)
encrypted tunnels?

PART B
Answer any two full questions, each carries 9 marks.

11 a) Use Playfair Cipher with key COMPUTER to encrypt the message (5)
“CRYPTOGRAPHY”.
b) How key generation is done in DES. (4)
12 a) Discuss the stream cipher RC4 in detail (4)
b) Illustrate the round transformation of IDEA. (5)
13 a) Encrypt the text “LOVE” using Hill Cipher with the key 9 4 (4)
5 7
b) Illustrate S box creation in AES (5)

Page 1of 2
E G7907 Pages: 2

PART C
Answer any two full questions,each carries 9 marks.

14 a) Define Euler’s Totient Function. Prove that, ɸ(pq) = (p-1)(q-1), where p and q (5)
are prime numbers.
b) Demonstrate Diffie Hellman Key exchange algorithm. (4)
15 Illustrate the working of SHA-1 with diagrams. (9)
16 a) What are the Security Requirements of message authentication? (4)
b) Give the encryption/decryption procedures using Elliptic Curve Cryptography. (5)

PART D
Answer any two full questions, each carries 12 marks.

17 a) Explain the sequence of steps involved in the message generation and reception (8)
in Pretty Good Privacy (PGP) with block diagrams.
b) List out the security association (SA) parameters in IPSec. (4)
18 a) Illustrate the working of Secure Electronic Transaction (SET) in detail. (8)
b) Compare Packet filter and Application Level Gateways. (4)
19 a) Explain the method of protecting IP datagram from replay attack using IPsec. (6)
b) Explain the sequence of steps used in Secure Socket Layer handshake Protocol (6)
for establishing a new session. Draw a diagram which shows the action of
Handshake Protocol.
****

Page 2of 2
E G1102 Pages: 2

Reg No.:_______________ Name:__________________________


APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
SEVENTH SEMESTER [Link] DEGREE EXAMINATION(S), MAY 2019
Course Code: CS409
Course Name: CRYPTOGRAPHY AND NETWORK SECURITY
Max. Marks: 100 Duration: 3 Hours

PART A
Answer all questions, each carries 4 marks. Marks

1 How the nonlinearity is achieved in DES. (4)


2 Differentiate Confusion and Diffusion. (4)
3 Discuss the key expansion procedure in AES (4)
4 State and prove Fermat’s Theorem (4)
5 In a public key system using RSA, you intercept the cipher text C=8 sent to a user (4)
whose public key is e=13, n=33. What is the plain text M?
6 Compare the strength of MAC and Encryption against brute-force attack (4)
7 Give the header format of ESP in IPSec (4)
8 Give the authentication methods used in Oakley algorithm (4)
9 What are the services provided by Record Layer Protocol for Secure Socket (4)
Layer connections?
10 What are the characteristic features of stateful inspection firewall? (4)
PART B
Answer any two full questions, each carries 9 marks.
11 a) Differentiate between monoalphabetic ciphers and polyalphabetic ciphers (5)
and give one example for each.
b) Give different techniques used in steganography (4)
12 a) How key generation is performed in IDEA (4)
b) Discuss Mix Column transformation in AES (5)
13 a) Using rail fence cipher, encrypt the text meet me after the toga party using the (4)
key 4 3 1 2 5 6 7.
b) Illustrate inverse S box creation in AES. (5)
PART C
Answer any two full questions, each carries 9 marks.
14 a) Find gcd(240, 46) using Extended Euclid’s Algorithm (4)
b) Discuss the key exchange procedure using Elliptic Curves. (5)

Page 1of 2
E G1102 Pages: 2

15 Illustrate MD 5 hash algorithm in detail (9)


16 a) Consider a Diffie Hellman scheme with a common prime q = 11 and primitive (5)
root α = 2.
i. Show that 2 is a primitive root of 11.
ii. If user A has public key YA = 9, what is A’s private key?
iii. If user B has public key YB = 3, what is the shared secret key K,
shared with A
b) Discuss Digital Signature Algorithm (4)
PART D
Answer any two full questions, each carries 12 marks.
17 a) What are the steps used for preparing an enveloped data and signed data in (6)
MIME entity?
b) Discuss the message format of PGP. (3)
c) How the integrity is achieved using ICV in Authentication Header. (3)
18 a) Illustrate the relevance of dual signature in SET. (4)
b) Discuss SSL record protocol operations. (6)
c) What are the requirements of Encrypted Tunnels? (2)
19 a) Give the significance of SA selectors in IPSec. (4)
b) Why compression is done before encryption in PGP? (2)
c) Discuss different Firewall configurations. (6)
****

Page 2of 2

Common questions

Powered by AI

MD5 provides data integrity by producing a 128-bit hash value from a given input. It's used to ensure data has not been altered. However, its vulnerability lies in its susceptibility to collision attacks, where two different inputs can produce the same hash output, undermining its reliability for data verification. These weaknesses make MD5 inadequate for applications requiring high security .

Euler’s Totient Function, denoted as φ(n), is crucial in RSA encryption, as it helps in determining the totient needed to calculate the private key. Given two primes p and q, the product n = pq, and φ(n) is calculated as (p-1)(q-1). This calculation is crucial because it determines how often numbers can be picked such that they are coprime to n, facilitating the selection of encryption keys e and the decryption keys d in RSA .

The Alert Protocol in TLS improves security by allowing the communication between client and server to include alerts related to potential problems during the session. Alerts may indicate warning or fatal errors. A fatal error leads to the termination of the connection, while warning alerts may or may not interrupt it. This protocol helps in maintaining secure connections by notifying each party to take necessary actions when issues arise, thus increasing the robustness of the security measure implemented in TLS .

The advantages of using Output Feedback Mode (OFB) include its ability to turn a block cipher into a synchronous stream cipher, implying it can encrypt data of any length and does not propagate errors beyond the immediate block. However, OFB also has disadvantages, such as the potential for repetitive keystream if the initialization vector (IV) is reused, which poses security risks because identical keystreams would encrypt different plaintexts to the same ciphertexts .

Monoalphabetic ciphers involve a single alphabet for the substitution of plaintext characters, such as the Caesar Cipher. It is more vulnerable to frequency analysis because each letter maps to a single other letter throughout. In contrast, polyalphabetic ciphers, like the Vigenère Cipher, use multiple alphabets to encrypt the plaintext, making frequency analysis more difficult as the same plaintext letter can encrypt to different ciphertext letters based on its position in the text .

Creating a digital signature using RSA involves generating a hash of the message, which is then encrypted with the sender's private key, producing a signature. This can be verified by decrypting the signature with the sender's public key, and if it matches the hash of the message, authenticity and integrity are confirmed. Digital signatures thus assure the recipient that the message was created by the owner of the private key and that it has not been altered .

The Diffie-Hellman key exchange algorithm allows two parties to securely exchange cryptographic keys over a public channel without prior shared secrets. It achieves this by enabling the creation of a shared secret between parties by each selecting private keys and using a common public base and a large prime number to derive a shared secret. The significance lies in its use for securely establishing session keys, which are essential for encrypted communication channels, especially in public and unsecured environments .

Computationally secure ciphers are those where breaking the cipher requires infeasible computational resources within a practical time frame, such as AES and RSA. These ciphers do not guarantee absolute security but rely on the limits of computational power to keep data safe. In contrast, unconditionally secure ciphers, like the One-Time Pad, provide absolute security against any potential computational attack, assuming the key is truly random, used only once, and as long as the message itself .

The Playfair Cipher fundamentally differs from traditional monoalphabetic ciphers by encrypting digraphs (pairs of letters), instead of single letters. This creates a more complex cipher text that is harder to break compared to simple substitution ciphers like Caesar Cipher, which only substitute one letter for another. Playfair employs a 5x5 grid using a keyword, making it more secure by introducing polygraphic substitution, thus preventing frequency analysis .

Attackers cannot recognize the actual sender of a message in encrypted tunnels because the data, including routing information, is encrypted, masking the source’s identity from unauthorized users. Encrypted tunnels utilize encryption and tunneling protocols (like IPSec) to secure the data being transmitted over networks by hiding source IP addresses and encapsulating data with encryption layers, rendering the original source non-traceable to potential attackers .

You might also like