Papers
Topics
Authors
Recent
Search
2000 character limit reached

Estimators in Cryptography

Published 27 Feb 2012 in cs.CR | (1202.5921v2)

Abstract: One of the main problems in cryptography is to give criteria to provide good comparators of cipher systems. The security of a cipher system must include the security of the algorithm, the security of the key generator and management module (see [BM94], [CM97],[Mau92a]) and the security of the cryptographic key agreement protocol (see [Mau93a],[MC94],[Mau93b],[Mau92b]). This paper gives show the necessary mathematical background to estimate the most important cryptographic measures of the key generators and of the unconditionally key agreement protocols. These cryptographic measures are the Shannon entropy (for the key generator module) and Renyi entropy of order alpha for the key agreement protocol.

Citations (3)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.