Log In Sign Up

Towards Practical Implementation of Deep Random Secrecy

by   Thibault de Valroger, et al.

We have formerly introduced Deep Random Secrecy, a new cryptologic technique capable to ensure secrecy as close as desired from perfection against unlimited passive eavesdropping opponents. We have also formerly introduced an extended protocol, based on Deep Random Secrecy, capable to resist to unlimited active MITM. The main limitation of those protocols, in their initial presented version, is the important quantity of information that needs to be exchanged between the legitimate partners to distill secure digits. We have defined and shown existence of an absolute constant, called Cryptologic Limit, which represents the upper-bound of Secrecy rate that can be reached by Deep Random Secrecy protocols. At last, we have already presented practical algorithms to generate Deep Randomness from classical computing resources. This article is presenting an optimization technique, based on recombination and reuse of random bits; this technique enables to dramatically increase the bandwidth performance of formerly introduced protocols, without jeopardizing the entropy of secret information. That optimization enables to envision an implementation of Deep Random Secrecy at very reasonable cost. The article also summarizes former results in the perspective of a comprehensive implementation.


page 1

page 2

page 3

page 4


Physical Layer Security Protocol for Poisson Channels for Passive Man-in-the-middle Attack

In this work, we focus on the classical optical channel having Poissonia...

Practical Implementation of a Deep Random Generator

We have introduced in former work the concept of Deep Randomness and its...

Secrecy by Witness-Functions on Increasing Protocols

In this paper, we present a new formal method to analyze cryptographic p...

Deep Random based Key Exchange protocol resisting unlimited MITM

We present a protocol enabling two legitimate partners sharing an initia...

Can Marton Coding Alone Ensure Individual Secrecy?

For communications in the presence of eavesdroppers, random components a...

Secure Voting Protocols with Perfect Ballot Secrecy

Securing voters' privacy and ensuring the integrity of the voting proces...

Economically Viable Randomness

We study the problem of providing blockchain applications with economica...