100% satisfaction guarantee Immediately available after payment Both online and in PDF No strings attached
logo-home
Previously searched by you
Previously searched by you
logo
Cryptography Final Actual Exam Questions and CORRECT Answers $9.49
Add to cart
Quickly navigate to
Preview
  2.  
  3. Cryptography
  4.  
  5. Cryptography

Exam (elaborations)

Cryptography Final Actual Exam Questions and CORRECT Answers
 0 purchase
  • Course
  • Cryptography
  • Institution
  • Cryptography

Cryptography Final Actual Exam Questions and CORRECT Answers Keys used in an encryption, and the corresponding decryption functions must be the same - CORRECT ANSWER- False For a Shannon cipher(E,D) defined over (k,m,c), D(k, E(k,m))=m - CORRECT ANSWER- True Knowing that entropy is a measur...

[Show more]

Preview 2 out of 7  pages

Document information

  • October 5, 2024
  • 7
  • 2024/2025
  • Exam (elaborations)
  • Questions & answers

Subjects

Written for

  • Cryptography
  • Cryptography

Seller

avatar-seller
MGRADES

Reviews received

Content preview

Cryptography Final Actual Exam
Questions and CORRECT Answers
Keys used in an encryption, and the corresponding decryption functions must be the same -
CORRECT ANSWER✔✔- False


For a Shannon cipher(E,D) defined over (k,m,c), D(k, E(k,m))=m - CORRECT
ANSWER✔✔- True


Knowing that entropy is a measure of randomness (more randomness =less predictability =
more entropy), we can tell that ABCDEFGHHHHHHH has higher entropy than ABCDEFGH
- CORRECT ANSWER✔✔- False


For enhanced security, an organization should use secret encryption algorithms that nobody
knows - CORRECT ANSWER✔✔- False



Hash of a plaintext is usually shorter than its ciphertext - CORRECT ANSWER✔✔- True


In English language, the frequency of A is less than the "frequency of AB+ frequency of AC"
- CORRECT ANSWER✔✔- False


If a Shannon cipher (E, D) defined over (k,m,c) is perfectly secure, then the length of k>=the
length of m - CORRECT ANSWER✔✔- True


Knowing that entropy is a measure of randomness (more randomness = less predictability =
more entropy), we can tell that ABCDEFGHIJKLMN has higher entropy than ABCDEFGH -
CORRECT ANSWER✔✔- True


In a game, Stefany randomly picks a letter from "A", "B" and "C" and Brandon randomly
picks a number from "1","2","3" and "4". To win, Stefany needs to guess Brandon's number
and Brandon needs to guess Stefany's letter. If played many times who is expected to win the
game? - CORRECT ANSWER✔✔- Brandon

, If we can guess the bits (0's and 1's) of a digital key by the power consumption of a decryptor
circuit, we can call our effort a - CORRECT ANSWER✔✔- side channel attack


During Diffie-Hellman key exchange, the order of key exchange (i.e., which party sends the
part of the "key" to the other party first) does not matter - CORRECT ANSWER✔✔- True



E(alpha) is easily computable - CORRECT ANSWER✔✔- True



(2^3)^2 = - CORRECT ANSWER✔✔- (2^2)^3



In RSA endcryption, E(D(M))= D(E(M)) - CORRECT ANSWER✔✔- True



(2^3)^2 mod 3 = - CORRECT ANSWER✔✔- 1


Prime p and generator g in Diffie-Hellman key exchange algorithm, ideally, should be kept
secret - CORRECT ANSWER✔✔- False


Use of the same cryptographic key for multiple purposes is a recommended key management
practice - CORRECT ANSWER✔✔- False


Functions E() and F() in Diffie-Hellman key exchange algorithm must be kept secret -
CORRECT ANSWER✔✔- False


Protocol ElGamal key agreement (Menezes, Page 517) is nothing but the Diffie-Hellman key
exchange with part of the "key" computed by one party is made public - CORRECT
ANSWER✔✔- True


Given E() and the value of E(alpha), "alpha" is easily computable - CORRECT
ANSWER✔✔- False



If a, b, c are binary variables, a XOR b XOR c= a + b + c mod 2 - CORRECT ANSWER✔✔-
True

The benefits of buying summaries with Stuvia:

Guaranteed quality through customer reviews

Guaranteed quality through customer reviews

Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.

Quick and easy check-out

Quick and easy check-out

You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.

Focus on what matters

Focus on what matters

Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!

Frequently asked questions

What do I get when I buy this document?

You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.

Satisfaction guarantee: how does it work?

Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.

Who am I buying these notes from?

Stuvia is a marketplace, so you are not buying this document from us, but from seller MGRADES. Stuvia facilitates payment to the seller.

Will I be stuck with a subscription?

No, you only buy these notes for $9.49. You're not tied to anything after your purchase.

Can Stuvia be trusted?

4.6 stars on Google & Trustpilot (+1000 reviews)

69052 documents were sold in the last 30 days

Founded in 2010, the go-to place to buy study notes for 15 years now

Start selling
$9.49
  • (0)
Add to cart
Added