Renner–Wolf conjecture on reduced intrinsic information and secret-key rate
Statement
Let be a probability distribution. The Renner–Wolf conjecture.
The reduced intrinsic information is a known upper bound on the secret-key rate and can be strictly smaller than the intrinsic information. Equality would give a simple distribution-based characterization of the secret-key rate; the paper presents this as an open problem.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.