Professional Documents
Culture Documents
3. How many keys are required for two people to communicate via a cipher?
If both sender and receiver use the same key, the system is referred to as symmetric,
single key, secret key, or conventional encryption. If the sender and receiver each use a
different key, the system is referred to as asymmetric, two-key, or public-key encryption.
16. Which parameters and design choices determine the actual algorithm of a feistel
cipher?
Block size
Key size
Number of rounds
Sub key generation algorithm
Round functions
Fast software encryption or decryption
Ease of analysis
19. What is the difference between a mono alphabetic cipher and a poly alphabetic
cipher?
Mono alphabetic cipher: Here a single cipher alphabet is used.
Poly alphabetic cipher: Here a set of related mono alphabetic substitution rules is used.
UNIT II
3. What was the original set of criteria used by NIST to evaluate candidate AES
cipher?
The original set of criteria used by NIST to evaluate candidate AES cipher was:
Security
Actual Security
Randomness
Soundness
Other security factors
Cost
Licensing Requirements
Computational Efficiency
Memory Requirements
Algorithm And Implementation Characteristics
Flexibility
Hardware and software suitability
Simplicity
4. What was the final set of criteria used by NIST to evaluate candidate AES
ciphers?
The final set of criteria used by NIST to evaluate candidate AES ciphers was:
General Security
Software Implementations
Restricted-Space Environments
Hardware Implementations
Attacks On Implementations
Encryption vs. Decryption
Key Agility
Other Versatility And Flexibility
Potential for Instruction-Level Parallelism
14. What is the difference between Sub Bytes and Sub Word?
Sub Bytes:
Sub Bytes uses an S-box to perform a byte-by-byte substitution of the block.
Sub Word:
Sub Word performs a byte substitution on each byte of its input word,using the Sbox.
15. What is the difference between Shift Rows and Rot Word?
Shift Rows:
Shift Row is simple permutation. It shifts the rows circularly left or right.
Rot Word:Rot word performs a one-byte circular left shift on a word. This means that an
input word [b0,b1,b2,b3] is transformed into [b1,b2,b3,b0].
16. Why do some block cipher modes of operation only use encryption while others
use both encryption and decryption?
Some block cipher modes of operation only use encryption because the input is set to
some initialization vector and the leftmost bits of the output of the encryption function
are XORed with the first segment of plain text p1 to produce the first unit of cipher text
C1 and it is transmitted. While in decryption, the cipher text is XORed with the output of
the encryption function to produce the plain text.
17. What is triple encryption?
Tuchman proposed a triple encryption method that uses only two keys [TUCH79].
The function follows an encrypt – decrypt – encrypt (EDE) sequence.
C=Ek1[Dk2[Ek1[P]]]
There is no cryptographic significance to the use of decryption for the second
stage. Its only advantage is that it allows users of 3DES to decrypt data encrypted by
users of the older single DES:
C=Ek1[Dk2[Ek1[P]]] = Ek1[P]
18. What is a meet-in-the-middle attack?
Meet-in-the-middle attack, was first described in [DIFF77]. It is based on the
observation that, if we have
C=Ek2[Ek1[P]]
Then
X=Ek1[P]=Dk2[C]
Given a known pair, (P,C), the attack proceeds as follows. First, encrypt P for all
256 possible values of K1. Store these results in a table and then sort the table by the
values of X. Next, decrypt C using all 256 possible values of K2. As each decryption is
produced, check the result against the table for a match. If a match occurs, then test the
two resulting keys against a new known plaintext-ciphertext pair. If the two keys produce
the correct ciphertext, accept them as the correct keys.
UNIT III
11. List ways in which secret keys can be distributed to two communicating parties.
• A can select a key and physically deliver it to B.
• A third party can select the key and physically deliver it o A and B
• If A and B have previously and recently used a key, one party can transmit the
new key to the other, encrypted using the old key
• If A and B each has an encrypted connection to a third party C, C can deliver a
key on the encrypted links to A and B
12. What is the difference between a session key and a master key?
The session key is used for the duration of For each end system or user, there is a
a logical connection, such as a frame relay unique master key that it shares with the
connection or transport connection, and key distribution center. These master keys
then discarded. must be distributed in some fashion.
17. Why is the middle portion of 3DES a decryption rather than an encryption?
Decryption requires that the keys be applied in reverse order:
P=Dk1[Ek1[P]]
This results in a dramatic increase in cryptographic strength.The use of DES results in a
mapping that is not equivalent to a single DES encryption.
18. What is the difference between the AES decryption algorithm and the equivalent
inverse cipher?
In AES decryption, we use inverse shift rows inverse sub bytes, add round key, inverse
mix columns. But in equivalent inverse cipher, we interchange inverse shift rows and
inverse sub bytes.
Unit IV
1. Differentiate public key encryption and conventional encryption.
Conventional Encryption Public key Encryption
1. Same algorithm with 1.Same algorithm is used for
same key used for encryption & decryption with
encryption and decryption. a pair of keys.
2. Sender & receiver must 2.Sender & receiver have one of
share the algorithm and key. the matched pair keys.
3. Key must be kept secret. 3. Any one of the key must be
kept secret.
2. Specify the application of public key cryptography.
Encryption/Decryption.
Digital signature.
Key exchange.
3. Determine the gcd(24140,16762) using Euclid’s algorithm.
Soln:
We know, gcd(a,b)=gcd(b,a mod b)
gcd(24140,16762)=gcd(16762,7378)
gcd(7378,2006)=gcd(2006,1360)
gcd(1360,646)=gcd(646,68)
gcd(68,34)=34
gcd(24140,16762) = 34.
4.Perform encryption and decryption using RSA alg. For the following.
P=7; q=11; e=17; M=8.
Soln:
n=pq
n=7*11=77
ö(n)=(p-1) (q-1)
=6*10 = 60
e=17
d =27
C= Me mod n
C = 817 mod 77
= 57
M = Cd mod n
= 5727 mod 77
=8
5. User A & B exchange the key using Diffie Hellman alg. Assume
á=5 q=11 XA=2 XB=3. Find YA, YB, K.
Soln:
YA = áXA mod q
=52 mod 11
=3
YB = áXB mod q
= 53 mod 11
=4
KA = YBXA mod q
= 42 mod 11
=5
KB = YAXB mod q
= 33 mod 11
=5
14.Define Kerberos.
Kerberos 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.
Unit V
1. What are the services provided by PGP services
• Digital signature
• Message encryption
• Compression
• E-mail compatibility
• Segmentation
7. Define S/MIME?
Secure/Multipurpose Internet Mail Extension(S/MIME) is a security enhancement
to the MIME Internet E-mail format standard, based on technology from RSA Data
Security.
UNIT 1
1.Explain the OSI Architecture.
• Notes
• Diagram
• Illustration
2.Explain Classical Encryption Techniques.
Symmetric Ciphers
Caesar Cipher
Mono alphabetic
Poly alphabetic
3.Explain DES Algorithm.
• Notes
• Diagram
• Illustration
• Algorithm
4.Explain AES.
• Notes
• Diagram
• Illustration
• Algorithm
5.Describe about Traffic Confidentiality.
Cryptanalytic methods in traffic analysis and ciphers achieving
confidentiality.
UNIT 2
1.Explain Kerberos.
Algorithm
Explanation
Diagram
5.Describe S/MIME.
Algorithm
Explanation
Diagram
UNIT 5