Modern cryptography mostly relies on mathematical problems commonly trusted as very difficult to solve, such as large integer factorization or discrete logarithm, belonging to complexity theory. No certainty exist on the actual difficulty of those problems, not even the truth of the famous P≠NP conjecture. Furthermore, most of them are not resistant to quantum computing, which should make them useless in the next decades. In this work, a new idea is presented to design secure communication protocols capable to resist to unlimited opponents. Those protocols use a new form of randomness, called « Deep Random », capable to hide its probability distribution to the observers, and thus to prevent them performing Bayesian inference over public information to estimate the private information. The theoretical foundations are established, and an example is presented with its proof of security.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
EUR 9,70 expédition depuis Allemagne vers France
Destinations, frais et délaisVendeur : moluna, Greven, Allemagne
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Valroger Thibault deThibault de Valroger studied mathematics and computer science at Telecom Paris Tech, and has become an international expert in digital trust during the last 15 years. In parallel of his professional career in the . N° de réf. du vendeur 385843883
Quantité disponible : Plus de 20 disponibles
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Modern cryptography mostly relies on mathematical problems commonly trusted as very difficult to solve, such as large integer factorization or discrete logarithm, belonging to complexity theory. No certainty exist on the actual difficulty of those problems, not even the truth of the famous P NP conjecture. Furthermore, most of them are not resistant to quantum computing, which should make them useless in the next decades. In this work, a new idea is presented to design secure communication protocols capable to resist to unlimited opponents. Those protocols use a new form of randomness, called ' Deep Random ', capable to hide its probability distribution to the observers, and thus to prevent them performing Bayesian inference over public information to estimate the private information. The theoretical foundations are established, and an example is presented with its proof of security. 88 pp. Englisch. N° de réf. du vendeur 9786134930901
Quantité disponible : 2 disponible(s)
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Modern cryptography mostly relies on mathematical problems commonly trusted as very difficult to solve, such as large integer factorization or discrete logarithm, belonging to complexity theory. No certainty exist on the actual difficulty of those problems, not even the truth of the famous P NP conjecture. Furthermore, most of them are not resistant to quantum computing, which should make them useless in the next decades. In this work, a new idea is presented to design secure communication protocols capable to resist to unlimited opponents. Those protocols use a new form of randomness, called ' Deep Random ', capable to hide its probability distribution to the observers, and thus to prevent them performing Bayesian inference over public information to estimate the private information. The theoretical foundations are established, and an example is presented with its proof of security. N° de réf. du vendeur 9786134930901
Quantité disponible : 1 disponible(s)
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Taschenbuch. Etat : Neu. Neuware -Modern cryptography mostly relies on mathematical problems commonly trusted as very difficult to solve, such as large integer factorization or discrete logarithm, belonging to complexity theory. No certainty exist on the actual difficulty of those problems, not even the truth of the famous P¿NP conjecture. Furthermore, most of them are not resistant to quantum computing, which should make them useless in the next decades. In this work, a new idea is presented to design secure communication protocols capable to resist to unlimited opponents. Those protocols use a new form of randomness, called « Deep Random », capable to hide its probability distribution to the observers, and thus to prevent them performing Bayesian inference over public information to estimate the private information. The theoretical foundations are established, and an example is presented with its proof of security.Books on Demand GmbH, Überseering 33, 22297 Hamburg 88 pp. Englisch. N° de réf. du vendeur 9786134930901
Quantité disponible : 2 disponible(s)
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Paperback. Etat : Brand New. 88 pages. 8.66x5.91x0.20 inches. In Stock. N° de réf. du vendeur zk6134930903
Quantité disponible : 1 disponible(s)