Skip to main content
Cryptography

Return to Question

Tweeted twitter.com/StackCrypto/status/1157803519489007616
Fixing the equations and some grammatical issues.
Source Link
edit approved Aug 1, 2019 at 3:04
Mahdi
edit approved Aug 1, 2019 at 3:04
Mahdi
  • 306
  • 1
  • 4
  • 17

Please explain me why we require 2^m$2^m$ & 2^($2^{\frac{m/}{2)}}$ random messages

Assume that a one-way hashHash function is secure and the best way to attack it is by using the brute force attack. It produces an m$m$-bit output. Finding a message that hashes to a given hash value would require hashing 2^m$2^m$ random messages.. Finding two messages that hash to the same value would only require hashing 2^(m/2)$2^{\frac{m}{2}}$ random messages.

I know only about birthday paradox involving 23 people. How do I relate the birthday paradox with this oneattack?

Please explain me why we require 2^m & 2^(m/2) random messages

Assume that a one-way hash function is secure and the best way to attack it is by using brute force. It produces an m-bit output. Finding a message that hashes to a given hash value would require hashing 2^m random messages. Finding two messages that hash to the same value would only require hashing 2^(m/2) random messages.

I know only about birthday paradox involving 23 people. How do I relate birthday paradox with this one?

Please explain me why we require $2^m$ & $2^{\frac{m}{2}}$ random messages

Assume that a one-way Hash function is secure and the best way to attack it is by using the brute force attack. It produces an $m$-bit output. Finding a message that hashes to a given hash value would require hashing $2^m$ random messages. Finding two messages that hash to the same value would only require hashing $2^{\frac{m}{2}}$ random messages.

I know only about birthday paradox involving 23 people. How do I relate the birthday paradox with this attack?

added 25 characters in body
Source Link
Chaitanya Reddy
Chaitanya Reddy
  • 31
  • 4

Assume that a one-way hash function is secure and the best way to attack it is by using brute force. It produces an m-bit output. Finding a message that hashes to a given hash value would require hashing 2^m random messages. Finding two messages that hash to the same value would only require hashing 2^(m/2) random messages.

I know only about birthday paradox involving 23 people. How do I relate birthday paradox with this one?

Assume that a one-way hash function is secure and the best way to attack it is by using brute force. It produces an m-bit output. Finding a message that hashes to a given hash value would require hashing 2^m random messages. Finding two messages that hash to the same value would only require hashing 2^(m/2) random messages.

I know about birthday paradox. How do I relate birthday paradox with this one?

Assume that a one-way hash function is secure and the best way to attack it is by using brute force. It produces an m-bit output. Finding a message that hashes to a given hash value would require hashing 2^m random messages. Finding two messages that hash to the same value would only require hashing 2^(m/2) random messages.

I know only about birthday paradox involving 23 people. How do I relate birthday paradox with this one?

added 90 characters in body; edited title
Source Link
Chaitanya Reddy
Chaitanya Reddy
  • 31
  • 4

Please helpexplain me clarify this sentencewhy we require 2^m & 2^(m/2) random messages

Assume that a one-way hash function is secure and the best way to attack it is by using brute force. It produces an m-bit output. Finding a message that hashes to a given hash value would require hashing 2^m random messages.2^m random messages. Finding two messages that hash to the same value would only require hashing 2^(m/2) random messages2^(m/2) random messages.

I know about birthday paradox. How do I relate birthday paradox with this one?

Please help me clarify this sentence

Assume that a one-way hash function is secure and the best way to attack it is by using brute force. It produces an m-bit output. Finding a message that hashes to a given hash value would require hashing 2^m random messages. Finding two messages that hash to the same value would only require hashing 2^(m/2) random messages.

Please explain me why we require 2^m & 2^(m/2) random messages

Assume that a one-way hash function is secure and the best way to attack it is by using brute force. It produces an m-bit output. Finding a message that hashes to a given hash value would require hashing 2^m random messages. Finding two messages that hash to the same value would only require hashing 2^(m/2) random messages.

I know about birthday paradox. How do I relate birthday paradox with this one?

Source Link
Chaitanya Reddy
Chaitanya Reddy
  • 31
  • 4