KEMBAR78
2 Mark Cs | PDF | Encryption | Cryptography
0% found this document useful (0 votes)
3 views5 pages

2 Mark Cs

The document covers various concepts in information security, including the CIA Triad (Confidentiality, Integrity, Availability), the Euclidean Algorithm for finding the GCD, and definitions of steganography and cryptography. It also discusses different types of attacks, encryption techniques like Caesar Cipher and RC4, and compares block and stream ciphers. Additionally, it highlights the challenges of key management in symmetric cryptography and the computational inefficiencies of asymmetric cryptography for large data.

Uploaded by

kaishwarya978
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
3 views5 pages

2 Mark Cs

The document covers various concepts in information security, including the CIA Triad (Confidentiality, Integrity, Availability), the Euclidean Algorithm for finding the GCD, and definitions of steganography and cryptography. It also discusses different types of attacks, encryption techniques like Caesar Cipher and RC4, and compares block and stream ciphers. Additionally, it highlights the challenges of key management in symmetric cryptography and the computational inefficiencies of asymmetric cryptography for large data.

Uploaded by

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

✅ 1. What are the 3 aspects of security?

Ans:
The three core aspects of information security are:
 Confidentiality – Prevents unauthorized access (e.g., password-protected file)
 Integrity – Ensures data is not changed (e.g., hash checks)
 Availability – Ensures data is available when needed (e.g., backup servers)
📝 These are also called the CIA Triad.

✅ 2. Write the Euclidean Algorithm.


✅ Definition:
The Euclidean Algorithm is used to find the greatest common divisor (GCD) of two positive
integers.
✅ Steps:
1. Given two numbers a and b, with a > b.
2. Apply: gcd(a, b) = gcd(b, a mod b)
3. Repeat the step until the remainder becomes 0.
4. The last non-zero remainder is the GCD.
✅ Example:
To find gcd(98, 56):
gcd(98, 56)
= gcd(56, 98 mod 56) = gcd(56, 42)
= gcd(42, 56 mod 42) = gcd(42, 14)
= gcd(14, 42 mod 14) = gcd(14, 0)
⇒ GCD = 14

✅ 3. Define Steganography.
Definition:
Steganography is hiding secret data inside non-secret data like images, audio, etc., so others
don’t even know a message exists.
Example: Hiding a message in the last bit of each pixel in a photo (LSB technique).
 It hides presence of communication, unlike cryptography.
✅ 4. Define Finite Group.
Definition:
A finite group is a set with a finite number of elements that satisfies:
1. Closure
2. Associativity
3. Identity
4. Inverse
Example: Integers mod 5 under addition: {0,1,2,3,4}
Used in cryptography like RSA, Diffie-Hellman, ECC.

✅ 5. Decipher: CMTMROOEOORW, depth = 2 (Rail Fence)


Answer:
Rail fence (depth 2 = 2 rows):
Row1: C M T M R O
Row2: O E O O R W
Read in zigzag → COMETOMORROW

✅ 6. Caesar Cipher – Encrypt MONARKEY, Key = 3


Answer:
Shift each letter +3 places:
M→P, O→R, N→Q, A→D, R→U, K→N, E→H, Y→B
→ Cipher Text = PRQDUNHB

✅ 7. Compare Passive and Active Attacks (5 points)


Feature Passive Attack Active Attack

Purpose Just monitors data Alters or injects data

Detection Hard to detect Easier to detect

Example Eavesdropping Man-in-the-middle, DoS

Impact Loss of confidentiality Loss of integrity & availability

Defense Mechanism Encryption Authentication, firewalls

✅ 8. Why is asymmetric cryptography bad for huge data?


Answer:
Asymmetric cryptography (like RSA) is computationally slow because of large key sizes
and complex math operations.
 Not suitable for encrypting large files or real-time data
 Mostly used to encrypt symmetric keys, not entire data
Example: A 1MB file encrypted with RSA will take more time than AES.

✅ 9. Write short notes on Cryptanalysis.


Answer:
Cryptanalysis is the technique of breaking ciphers without the key.
 Tries to find plaintext or key from ciphertext
 Types: Brute force, frequency analysis, side-channel attack
 Helps in testing the strength of cryptographic algorithms
Example: Cracking Caesar cipher using letter frequency.

✅ 10. Difference between Substitution and Transposition Techniques (5 points)


Feature Substitution Transposition

Action Replaces characters Rearranges positions

Example Caesar, Vigenère Rail Fence, Columnar

Key Type Mapping Pattern or permutation key

Security Focus Confusion Diffusion

Letter pattern same, order


Visibility Letter pattern changes
changes

✅ 11. Define Cryptography.


Definition:
Cryptography is the science of securing information by converting it into unreadable format
(ciphertext) using mathematical algorithms and keys.
Example: AES, RSA, SHA algorithms used in messaging apps.

✅ 12. (Repeated) Decipher “CMTMROOEOORW”, depth = 2 (Rail Fence)


Answer:
As answered in Q5
→ COMETOMORROW

✅ 13. Convert “VALLIAMMAI” using Rail Fence, depth = 2


Answer:
Write in 2 rows (zigzag):
Row 1: V L I M A
Row 2: A L A M I
Cipher Text = VLIMAALAMI

✅ 14. Compare Block Cipher and Stream Cipher (5 points)


Feature Block Cipher Stream Cipher

Unit of Data Fixed-size blocks (e.g., 128-bit) 1 bit/byte at a time

Speed Slower Faster

Example AES, DES RC4, A5

Suitability Secure systems, files Real-time applications

Complexity More complex Simpler

✅ 15. Define Model of Network Security.


Definition:
It is a conceptual model showing how to secure communication between sender and receiver
over a network using encryption and decryption.
Elements:
 Plaintext, encryption algorithm, key, ciphertext, decryption, receiver
Example: HTTPS communication between browser and server.

✅ 16. Explain idea of RC4 Stream Cipher.


Answer:
RC4 is a stream cipher that uses a variable-length key to generate a pseudo-random stream
(keystream).
 It uses KSA (Key Scheduling) and PRGA to generate keystream
 Fast and simple, but now insecure
Example: Once used in WEP/WPA (Wi-Fi), now outdated.
✅ 17. (Repeated) Define Model of Network Security.
Same as Q15 – No change
→ Involves encryption, key, and communication over insecure channel.

✅ 18. Decipher “HEIIOWORLD”, depth = 2 (Rail Fence)


Answer:
2 rows:
Row 1: H E I I O
Row 2: W O R L D
Zigzag Read → HELLOWORLD

✅ 19. Caesar Cipher – Encrypt CRYPTOGRAPHY, Key = 2


Answer:
Shift +2 letters:
C→E, R→T, Y→A, P→R, T→V, O→Q...
→ Cipher Text = ETARVQITCRJRA

✅ 20. Why is symmetric cryptography bad for huge data?


Answer:
Actually, symmetric cryptography (like AES) is good for huge data because it is fast.
Problem: It's bad at key management. Every user pair needs a separate secure key channel.
Example: In a large network, securely distributing keys to 1000 users is difficult.

You might also like