Photo from academic.microsoft.com
In this paper we introduce two normalized versions of non-perfect security for private-key encryption: one version in the framework of Shannon entropy, another version in the framework of Kolmogorov complexity.… Click to show full abstract
In this paper we introduce two normalized versions of non-perfect security for private-key encryption: one version in the framework of Shannon entropy, another version in the framework of Kolmogorov complexity. We prove the lower bound on either key entropy or key size for these models and study the relations between these normalized security notions.
Keywords:
key encryption;
private key;
security;
normalized unconditional;
security private
Journal Title: Entropy
Year Published: 2017
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Entropy
Year Published: 2017
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!