Perfect Secrecy under Deep Random Assumption
(Sprache: Englisch)
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,...
Leider schon ausverkauft
versandkostenfrei
Buch
21.90 €
10 DeutschlandCard Punkte
sammeln
- Lastschrift, Kreditkarte, Paypal, Rechnung
- Kostenlose Rücksendung
Produktdetails
Produktinformationen zu „Perfect Secrecy under Deep Random Assumption “
Klappentext zu „Perfect Secrecy under Deep Random Assumption “
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.
Bibliographische Angaben
- Autor: Thibault de Valroger
- 2017, 88 Seiten, Maße: 22 cm, Kartoniert (TB), Englisch
- Verlag: LAP Lambert Academic Publishing
- ISBN-10: 6134930903
- ISBN-13: 9786134930901
Sprache:
Englisch
Kommentar zu "Perfect Secrecy under Deep Random Assumption"
0 Gebrauchte Artikel zu „Perfect Secrecy under Deep Random Assumption“
| Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
|---|
Schreiben Sie einen Kommentar zu "Perfect Secrecy under Deep Random Assumption".
Kommentar verfassen