Jit QP
Jit QP
OBJECTIVES:
UNIT I INTRODUCTION 9
Security trends - Legal, Ethical and Professional Aspects of Security, Need for Security at
Multiple levels, Security Policies - Model of network security – Security attacks, services and
mechanisms – OSI security architecture – Classical encryption techniques: substitution
techniques, transposition techniques, steganography).- Foundations of modern cryptography:
perfect security – information theory – product cryptosystem – cryptanalysis.
TOTAL 45 PERIODS
JIT-2106/CSE /Mr. A. SATHEESH /IV Year /SEM 07/CS8792/CRYPTOGRAPHY & NETWORK SECURITY/UNIT 1- 5/ QB+Keys
REGULATION :2017 ACADEMIC YEAR : 2022-2023
OUTCOMES:
TEXT BOOK:
1. William Stallings, Cryptography and Network Security: Principles and Practice, PHI
3rd Edition, 2006.
REFERENCES:
1. C K Shyamala, N Harini and Dr. T R Padmanabhan: Cryptography and Network
Security, Wiley India Pvt.Ltd
3. Charlie Kaufman, Radia Perlman, and Mike Speciner, Network Security: PRIVATE
Communication in a PUBLIC World, Prentice Hall, ISBN 0-13-046019-2
JIT-2106/CSE /Mr. A. SATHEESH /IV Year /SEM 07/CS8792/CRYPTOGRAPHY & NETWORK SECURITY/UNIT 1- 5/ QB+Keys
REGULATION :2017 ACADEMIC YEAR : 2022-2023
UNIT I - INTRODUCTION
Security trends - Legal, Ethical and Professional Aspects of Security, Need for Security at Multiple levels,
Security Policies - Model of network security – Security attacks, services and mechanisms – OSI security
architecture – Classical encryption techniques: substitution techniques, transposition techniques,
steganography).- Foundations of modern cryptography: perfect security – information theory – product
cryptosystem – cryptanalysis.
PART* A
Q.N O QUESTIONS
Interruption
Interception
Modification
Fabrication
2.
Define active and passive attack with example.BTL1
Passive attack:
Monitoring the message during transmission.
Difficult to detect
Does not affect syatem
Eg: Interception
Active attack:
It involves the modification of data stream or creation of false data stream
Easy to detect
Easily affects system
E.g.: Fabrication, Modification, and Interruption
JIT-2106/CSE /Mr. A. SATHEESH /IV Year /SEM 07/CS8792/CRYPTOGRAPHY & NETWORK SECURITY/UNIT 1- 5/ QB+Keys
REGULATION :2017 ACADEMIC YEAR : 2022-2023
Integrity: Service that ensures that only authorized person able to modify the message
Non repudiation: This service helps to prove that the person who denies the transaction is true or
false.
6.
Define security mechanism. BTL1
It is process that is designed to detect prevent, recover from a security attack.
Hide in plain sight .Hiding the message into some cover media. It conceals the existence of a
message
When systems are connected through the network, attacks are possible during transmission time.
9.
Define confidentiality and authentication.BTL1
Confidentiality: It means how to maintain the secrecy of message. It ensures that the information in
a computer system and transmitted information are accessible only for reading by authorized person.
Authentication: It helps to prove that the source entity only has involved the transaction.
It is a science of writing Secret code using mathematical techniques. The many schemes used for
enciphering constitute the area of study known as cryptography.
JIT-2106/CSE /Mr. A. SATHEESH /IV Year /SEM 07/CS8792/CRYPTOGRAPHY & NETWORK SECURITY/UNIT 1- 5/ QB+Keys
REGULATION :2017 ACADEMIC YEAR : 2022-2023
SUBSTITUTION TRANSPOSITION
A substitution technique is one It means, different kind of
in which the letters of plaintext mapping is achieved by
are replaced by other letter or performing some sort of
by number or symbols permutation on the plaintext
letters.
Eg: Caeser cipher Eg: DES, AES
12.
Define Diffusion & Confusion. BTL1
Diffusion
It means each plaintext digits affect the values of many ciphertext digits which is equivalent to each
ciphertext digit is affected by many plaintext digits. It can be achieved by performing permutation on
the data. It is the relationship between the plaintext and ciphertext
Confusion:
It can be achieved by substitution algorithm. It is the relationship between cipher text and key
Number of rounds
Design of the function F
Key scheduling
15
Define Reversible mapping. BTL1
Each plain text is maps with the unique cipher text. This transformation is called reversible mapping
16
Specify the basic task for defining a security serviceBTL3
A service that enhances the security of the data processing systems and the information transfer of an
organization. The services are intended to counter security attack, and they make use of one or more
security mechanism to provide the service
17 Define network security. BTL1
This area covers the use of cryptographic algorithms in network protocols and network applications.
JIT-2106/CSE /Mr. A. SATHEESH /IV Year /SEM 07/CS8792/CRYPTOGRAPHY & NETWORK SECURITY/UNIT 1- 5/ QB+Keys
REGULATION :2017 ACADEMIC YEAR : 2022-2023
Service that ensures that only authorized person able to modify the message.
Nonrepudiation:
This service helps to prove that the person who denies the transaction is true or false.
Shift Ciphers.
Affine Ciphers
Vigenere Cipher
Substitution Ciphers
Sherlock Holmes
Playfair and ADFGX Ciphers
Block ciphers
One-Time pads
JIT-2106/CSE /Mr. A. SATHEESH /IV Year /SEM 07/CS8792/CRYPTOGRAPHY & NETWORK SECURITY/UNIT 1- 5/ QB+Keys
REGULATION :2017 ACADEMIC YEAR : 2022-2023
PART *B
2. Explain the various substitution techniques. (AU Nov/Dec 2011) (13M) BTL4
Answer:Pageno.:62 to 69 in William Stallings
Ceaser cipher : replacing each letter ofthe alphabet with the letter standing three places
further down the alphabet (1M)
Formula :(1M)
C E(3, p) ( p 3) mod 26
Example:(1M)
JIT-2106/CSE /Mr. A. SATHEESH /IV Year /SEM 07/CS8792/CRYPTOGRAPHY & NETWORK SECURITY/UNIT 1- 5/ QB+Keys
REGULATION :2017 ACADEMIC YEAR : 2022-2023
Example:(1M)
Play Fair cipher: treats digrams in the plaintext as single units and translates these units into
ciphertext
Example:(1M)
Poly alphabetic cipher : technique is to use different monoalphabetic substitutions asone
proceeds through the plaintext message (2M)
One time pad (2M): Each new message requires a new key of the same length as thenew
message
3
Describe about transposition techniques.(10M) BTL2
Answer:Pageno.:77 to 82 in William Stallings
Rail fence technique: the plaintext is written down as a sequence of diagonals and then read
off as a sequence of rows (1M)
Example: (2M)
Coloumnar technique:It is a transposition cipher that follows a simple rule for mixing up the
characters in the plaintext to form the ciphertext. (1M)
Example: (2M)
Rotor machines: principle of multiple stages of encryption was a class of systems knownas
rotor machines. (2M)
Stegnography: conceal the existence of the message (2M)
JIT-2106/CSE /Mr. A. SATHEESH /IV Year /SEM 07/CS8792/CRYPTOGRAPHY & NETWORK SECURITY/UNIT 1- 5/ QB+Keys
REGULATION :2017 ACADEMIC YEAR : 2022-2023
Pervasive Security Mechanisms: Mechanisms that are not specific to any particular OSIsecurity
service or protocol layer. (2M)
(i) Trusted Functionality : perceived to be correct with respect to some criteria (1/2 M)
(ii) Security Label: marking bound to a resource(1/2 M)
(iii) Event Detection: Detection of security-relevant events. (1/2 M)
(iv) Security Audit Trail: facilitate a security audit(1/2 M)
Active Attack :involve some modification of the data stream or the creation of a false stream
(i) Masquerade:when one entity pretends to be a different entity (1/2M)
(ii) Replay:involves the passive capture of a data unit and its subsequent retransmission
to produce an unauthorized effect (1/2M)
(iii) Modification of message:some portion of a legitimate message is altered, or that
messages are delayed or reordered, to produce an unauthorized effect (1/2M)
(iv) Denial of service:prevents or inhibits the normal use or management of
communications facilities (1/2M)
JIT-2106/CSE /Mr. A. SATHEESH /IV Year /SEM 07/CS8792/CRYPTOGRAPHY & NETWORK SECURITY/UNIT 1- 5/ QB+Keys
REGULATION :2017 ACADEMIC YEAR : 2022-2023
Diagram: (2M)
Man in Middle Attack :attack where the attacker secretly relays and possibly alters the
communication between two parties who believe they are directly communicating with each
other. (2M)
Diagram(1M)
PART* C
1. Encrypt the following using play fair cipher using the keyword MONARCHY
“SWARAJ IS MY BIRTH RIGHT”. Use X for blank spaces.(15M) BTL 6
Answer:Pageno.:65 to 67 in William Stallings
Rules:(6M)
(i) If both the letters are in the same column, take the letter below each one (going back to the
top if at the bottom)
(ii) First, a plaintext message is split into pairs of two letters (digraphs)
(iii)If both the letters are in the same column, take the letter below each one
(iv)If both letters are in the same row, take the letter to the right of each one
(v) If neither of the preceding two rules are true, form a rectangle with the two letters and take
the letters on the horizontal opposite corner of the rectangle
Solution:(9M)
JIT-2106/CSE /Mr. A. SATHEESH /IV Year /SEM 07/CS8792/CRYPTOGRAPHY & NETWORK SECURITY/UNIT 1- 5/ QB+Keys
REGULATION :2017 ACADEMIC YEAR : 2022-2023
2. Apply Caesar cipher and k=5 decrypt the given Cipher text
“YMJTYMJWXNIJTKXNQJSHJ”. (15M)BTL5
Answer:Pageno.:62 to 63 in William Stallings
Defintion:(3M)
It is a type of substitution cipher where each letter in the original message (which in
cryptography is called the plaintext) is replaced with a letter corresponding to a certain number
of letters shifted up or down in the alphabet.
Formula:(2M)
C = E(3, p) = (p + 3) mod 26(2)
Solution(10M)
3. Encrypt the message “PAY” using hill cipher with the following key matrix
and show the decryption to formulate original plain text. (15M)BTL6
17 17 5
K= 21 18 21
2 2 19
|
Answer:Pageno.:67 to 69 in William Stallings
Encryption:(5M)
turn our keyword into a key matrix
plaintext into digraphs
into a column vector
perform matrix multiplication modulo the length of the alphabet (i.e. 26) on each vector
converted back into letters to produce the ciphertext.
Decryption:(3M)
must find the inverse matrix
Example:(7M)
4. Assess the following cipher Text using brute force attack. (15M) BTL6
CMTMROOEOORW (Hint: Algorithm-Rail fence)
Answer:Pageno.:69 to 71 in William Stallings
Defintion:(3M)
The simplest such cipher is the rail fence technique, in which the plaintext is
written down as a sequence of diagonals and then read off as a sequence of rows
Encryption:(6M)
Decryption:(6M)
JIT-2106/CSE /Mr. A. SATHEESH /IV Year /SEM 07/CS8792/CRYPTOGRAPHY & NETWORK SECURITY/UNIT 1- 5/ QB+Keys
REGULATION :2017 ACADEMIC YEAR : 2022-2023
Authentication (3M)
JIT-2106/CSE /Mr. A. SATHEESH /IV Year /SEM 07/CS8792/CRYPTOGRAPHY & NETWORK SECURITY/UNIT 1- 5/ QB+Keys
REGULATION :2017 ACADEMIC YEAR : 2022-2023
Stream cipher: Processes the input stream continuously and producing one element at a time.
Example: caeser cipher.
Block cipher: Processes the input one block of elements at a time producing an output block for each
input block.
Example: DES
An Encryption algorithm is unconditionally secured means; the condition is if the cipher text generated
by the encryption scheme doesn’t contain enough information to determine corresponding plaintext.
Encryption is computationally secured means,
The cost of breaking the cipher exceeds the value of enough information.
Time required to break the cipher exceed the useful lifetime of information.
JIT-2106/CSE /Mr. A. SATHEESH /IV Year /SEM 07/CS8792/CRYPTOGRAPHY & NETWORK SECURITY/UNIT 1- 5/ QB+Keys
REGULATION :2017 ACADEMIC YEAR : 2022-2023
A desirable property of any encryption algorithm is that a small change in either the plaintext or the
key produce a significant change in the ciphertext
Diffusion:
In diffusion, the statistical structure of the plaintext is dissipated into long-range statistics of
the ciphertext.
This is achieved by having each plaintext digit affect the value of manyciphertext digits;
generally, this is equivalent to having each ciphertext digit beaffected by many plaintext digits
Confusion:
It can be achieved by substitution algorithm. It is the relationship between cipher text and key.
Electronic Codebook(ECB)
Cipher Block Chaining(CBC)
Cipher Feedback(CFB)
Output Feedback(OFB)
Counter(CTR)
8 Hardware efficiency
Software efficiency
Preprocessing
Random access
Provable security
Simplicity
Multiple Encryption is a technique in which the encryption is used multiple times. Eg: Double DES,
Triple DES
Number of rounds
Design of the function F
Key scheduling
JIT-2106/CSE /Mr. A. SATHEESH /IV Year /SEM 07/CS8792/CRYPTOGRAPHY & NETWORK SECURITY/UNIT 1- 5/ QB+Keys
REGULATION :2017 ACADEMIC YEAR : 2022-2023
13 What is the difference between link and end to end encryption? BTL2
Link
Encryption End to End Encryption
With link encryption,
each vulnerable
communication link is
equipped on both ends
with an encryption With end to end ncryption, encryption process is
device carried out at the two end systems
Message exposed in
sending host and in Message encrypted in sending and intermediate
intermediate nodes nodes
Transperant to user User applies encryption
Host maintains
encryption facility Users must determine algorithm
One facility for all
users Users selects encryption scheme
14 What is traffic Padding? What is its purpose? BTL2
Traffic padding produces ciphertext output continuously, the purpose of padding is that even in the
absence of the plain text, a continuous random data stream is generated.
16
What is Triple Encryption? How many keys are used in triple encryption? BTL4
Triple Encryption is a technique in which encryption algorithm is performed three times using three
keys.
Public announcement
Publicly available directory
Public key authority
JIT-2106/CSE /Mr. A. SATHEESH /IV Year /SEM 07/CS8792/CRYPTOGRAPHY & NETWORK SECURITY/UNIT 1- 5/ QB+Keys
REGULATION :2017 ACADEMIC YEAR : 2022-2023
RC4 is a stream cipher designed in 1987 by Ron Rivest for RSA Security. RC4 is used in the SSL/TLS
(Secure Sockets Layer/Transport Layer Security) standards that have been defined for communication
between Web browsers and servers. It is also used in the WEP (Wired Equivalent Privacy) protocol
and the newer WiFi Protected Access (WPA) protocol that are part of the IEEE 802.11 wireless LAN
standard.
JIT-2106/CSE /Mr. A. SATHEESH /IV Year /SEM 07/CS8792/CRYPTOGRAPHY & NETWORK SECURITY/UNIT 1- 5/ QB+Keys
REGULATION :2017 ACADEMIC YEAR : 2022-2023
PART * B
Explain Block cipher design principles and modes of operation. (Apr/May2014)
(13M) BTL4
Answer:Pageno.:116 to 118 in William Stallings
C E( K 1 , D( K 2 , E( K 1 , P)))
P D( K 1 , E( K 2 , D( K 1 , C)))
Triple DES with 3 keys(4M)
Diagram with operation formulas(2M)
C E( K 3 , D( K 2 , E( K 1, P)))
a qn r 0 r n; q [a / n]
a [a / n] n (a mod n)
11mod 7 4; 11mod 7 3
PART * C
1 Explain block cipher principles and modes of operation. (15M) BTL4
Answer:Page no.:216 to 218 in William Stallings
DES design (3M)
AES (3M)
Triple DES (3M)
RC 5 Algorithm(3M)
Characteristics (3M)
Six ingredients with explanation (5M)
Diagrams (2M)
Steps (3M)
Structure (6M)
Diagrams (6M)
Function (3M)
Key generation (3M)
In external error control, error detecting codes are appended after encryption.
PART *B
1. Explain in detail about EL-GAMAL Algorithm. (13M) BTL4 (AU Nov/Dec 2013,
May/June 2015)
Answer:Page no.:424to 426 in William Stallings
Components(2M)
El Gamal Key generation and steps to generate private and public keys(3M)
El Gamal Encryption(3M)
El Gamal Decryption(3M)
Proof of Decryption(1M)
n 1
a 1(mod p)
Proof :(3M)
Example :(3M)
Euler’s theorem states that for every a and n that are relatively prime:
Formula :(3M)
(n )
a 1(mod n)
(1) = 1.
Statements: (2M)
Example :(5M)
5.
Explain Modular and Discrete Algorithm.(10M) BTL4
Answer:Pageno.:281 to 284 in William Stallings
discrete algorithm(2M)
Fundamental to public key algorithm(2M)
Formula(3M)
PART * C
1. a) Find 321 and 11 using Fermat’s Theorem(7M) BTL5
b) Find 117 and 13 using fermat’s theorem(8M) BTL5
Answer:Pageno.:272 to 274 in William Stallings
Formula:(4M)
Steps:(3M)
Formula:(4M)
Steps:(4M)
2. Illustrate how to solve x2≡1(mod 35) using Chinese remainder theorem.(15M)BTL6
Answer:Pageno.:278 to 281 in William Stallings
A a c mod M
k
i 1 i i (2M)
C M M m for1 i k (3M)
1
mod
i i i i
Encryption :(5M)
Decryption:(5M)
4. State the CRT and find X for the given set of congruent equations using CRT.
X 2(mod 3)
X 3(mod 5)
X 2(mod 7) (15M) BTL5
Answer:Page no.:278 to 281 in William Stallings
(2M)
A a c mod M
k
i 1 i i
C M M for 1 i k
1
mod m
i i i i
(3M)
Encryption :(5M)
Decryption:(5M)
i i
(2M)
i 1
C M M m for1 i k (3M)
1
mod
i i i i
Encryption :(5M)
Decryption:(5M)
Explanation (5M)
Theorem (10M)
7. Evaluate encryption and decryption using RSA algorithm for the following. p=7, q=11;
e=17; m=8. (15M) BTL6
Answer:Page no.:247 to 249 in William Stallings
Encryption(5M)
Decryption(5M)
9. Estimate the encryption and decryption values for the RSA algorithm parameters.
P=3, Q=11, E=7, d=?, M=5. (15M) BTL6
Answer:Page no.:247 to 249 in William Stallings
computing their system modulus N=p.q (2M)
note ø(N)=(p-1)(q-1)
STEPS(3M)
to encrypt a message M the sender:
obtains public key of recipient KU={e,N}
computes: C=Me mod N, where 0≤M<N
to decrypt the ciphertext C the owner:
uses their private key KR={d,p,q}
computes: M=Cd mod N
Encryption(5M)
Decryption(5M)
10. Implement RSA Algorithm for the given values, trace the sequence of calculations in RSA.
P=7,q=13,e=5 and M=10. (15M) BTL5
Answer:Page no.:247 to 248 in William Stallings
computing their system modulus N=p.q (2M)
note ø(N)=(p-1)(q-1)
STEPS(3M)
to encrypt a message M the sender:
obtains public key of recipient KU={e,N}
11. Users Alice and Bob use the Diffie Hellman Key exchange technique with a common prime
q=83 and primitive root 5 .
i) if Alice has a private key XA=6,what is the Alice’s public key YA?
ii) If Bob has a private key XB=10, what is Bob’s public key YB?
iii) what is the shared secret key? (15M) BTL6
Answer:Page no.:325 to 329 in William Stallings
prime p, element gZp* (5M)
hA = gx mod p
hB = gy mod p
Encryption(5M)
Decryption(5M)
PART * A
Sender and receiver must share the algorithm Sender and receiver have one of the matched
and key pair key
Key must be kept secret. Any one of the key must be kept secretly.
9
What is message authentication? BTL2
Message authentication is a process that verifies whether the recived message comes from
assigned source has not been altered.
10 Specify the requirements for message authentication. BTL3
Disclosure
Traffic analysis
Masquerade
Content modification
Sequence modification
Timing modification
Repudiation.
Masquerade
Timing modification
Source repudiation
Destination repudiation
15 What do you mean by hash function? BTL4
Hash function accept a variable size message M as input and produces a fixed size hash code
H(M) called as message digest as output. It is the variation on the message authentication code
Hash Function:
The hash value is appended to the message at the source at time when the message is assumed or
known to be correct. The hash function itself not considered to be secret
17
Give any three hash algorithm. BTL4
MD5 (Message Digest version 5) algorithm.
SHA_1 (Secure Hash Algorithm).
RIPEMD_160 algorithm.
23 What is the difference between weak and strong collision resistance? BTL2
Weak
collision resistance Strong resistance collision
64(4
rounds of 80(4 rounds
No of steps 16) of 20) 160(5 pairs rounds of
16)
Maximum
message infinity 264-1 bits 264-1 bits
size
Primitive
logical 4 4 5
function
Additive
constants 64 4 9
Used
Little
Endianess end ian Big endian Little endian
31. What are the security services provided by Digital Signature? BTL1
MD5
SHA
32. What is Direct Digital Signature? BTL1
The term direct digital signature refers to a digital signature scheme that involves
only the communicating parties (source, destination). It is assumed that the destination
knows the public key of the source.
PART * B
2. Explain MD5 algorithm. (13M) BTL4 (AU May/June 2012, Apr/May 2011)
Answer:Pageno.:353 to 355in William Stallings
4. Explain Hash Based Message Authentication Code and CMAC .(13M) BTL4
Answer:Pageno.:399 to 401in William Stallings
Mutual authentication(3M)
Examples of Replay attack(1M)
Symmetric encryption Approach(3M)
Time stamps(1M)
One say authentication(2M)
Public key encryption approach (3M)
X.509 Framework- Was initially issued in 1988 with the latest revision in 2000 .Based
on the use of public-key cryptography and digital signatures .Does not dictate the useof
a specific algorithm but recommends RSA.Does not dictate a specific hash algorithm
(2M)
Public Key Certificate Use
(3M)
X.509 Format
(3M)
Obtaining Certificate (2M)
Certificate Revocation (1M)
PART * C
Kerberos
It is an authentication service developed as part of project Athena at MIT. The problem
that Kerberos address is, assume an open distributed environment in which users at work
stations wish to access services on servers distributed throughout the network. It is an
authentication protocol (3M)
How Kerberos works
(2M)
Explanation of working methodology with diagram
(2M)
Electronic Mail security – PGP, S/MIME – IP security – Web Security - SYSTEM SECURITY:
Intruders – Malicious software – viruses – Firewalls.
PART * A
Part * B
Authentication Header
It is used to provide connectionless integrity and data origin authentication for IP
datagrams (1M)
Authentication Header fields (1M)
Access control
Connectionless integrity
Data origin authentication
Confidentiality
Anti Replay Attacks
It is a sub protocol of IPsec that is part of Internet engineering task force. The
main goal is to avoid hackers injecting or making changes in packets that travel from a
source to destination (1M)
Values in sliding window (2M)
2 Explain in detail about IPSEC. (13M) BTL4
Answer : Page : 640 – William Stallings
IP v4
Specifies an IPv4 address or range of addresses that are authorized senders for a domain
(2M)
IP v6
Specifies an IPv6 address or range of addresses that are authorized senders for a domain.
(2M)
AH tunnel modes
It authenticates the entire inner IP packet selected portion of outer IP header
(1M)
IP header
An IP header is header information at the beginning of an IP packet which contains
information about IP version, source IP address, destination IP address, time-to-
live (2M)
New IP header (1M)
TCP header
TCP is the primary transport protocol used to provide reliable, full-duplex
connections. The most common use of TCP is to exchange TCP data encapsulated
in an IP datagram. (2M)
Original data
It refers to any data object that hasn't undergone thorough processing, either
manually or through automated computer software. (2M)
Original IP header (1M)
3 Explain Encapsulating security payload. (13M) BTL4
Answer : Page : 651 – William Stallings
ESP consists of an encapsulating header and trailer used to provide encryption or combined
encryption/ authentication. The current specification is RFC 4303, IP Encapsulating
Security Payload (ESP).The purpose is to provide confidentiality and integrity of messages
(3M)
4 Explain Internet security Association and Key Management Protocol. (13M) BTL4
Answer : Page : 663 – William Stallings
Procedures and formats for establishing maintaining and deleting Security Association
information (1M)
IP Seckey management (2M)
Initiator cookie (1M)
Responder cookie (1M)
Major and minor version (3M)
Message ID (1M)
Length (1M)
Payloads (2M)
5 Explain about WEB security. (13M) BTL4 (Apr/May 2011, Nov/Dec 2011, Nov/Dec 13,
May/June 2015)
Answer : Page : 510 – William Stallings
JIT-2106/CSE/ Mr. A.SATHEESH /IV Yr/SEM 07/CS8792/CRYPTOGRAPHY & NETWORK SECURITY/UNIT 1- 5/QB+Keys
REGULATION :2017 ACADEMIC YEAR : 2022-2023
Registration authority
An optional component that can assume a number of administrative
functions from the CA. The RA is often associated with the end entity
registration process but can assist in a number of other areas as well. (2M)
CRI issuer
An optional component that a CA can delegate to publish CRLs (1M)
Repository
A generic term used to denote any method for storing certificates and
CRLs so that they can be retrieved by end entities. (1M)
JIT-2106/CSE/ Mr. A.SATHEESH /IV Yr/SEM 07/CS8792/CRYPTOGRAPHY & NETWORK SECURITY/UNIT 1- 5/QB+Keys
REGULATION :2017 ACADEMIC YEAR : 2022-2023
PART * C
Diagram
Format
Algorithm
Internet key exchange (3M)
Manual
Automated
OKDP
ISAKMP
Cryptographic suites (3M)
ESP encryption
ESP integrity
IKE encryption
IKE PRF
IKE Integrity
IKE DH group
JIT-2106/CSE/ Mr. A.SATHEESH /IV Yr/SEM 07/CS8792/CRYPTOGRAPHY & NETWORK SECURITY/UNIT 1- 5/QB+Keys
REGULATION :2017 ACADEMIC YEAR : 2022-2023
Diagrams (3M)
JIT-2106/CSE/ Mr. A.SATHEESH /IV Yr/SEM 07/CS8792/CRYPTOGRAPHY & NETWORK SECURITY/UNIT 1- 5/QB+Keys
REGULATION :2017 ACADEMIC YEAR : 2022-2023
Message Integrity
fragmentation
compression
message authentication code
BASIS FOR
SSL TLS
COMPARISON
Diagrams (5M)
SSH Protocol Exchange SSL Handshake Protocol
JIT-2106/IT/Mrs. Daya Mathew/IV Yr/SEM 07/CS8792/CRYPT OGRAPHY & NETWORK SECURITY/UNIT 1- 5/QB+Keys /Ver3.0
2.55
REGULATION :2017 ACADEMIC YEAR : 2022-2023
4. Explain about Firewall and types of Firewall and Design of Firewall. (13M) BTL4
(Apr/May 2011, Nov/Dec 2011, May/June 2012, Nov/Dec 2012, Nov/Dec 2013, May/June
2015)
Answer : Page : 630 – William Stallings
Firewall (1M)
A choke point of control and monitoring,interconnects networks with differing trust,imposes
restrictions on network services,only authorized traffic is allowed,auditing and controlling access
,can implement alarms for abnormal behavior
Types of firewall
(i) Packet filtering router firewall
Protecting internal users from the external network threats is to implement this type of
security (1M)
Diagram(2M)
2.56
REGULATION :2017 ACADEMIC YEAR : 2022-2023
Diagram(2M)
(iii) Circuit Level Gateway- relays two TCP connections,imposes security bylimiting
which such connections are allowed ,once created usually relays traffic without
examining contents.(1M)
Diagram(2M)
2.57
REGULATION :2017 ACADEMIC YEAR : 2022-2023
5. Explain in detail about Intrusion detection system. (13M) BTL4 (Nov/Dec 2011, May/June
2014)
Answer : Page : 645 – William Stallings
Intrusion Detection Systems look for attack signatures, which are specific patterns that
usually indicate malicious or suspicious intent.
(1M)
Statistical anomaly detection
Involves the collection of data relating to the behavior of legitimate users over a period of
time (2M)
Rule based detection
Involves as a set of rules can be used to decide given behavior of an intruder (2M)
Distributed intrusion detection
System should detect a substantial percentage of intrusion while keeping the false alarm
rate at acceptable level. (2M)
Rule based penetration identification (2M)
Architecture for distribution intrusion detection – diagram (2M)
2.58
REGULATION :2017 ACADEMIC YEAR : 2022-2023
2.59
REGULATION :2017 ACADEMIC YEAR : 2022-2023
7. Explain about Various types of Configurations or Firewall Designs in Firewall. (13M) BTL4
Answer : Page : 630 – William Stallings
The three basic firewall designs are considered: a single-homed bastion host, a dual-homed bastion
host, and a screened subnet firewall.(1M)
(i) Screened Host Firewall (Single-Homed Bastion Host)
Uses a single-homed bastion host plus a packet-filtering router. Single-homed bastion
hosts can be configured as either circuit-level or application-level gateways. When
using either of these two gateways, each of which is called a proxy server, the bastion
host can hide the configuration of the internal network.(1M)
Diagram(2M)
The configuration of the screened host firewall using a dual-homed bastion host adds
significant security, compared with a single-homed bastion host. Dual-homed bastion host has two
network interfaces. (1M)
Diagram(2M)
The third implementation of a firewall is the screened subnet, which is also known as a
DMZ. This firewall is the most secure one among the three implementations, simply because it uses a
2.60
REGULATION :2017 ACADEMIC YEAR : 2022-2023
bastion host to support both circuit- and application-level gateways. All publicly accessible devices,
including modem and server, are placed inside the DMZ. (1M)
Diagram(2M)
2.61