Deal of The Day! Hurry Up, Grab the Special Discount - Save 25% - Ends In 00:00:00 Coupon code: SAVE25
Welcome to Pass4Success

- Free Preparation Discussions

Eccouncil 212-81 Exam - Topic 5 Question 67 Discussion

An attack that is particularly successful against block ciphers based on substitution-permutation networks. For a block size b, holds b-k bits constant and runs the other k through all 2k possibilities. For k=1, this is just deferential cryptanalysis, but with k>1 it is a new technique.
D) Integral Cryptanalysis
A) Differential Cryptanalysis
B) Linear Cryptanalysis
C) Chosen Plaintext Attack

Eccouncil 212-81 Exam - Topic 5 Question 67 Discussion

Actual exam question for Eccouncil's 212-81 exam
Question #: 67
Topic #: 5
[All 212-81 Questions]

An attack that is particularly successful against block ciphers based on substitution-permutation networks. For a block size b, holds b-k bits constant and runs the other k through all 2k possibilities. For k=1, this is just deferential cryptanalysis, but with k>1 it is a new technique.

Show Suggested Answer Hide Answer
Suggested Answer: D

Integral Cryptanalysis

https://en.wikipedia.org/wiki/Integral_cryptanalysis

Integral cryptanalysis is a cryptanalytic attack that is particularly applicable to block ciphers based on substitution-permutation networks. It was originally designed by Lars Knudsen as a dedicated attack against Square, so it is commonly known as the Square attack. It was also extended to a few other ciphers related to Square: CRYPTON, Rijndael, and SHARK. Stefan Lucks generalized the attack to what he called a saturation attack and used it to attack Twofish, which is not at all similar to Square, having a radically different Feistel network structure. Forms of integral cryptanalysis have since been applied to a variety of ciphers, including Hierocrypt, IDEA, Camellia, Skipjack, MISTY1, MISTY2, SAFER++, KHAZAD, and FOX (now called IDEA NXT).

Incorrect answers:

Chosen Plaintext Attack - is an attack model for cryptanalysis which presumes that the attacker can obtain the ciphertexts for arbitrary plaintexts. The goal of the attack is to gain information that reduces the security of the encryption scheme.

Linear Cryptanalysis - is a general form of cryptanalysis based on finding affine approximations to the action of a cipher. Attacks have been developed for block ciphers and stream ciphers. Linear cryptanalysis is one of the two most widely used attacks on block ciphers.

Differential Cryptanalysis - is a general form of cryptanalysis applicable primarily to block ciphers, but also to stream ciphers and cryptographic hash functions. In the broadest sense, it is the study of how differences in information input can affect the resultant difference at the output. In the case of a block cipher, it refers to a set of techniques for tracing differences through the network of transformation, discovering where the cipher exhibits non-random behavior, and exploiting such properties to recover the secret key (cryptography key).


Contribute your Thoughts:

0/2000 characters
Paz
4 days ago
I agree with A) Differential Cryptanalysis. The constant bits part is key to the definition.
upvoted 0 times
...
Earlean
9 days ago
I'm leaning towards D) Integral Cryptanalysis. It sounds like a new approach to me.
upvoted 0 times
...
Lura
14 days ago
I feel like it's B) Linear Cryptanalysis. The k>1 part makes me think of linear techniques.
upvoted 0 times
...
Ira
20 days ago
I think it's A) Differential Cryptanalysis. It fits the description well.
upvoted 0 times
...
Rolland
25 days ago
C) Chosen Plaintext Attack seems off. It doesn’t match the technique described.
upvoted 0 times
...
Beata
30 days ago
I feel A is definitely the best choice. The k>1 part is key.
upvoted 0 times
...
Frederic
1 month ago
I agree, but what about B) Linear Cryptanalysis? It also targets block ciphers.
upvoted 0 times
...
Julio
1 month ago
I think it's A) Differential Cryptanalysis. It fits the description well.
upvoted 0 times
...
Allene
2 months ago
A) Differential Cryptanalysis seems right. It matches the k=1 explanation perfectly.
upvoted 0 times
...
Melodie
2 months ago
I'm leaning towards D) Integral Cryptanalysis. It sounds like a new technique.
upvoted 0 times
...
Eladia
2 months ago
I feel like it's B) Linear Cryptanalysis. The constant bits make sense.
upvoted 0 times
...
Thaddeus
2 months ago
I think it's A) Differential Cryptanalysis. It fits the description well.
upvoted 0 times
...
Francine
2 months ago
I disagree, it’s not integral cryptanalysis either.
upvoted 0 times
...
Truman
2 months ago
Definitely not chosen plaintext attack.
upvoted 0 times
...
Kip
4 months ago
Wait, k>1 is a new technique? That's interesting!
upvoted 0 times
...
Ernie
4 months ago
I think it's actually linear cryptanalysis.
upvoted 0 times
...
Gennie
4 months ago
Sounds like differential cryptanalysis to me!
upvoted 0 times
...
Charlesetta
4 months ago
I agree with Merissa, differential is the way to go here!
upvoted 0 times
...
Goldie
5 months ago
Definitely not chosen plaintext attack, that's for sure.
upvoted 0 times
...
Keneth
5 months ago
Wait, is this really a new technique? I thought k=1 was the limit.
upvoted 0 times
...
Lemuel
5 months ago
I think it's actually linear cryptanalysis, though.
upvoted 0 times
...
Merissa
5 months ago
Sounds like a classic case of differential cryptanalysis!
upvoted 0 times
...
Misty
5 months ago
I thought chosen plaintext attacks were more about manipulating input to get useful output, so this doesn't seem like that. I lean towards differential cryptanalysis, but I’m not completely confident.
upvoted 0 times
...
Vannessa
5 months ago
This might be integral cryptanalysis, but I can't recall the details about how it works with the k bits. It feels like a tricky question!
upvoted 0 times
...
Annmarie
6 months ago
I remember studying linear cryptanalysis too, but this seems different since it focuses on holding bits constant. I wonder if it's really differential or something else entirely.
upvoted 0 times
...
Francis
6 months ago
I think this sounds a lot like differential cryptanalysis, especially since it mentions holding bits constant. But I'm not entirely sure about the specifics with k.
upvoted 0 times
...

Save Cancel