Improving TLS Security By Quantum Cryptography
نویسندگان
چکیده
منابع مشابه
Improving Tls Security by Quantum Cryptography
Quantum Cryptography or Quantum Key Distribution (QKD) solves the key distribution problem by allowing the exchange of a cryptographic key between two remote parties with absolute security, guaranteed by the laws of quantum physics. Extensive studies have been undertaken on QKD since it was noted that quantum computers could break public key cryptosystems based on number theory. Actually, the p...
متن کاملAchieving Unconditional Security by Quantum Cryptography
Classical cryptography algorithms are based on mathematical functions. The robustness of a given cryptosystem is based essentially on the secrecy of its (private) key and the difficulty with which the inverse of its one-way function(s) can be calculated. Unfortunately, there is no mathematical proof that will establish whether it is not possible to find the inverse of a given one-way function. ...
متن کاملImproving Application Security through TLS-Library Redesign
Research has revealed a number of pitfalls inherent in contemporary TLS libraries. Common mistakes when programming using their APIs include insufficient certificate verification and the use of weak cipher suites. These programmer errors leave applications susceptible to man-in-the-middle attacks. Furthermore, current TLS libraries encourage system designs which leave the confidentiality of sec...
متن کاملEntropy Security in Quantum Cryptography
Quantum mechanics is the basic principle which is applied in the cryptographic scenario of quantum cryptography. Present paper provides a conceptual framework on the high level security protocol in Quantum cryptography. This is used as a base for data security through quantum computing in modern cryptosystem. In this paper first of all a detailed description of BB84 protocol with noise and with...
متن کاملEntropic security in quantum cryptography
We present two new definitions of security for quantum ciphers which are inspired by the definition of entropic security and entropic indistinguishability defined by Dodis and Smith. We prove the equivalence of these two new definitions. We also propose a generalization of a cipher described by Dodis and Smith and show that it can actually encrypt n qubits using less than n bits of key under re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Network Security & Its Applications
سال: 2010
ISSN: 0975-2307
DOI: 10.5121/ijnsa.2010.2306