Estimators in Cryptography

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 crypto...

Full description

Bibliographic Details
Main Author: CONSTANTINESCU Nicolae
Format: Article
Language:deu
Published: Mirton Publishing House, Timisoara 2009-12-01
Series:Anale: Seria Informatică
Online Access:http://anale-informatica.tibiscus.ro/download/lucrari/7-2-02-Constantinescu.pdf
id doaj-6a17fb5ad7bf477eb574d24782319112
record_format Article
spelling doaj-6a17fb5ad7bf477eb574d247823191122020-11-25T02:16:40ZdeuMirton Publishing House, TimisoaraAnale: Seria Informatică1583-71652065-74712009-12-01VII22330Estimators in CryptographyCONSTANTINESCU NicolaeOne 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  for the key agreement protocol. http://anale-informatica.tibiscus.ro/download/lucrari/7-2-02-Constantinescu.pdf
collection DOAJ
language deu
format Article
sources DOAJ
author CONSTANTINESCU Nicolae
spellingShingle CONSTANTINESCU Nicolae
Estimators in Cryptography
Anale: Seria Informatică
author_facet CONSTANTINESCU Nicolae
author_sort CONSTANTINESCU Nicolae
title Estimators in Cryptography
title_short Estimators in Cryptography
title_full Estimators in Cryptography
title_fullStr Estimators in Cryptography
title_full_unstemmed Estimators in Cryptography
title_sort estimators in cryptography
publisher Mirton Publishing House, Timisoara
series Anale: Seria Informatică
issn 1583-7165
2065-7471
publishDate 2009-12-01
description 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  for the key agreement protocol.
url http://anale-informatica.tibiscus.ro/download/lucrari/7-2-02-Constantinescu.pdf
work_keys_str_mv AT constantinescunicolae estimatorsincryptography
_version_ 1724889917100654592