ccs important questions
ccs important questions
Given Cipher text “ATTACKATONCE with Shift: 4”, by Caesar cipher. Try to encrypt
and decrypt the message.
Compare Block cipher and Stream cipher
Find GCD (24140, 16762) using Euclid’s algorithm.
Difference between Symmetric and Asymmetric key cryptography.
Define totient Euler’s function. Solve F (5) using it
What is Message Authentication Code? How it differs from Hash function?
How to revocate the certificate in X.509
Define Cybercrime and explain it possess significant challenges to individuals,
organization and society.
What is Email Bombing and Salami Attack.
Define syware
define Threats
PART-B
1) Elaborate with any three examples list out the types of Classical encryption
techniques.
2) Illustrate the rules to perform encryption cipher and encrypt with the given
Key=deceptive and the Plain text= we are discovered save yourself.
3) Explain in detail the DES structure in a symmetric cipher of block with 64 bits.
4) State the progression of Advanced Encryption Standard with its detail structure,
Transformation function of the encryption Process.
5) Alice and Bob exchange a shift cipher key using the Diffie-Hellman key exchange.
They agree to use the prime p = 23 where g=9, a=4, b=3..
6) You are given two prime numbers, p=13 and q=17. Calculate the following:
i) Compute n, the modulus for the RSA cryptosystem.
ii) Calculate (n), Euler's Totient Function of n, which represents thecount of
positive integers less than n that are relatively prime to n.
iii) Find the public exponent (e) for the RSA cryptosystem.
iv) Calculate the private exponent (d) for the RSA cryptosystem.
Alice and Bob exchange a shift cipher key using the Diffie-Hellman key exchange.
They agree to use the prime p = 11 for their cyclic group Zu and
g = 7 as the generator.
(i) Assume Alice uses the secret value a = 6 and Bob the secret value b = 8 Compute
the public values and the final key that Alice and Bob exchange.
(ii) Assume Alice and Bob exchange the values X = g ^ a = 5 mod 11 and y = g ^ b =
10 mod 11. Determine the secret key they both exchanged! Describe your computation
steps to determine the key
7) State Chinese Remainder theorem and find the value of X for the given set of
congruent equations using Chinese Remainder theorem.
x ≡ 1 mod 5
x ≡ 2 mod 6
x ≡ 3 mod 7
8) Explain in detail Ellgama Cryptosystem with a suitable algorithm to solve the
line of y = mx+c with a point (0,1) curve
9) Evaluate the strengths and weaknesses of your case study, providing evidence to
support your claims using Spyware.
10) Assume when an attacker tries to modify the database content by inserting an
UPDATE statement. Identify this SQL injection attack method and justify. Detail the
methods used to prevent SQL injection attack.
11) Encrypt the message “CAT” at the sender end and decrypt the message at receiver
end with using Hill-cipher with the key.
12) Consider a banking application that is expected to provide cryptographic
functionalities. Assume that this application is running on top of another
application wherein the end customers can perform a single task of fund transfer.
The application requires cryptographic requirements based on the amount of
transfer. Suggest the security scheme to be adopted in client and server side to
accommodate the above requirements and justify your recommendations.
Transfer amount Cryptography function required
1-2000 Message digest
2001- 5000 Digital Signature
5000 and above Digital Signature and encryption
13)Illustrate the rules to perform encryption using play fair cipher and encrypt
‘snowshooos’ using ‘monarchy’ I and J count as one letter and x is the filler
letter. 14) Using Vigenère cipher Method I, II, encrypt
the word “explanation” using the Key leg.
15) Perform SDES Encryption using the following
Plain text = 11000011; Key: 1010101101; P10: 3,5,1,7,9,2,6,4,8,10
P8: 3,2,6,5,8,7,1,4; E/P: 41232341; P4:4321; IP:1,3,8,7,6,4,5,2
Where P10: permutation order for 10 bits
P8: permutation order for 8 bits, E/P: expansion permutation order
P4: permutation order for 4 bitaree.com, IP: Initial permutation order
S0, S1: substitution boxes
(