Simulations for Deep Random Secrecy 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.
Cite
@article{arxiv.1611.01683,
title = {Simulations for Deep Random Secrecy Protocol},
author = {Thibault de Valroger},
journal= {arXiv preprint arXiv:1611.01683},
year = {2018}
}
Comments
18 pages. V2: simulations corresponding to an updated protocol has been performed and complemented. Simulated effect of Privacy Amplification is also added. V3: a simulation with a flawed error correcting method is removed. V4: Updated reminder in the formalism of Deep Random assumption. arXiv admin note: substantial text overlap with arXiv:1507.08258; text overlap with arXiv:1605.04576