Why is deep random suitable for cryptology

We present a new form of randomness, called « Deep Randomness », generated in such a way that probability distribution of the output signal is made unknowledgeable for an observer. By limiting, thanks to Deep Randomness, the capacity of the opponent observer to perform Bayesian inference over public information to estimate private information, we can design protocols, beyond Shannon limit, enabling two legitimate partners, sharing originally no common private information, to exchange secret information with accuracy as close as desired from perfection, and knowledge as close as desired from zero by any unlimitedly powered opponent. We discuss the theoretical foundation of Deep Randomness, which lies on Prior Probability theory, introduced and developed by authors like Laplace, Cox, Carnap, Jefferys and Jaynes; and we introduce computational method to generate such Deep Randomness.