Simulations for Deep Random Secrecy Protocol

TL;DR

This paper uses numerical simulations to evaluate the secrecy and efficiency of a deep random secrecy protocol, analyzing error rates and estimating cryptologic limits to understand its practical performance.

Contribution

It provides the first detailed numerical analysis of the protocol's secrecy and efficiency, including error rate measurements and parameter impact assessment.

Findings

Legitimate partner maintains low error rates

Eavesdropper error rates are high, indicating strong secrecy

Estimated cryptologic limit bounds for the protocol

Abstract

We present numerical simulations measuring secrecy and efficiency rate of Perfect Secrecy protocol presented in former article named Perfect Secrecy under Deep Random assumption. Those simulations specifically measure the respective error rates of both legitimate partner and eavesdropper experimented during the exchange of a data flow through the protocol. Those measured error rates also enable us to estimate a lower bound of the Crytpologic Limit introduced in article named Perfect Secrecy under Deep Random assumption. We discuss the variation of the protocol parameters and their impact on the measured performance.