Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

Ccs Iat Answer Key

Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 4

DEPARTMENT OFCOMPUTER SCIENCE AND ENGINEERING

ACADEMIC YEAR 2024-25 (ODD SEM)

INTERNAL ASSESSMENT TEST-I


CB3491-CRYPTOGRAPHY & CYBER SECURITY

Year / SEM : II / III –A&B Session :


Time : 1 ½ Hours Max Marks : 50

PART A (5×02=10MARKS)
Sl.NO Questions
1. Distinguish active and passive attack with example?
Ans:
Active attacks are the type of attacks in which, The attacker efforts to
change or modify the content of messages. Active Attack is
dangerous to Integrity as well as availability. Due to active attack
system is always damaged and System resources can be changed.
The most important thing is that, In an active attack, Victim gets
informed about the attack.
2. What is the difference between a monoalphabetic cipher and a
polyalphabetic cipher?
Ans:
A monoalphabetic cipher is any cipher in which the letters of the plain text
are mapped to cipher text letters based on a single alphabetic key. Examples
of monoalphabetic ciphers would include the Caesar-shift cipher, where each
letter is shifted based on a numeric key, and the atbash cipher, where each
letter is mapped to the letter symmetric to it about the center of the alphabet.
3. Define steganography?
Ans:
Steganography is the technique of hiding data within an ordinary,
nonsecret file or message to avoid detection; the hidden data is then
extracted at its destination. Steganography use can be combined with
encryption as an extra step for hiding or protecting data.
4. If a bit error occurs in plain text book b1,how far does the error
propagate in CBC mode of DES?
Ans:
If a bit of a plain text block b1 is in error the entire cipher text block will
effected and will be erroneous.
5. Find gcd (2740,1760)using Euclid’s algorithm?
Ans:
Euclidean algorithm for GCD
GCD (a , b) ; a ≥ b > 0
a = 2740
b = 1760
Euclid's formula;
A = b(q) + r ; [q = quotient and r = remainder]
2740 = 1760 (1) + 980
again by taking a = 1760 and b = 980
1760 = 980 (1) + 780
similarly, we have to continue till we get r as 0
980 = 780(1) + 200
780 = 200 (3) + 180
200 = 180(1) + 20
180 = 20 (9) + 0
Now as the r = 0 ,
∴ 20 is the GCD of (2740,1760)

PART B (4×10=40MARKS)
a. Describe the various security mechanisms? (10)
Ans:
A security mechanism is a method or technology that protects data and systems
from unauthorized access, attacks, and other threats. Security measures provide
data integrity, confidentiality, and availability, thereby protecting sensitive
information and maintaining trust in digital transactions. In this article, we will
see types of security mechanisms.
What is Network Security?
Network Security is a field in computer technology that deals with ensuring the
security of computer network infrastructure. The network is very necessary for
sharing information whether it is at the hardware level such as printer, scanner,
6. or at the software level. Therefore security mechanisms can also be termed as is
set of processes that deal with recovery from security attacks. Various
mechanisms are designed to recover from these specific attacks at various
protocol layers.

b. What is monoalphabetic cipher? Examine how it differs from Caesar


cipher?
Ans:
It refers to that cipher in which all the letters of the plain text get mapped into
the cipher text letters, on the basis of one alphabetic key. The Caesar-shift cipher
is one of the major examples of a monoalphabetic cipher. Here, every letter shifts
on the basis of a numeric key. (10)
7. a. Explain the substitution encryption techniques in detail? (10)
Ans:
 Monoalphabetic Cipher − In monoalphabetic substitution cipher, a
character in a plaintext is always restored or changed to the similar
character in the ciphertext indifferent of its position in the text.
For instance, if a letter A in the plaintext is changed to G then each
appearance of A in the plaintext will be restored by G.
Plaintext : hello
Ciphertext : IFMMP
This is a monoalphabetic cipher as both 1’s are encrypted as ‘M’.
 Polyalphabetic cipher − In polyalphabetic substitution, each appearance
