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.
"synopsis" may belong to another edition of this title.
Thibault 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 IT industry, he pursued personal research in the domain of cryptology and information theory.
"About this title" may belong to another edition of this title.
US$ 26.97 shipping from Germany to U.S.A.
Destination, rates & speedsSeller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Taschenbuch. Condition: 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. Seller Inventory # 9786134930901
Quantity: 2 available
Seller: Revaluation Books, Exeter, United Kingdom
Paperback. Condition: Brand New. 88 pages. 8.66x5.91x0.20 inches. In Stock. Seller Inventory # zk6134930903
Quantity: 1 available
Seller: moluna, Greven, Germany
Condition: 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 . Seller Inventory # 385843883
Quantity: Over 20 available
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Taschenbuch. Condition: 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. Seller Inventory # 9786134930901
Quantity: 2 available
Seller: AHA-BUCH GmbH, Einbeck, Germany
Taschenbuch. Condition: 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. Seller Inventory # 9786134930901
Quantity: 1 available