New answers tagged

2

I think renew keys after a key generation is problematic because assume that key is already generated by the application. If somehow generate key pass through a function $H(x) = B(preImg(x))$. In simple language a function that somehow analysis key pattern and calculate $n$ pre-images of $x$.


1

In the question's example, C is acting a Man-in-the-Middle (MitM), impersonating B with respect to A (at the communication level) when receiving {RB,B}K, and impersonating A with respect to B (similarly) when sending {RB,B}K. Absent measures not described, B will accept the message {RB,B}K sent by C as if it came directly from A. Such possibility of a MitM ...


0

bk2204 gave a correct detailed answer explaining that they are different protocols for different purposes. TLS being online and PGP/GPG being offline. However, I would argue in many cases TLS actually does make PGP redundant. PGP was originally designed to secure email yet it.is rarely used for that and is primarily seen today to verify the authenticity and ...


6

These are different protocols and they serve different purposes. TLS is an online protocol between two different parties. It's designed to ensure the security of a connection between two endpoints of a connection. The connection is ephemeral and both parties must be online at the same moment with sufficient bandwidth. OpenPGP is an offline protocol. It ...


2

Yes because Uniform distribution has the highest entropy. Even if you have a good mixing function $f$ that is part of a secret sharing scheme, it is very difficult to have $f(X,X’)$ uniform if at least one of the inputs $X$ is nonuniform. No, a probability distribution function is not a boolean function. A boolean function takes values in $\{0,1\}$ or ...


Top 50 recent answers are included