UNIT I

1.What is Network security?

Network security consists of the policies adopted to prevent and monitor unauthorized access, misuse,
modification, or denial of a computer network and network-accessible resources. Network security
involves the authorization of access to data in a network.
2. What is OSI Security Architecture?
The OSI Security Architecture is a framework that provides a systematic way of defining the
requirements for security and characterizing the approaches to satisfying those requirements. The
document defines security attacks, mechanisms, and services, and the relationships among these
categories.
3. Define passive attack and active attack.
Passive attacks are in the nature of eavesdropping, or monitoring of transmissions. The types of passive
attack are Release of message content Traffic analysis
Active attacks involve some modification of data stream or creation of a false stream. The types of active
attack are Masquerade Replay Modification Denial of service.
4. Mention the different types of security services.
Authentication
Confidentiality
Data integrity
Non repudiation
Access control
Availability
5. Define cryptanalysis and cryptology.
Cryptanalysis: techniques used for deciphering or decrypting a message without the knowledge of the
enciphering or encrypting details is said to be cryptanalysis.
Cryptology: the study of cryptography and cryptanalysis together is called cryptology.

6. Define the following terms:

Plaintext: the original message to be transmitted.
Cipher text: the coded (encrypted) message or the scrambled message.
Encryption / Enciphering : process of converting plain text to cipher text.
Decryption/ Deciphering: process of converting cipher text to plain text.
6. What is Brute force attack?
Trying out all the possible keys on a piece of cipher text until an intelligible translation to plain text is
obtained.
7. Mention the various types of cryptanalytic attack.
Known plaintext
Cipher text only
Chosen plaintext
Chosen Cipher text
8. Define the two basic building blocks of encryption techniques.
Substitution technique it is one in which the letters of the plaintext are replaced by other letters or by
numbers or symbols.
Transposition technique it is one which performs some sort of permutation on the plaintext letters.
9. Mention few mono-alphabetic and poly-alphabetic ciphers.
Mono-alphabetic ciphers: - playfair cipher, hill cipher, Caesar cipher
Poly-alphabetic ciphers: - vigenere cipher, one time pad cipher
10. What is steganography? Mention few techniques in it.
Steganography is a technique for hiding the original message. Some of the related techniques are
Character marking
Invisible ink
Pin punctures

Typewriter correction ribbon

11. Define Man-in-the-Middle.
Man-in-the-middle is an attacker sniffs packets from the network, modifies them, and inserts them back
into the network.
12. What is Denial-of-service (DoS) ?
a. attacker sends a large number of connection or information requests to a target
b. so many requests are made that the target system cannot handle them successfully along with other,
legitimate requests for service
c. may result in a system crash, or merely an inability to perform ordinary functions.
13. Define Spoofing
It is a technique used to gain unauthorized access whereby the intruder sends messages to a computer
with an IP address indicating that the message is coming from a trusted host.
14. What are computer security challenges?
1. not simple
2. must consider potential attacks
3. procedures used counter-intuitive
4. involve algorithms and secret info
5. must decide where to deploy mechanisms
15. Define Euclidean Algorithm.
An algorithm credited to Euclid for easily finding the greatest common divisor of two integers. Euclid's
Algorithm keeps computing successive differences until it vanishes, at which point the greatest common
divisor has been reached.
16. What is an abelian group?
If the operation on the set elements is commutative, the group is called an abelian group. An operation
is commutative if a b = b a.

17. What is a ring?

Defining one more operation on an abelian group, then it is a ring, provided the elements of the set
satisfy some properties.
A ring is typically denoted {R, +, } where R denotes the set of objects, + the operator with respect to
which R is an abelian group, the the additional operator needed for R to form a ring.
18. Mention some of the examples of rings.

The set of all even integers, positive, negative, and zero, under the operations arithmetic addition
and multiplication is a ring.

The set of all integers under the operations of arithmetic addition and multiplication is a ring.

19. What is a Field?

A field, denoted {F, +, }, is an integral domain whose elements satisfy the following additional
property:
For every element a in F, except the element designated 0 (which is the identity element for the +
operator), there must also exist in F its multiplicative inverse.
20. Mention some of the examples of positive and negative fields.

The set of all real numbers under the operations of arithmetic addition and multiplication is a
field.

The set of all rational numbers under the operations of arithmetic addition and multiplication is a
field.

The set of all integers under the operations of arithmetic addition and multiplication is NOT a
field.

21. What is Fermats Little Theorem.

Fermat's little theorem states that if p is a prime number, then for any integer a, the number a p a is an
integer multiple of p. In the notation of modular arithmetic, this is expressed as

For example, if a = 2 and p = 7, 27 = 128, and 128 2 = 7 18 is an integer multiple of 7.

If a is not divisible by p, Fermat's little theorem is equivalent to the statement that a p 1 1 is an integer
multiple of p, or in symbols

For example, if a = 2 and p = 7 then 26 = 64 and 64 1 = 63 is thus a multiple of 7.

Fermat's little theorem is the basis for the Fermat primality test and is one of the fundamental results
of elementary number theory.
22. State Eulers Theorem.
In number theory, Euler's theorem (also known as the FermatEuler theorem or Euler's totient
theorem) states that if n and a are coprime positive integers, then
23. What is the difference between diffusion and confusion?
In Diffusion, the statistical structure of the plaintext is dissipated into long range statistics of the cipher
text. This is achieved by having each plaintext digit affect the value of many cipher text digits.
Confusion seeks to make a relationship between the statistics of the cipher text and the value of the
encryption key as complex as possible.
24. Find the gcd (210,45) using Euclids algorithm.
a=210 and b=45

Divide 210 by 45, and get the result 4 with remainder 30, so 210=445+30.

Divide 45 by 30, and get the result 1 with remainder 15, so 45=130+15.

Divide 30 by 15, and get the result 2 with remainder 0, so 30=215+0.

The greatest common divisor of 210 and 45 is 15

25. What is avalanche effect?

The

avalanche

effect

is

desirable

property

of

cryptographic

hashing

algorithm.

It means that a small change in the input (lets say one bit) grows and grows over the time "in" the
algorithm until, statistically speaking, it affects half the bits of the output hash.