Simulations for Deep Random Secrecy Protocol
This work provides incremental validation of a cryptographic protocol's performance through simulations, relevant for researchers in secure communication.
The authors conducted numerical simulations to measure the secrecy and efficiency rates of a Perfect Secrecy protocol under a Deep Random assumption, specifically evaluating error rates for legitimate partners and eavesdroppers during data exchange, which allowed estimation of a lower bound for the Cryptologic Limit.
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.