Bayesian estimates in cryptography

  • Authors:
  • George Stephanides

  • Affiliations:
  • Department of Applied Informatics, University of Macedonia, Thessaloniki, Greece

  • Venue:
  • ICCOM'05 Proceedings of the 9th WSEAS International Conference on Communications
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

A new method of estimating the most important cryptographic measures of the key generators and of the unconditionally secure key agreement protocols is presented. The aim of this article is to give a Bayesian estimation of a general class of entropies that includes Shannon entropy and Rényi entropy of order 2, which are cryptographic measures for the key generator module and for the key agreement protocol, respectively. It is also given a numerical simulation where the Bayesian estimate is computed using binary codification of the source.