of a character in the plaintext can have a different substitution character in
the ciphertext.
The relationship among a character in plaintext and a character in
ciphertext is one to many. For instance, letter ‘A’ can be restored by the
letter ‘C’ and the similar letter ‘A’ can be restored by ‘N’ later in the
ciphertext.
In polyalphabetic cipher, frequencies of plaintext letter are not reflected in
the ciphertext. Therefore, breaking of polyalphabetic cipher is complex
than monoalphabetic cipher as statistical analysis cannot be used on it.
The main feature of polyalphabetic substitution cipher are the following −
o It is needed a set of associated monoalphabetic substitution rules.
o It need a key that decides which rule is used for which
transformation.
o It can hiding the letter frequency of the underlying language
including Playfair Cipher, Vigenere Cipher, and Hill Cipher.
 One-Time Pad − The one-time pad cipher recommend that the key
length must be as long as the plain text to avoid the repetition of key.
Along with that, the key must be used only once to encrypt and decrypt
the individual message after that the key must be discarded.
 Caesar Cipher − In this substitution technique, it can encrypt the plain
text, each alphabet of the plain text is restored by the alphabet three places
further it and it can decrypt the cipher text each alphabet of cipher text is
restored by the alphabet three places before it.
 Playfair Cipher − The playfair cipher is also known as Playfair Square. It
is a cryptographic technique used for manual encryption of information.
This scheme was developed by Charles Wheatstone in 1854.
The Playfair cipher was used by the British army in World War I and by
the Australian in World War II. This was applicable because the playfair
cipher is perfectly fast to use and does not demand some specific
equipment to be used.

b.Explain classical encryption techniques with symmetric cipher and hill


cipher model? (10)
Ans:
Symmetric Encryption is the most basic and old method of encryption. It uses
only one key for the process of both the encryption and decryption of data. Thus,
it is also known as Single-Key Encryption.
A few basic terms in Cryptography are as follows:
Plain Text: original message to be communicated between sender and receiver
Cipher Text: encoded format of the original message that cannot be understood
by humans
Encryption (or Enciphering): the conversion of plain text to cipher text
Decryption (or Deciphering): the conversion of cipher text to plain text, i.e.,
reverse of encryption
8. Discuss properties that are satisfield by groups, rings and fields?(10)

A ring is an ordered triple (R,+,⋅) where R is a set and + and ⋅ are binary
Ans:
operations on R satisfying the following properties: A1 a+(b+c)=(a+b)+c for all a,
b, c in R. A2 a+b=b+a for all a, b in R. A3 There is an element 0∈R satisfying
a+0=a for all a in R

b. Draw the functionality diagram of DES with number of bits in each flow
of data? (10)
Ans:
Data Encryption Standard (DES) is a block cipher with a 56-bit key length that
has played a significant role in data security. Data encryption standard (DES)
has been found vulnerable to very powerful attacks therefore, the popularity of
DES has been found slightly on the decline. DES is a block cipher and encrypts
data in blocks of size of 64 bits each, which means 64 bits of plain text go as the
input to DES, which produces 64 bits of ciphertext. The same algorithm and key
are used for encryption and decryption, with minor differences. The key length
is 56 bits.
a.Explain in detail on the design principles of block cipher and the modes
of operation ? (10)
Ans:
Block ciphers are built in the Feistel cipher structure. Block cipher has a
specific number of rounds and keys for generating ciphertext.Block cipher is a
type of encryption algorithm that processes fixed-size blocks of data, usually 64
or 128 bits, to produce ciphertext. The design of a block cipher involves several
important principles to ensure the security and efficiency of the algorithm. Some
of these principles are:
1. Number of Rounds – The number of Rounds is regularly considered in
design criteria, it just reflects the number of rounds to be suitable for an
9. algorithm to make it more complex, in DES we have 16 rounds ensuring it to
be more secure while in AES we have 10 rounds which makes it more
secure.

b. What do you mean by AES?diagrammatically illustrate the structure of


AESand describe the step AES encryption process with example? (10)
Ans:
AES uses 128-, 192- or 256-bit keys to encrypt and decrypt data. AES is a symmetric
encryption algorithm and a block cipher. The former means that it uses the same key
to encrypt and decrypt data. The sender and the receiver must both know -- and use --
the same secret encryption key.

R- Remembering, U- Understanding, Ap- Applying, A- Analyzing, E- Evaluating, C- Creating

Course Incharge HOD Principal

You might also like