Skip to main content
mathjax
Source Link
forest
  • 16.1k
  • 2
  • 51
  • 106

Yes, the computation is correct: the passwords will have an entropy of $log_2(26^2\cdot10)\simeq {12.7}$$\log_2(26^2\cdot10)\approx {12.7}$, which means that they are weaker than a randomly chosen secret key with 13 bits.

Yes, the computation is correct: the passwords will have an entropy of $log_2(26^2\cdot10)\simeq {12.7}$, which means that they are weaker than a randomly chosen secret key with 13 bits.

Yes, the computation is correct: the passwords will have an entropy of $\log_2(26^2\cdot10)\approx {12.7}$, which means that they are weaker than a randomly chosen secret key with 13 bits.

deleted 1 characters in body
Source Link
bob
  • 1.2k
  • 10
  • 25

Yes, the computation is correct: the passwords will have an entropy of $log_2(26^2\cdot10)\simeq2^{12.7}$$log_2(26^2\cdot10)\simeq {12.7}$, which means that they are weaker than a randomly chosen secret key with 13 bits.

Yes, the computation is correct: the passwords will have an entropy of $log_2(26^2\cdot10)\simeq2^{12.7}$, which means that they are weaker than a randomly chosen secret key with 13 bits.

Yes, the computation is correct: the passwords will have an entropy of $log_2(26^2\cdot10)\simeq {12.7}$, which means that they are weaker than a randomly chosen secret key with 13 bits.

Source Link
bob
  • 1.2k
  • 10
  • 25

Yes, the computation is correct: the passwords will have an entropy of $log_2(26^2\cdot10)\simeq2^{12.7}$, which means that they are weaker than a randomly chosen secret key with 13 bits.