Security of Quantum Key Recycling

Download

METU_Thesis.pdf

Date

2022-9-1

Author

Akyuz, Kaan

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

260
views

85
downloads

In cryptography, unconditional security is achieved by hiding the message under a sufficiently long one-time pad, a key that is completely unknown from outside. The one-time pad is single-use-only, because the presence of an eavesdropper is undetectable in a classical channel. In contrast, an adversary is highly detectable in a quantum channel. Quantum key recycling’s objective is to detect the adversary and re-use the one-time pad. The analysis of quantum key recycling is mainly concerned with the rate and the security of the transmission. By using a method called “smoothing”, tight bounds on these quantities can be established. Smoothing was used in a noise tolerant quantum key recycling scheme; however, only for the asymptotic case. This thesis’ primary focus is to establish more favorable bounds on the rate and security for the non-asymptotic case by using the smoothing method.

Subject Keywords

information theory, quantum cryptography, quantum key recycling

URI

https://hdl.handle.net/11511/99769

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

Quantum Key Distribution and Recent Advancements Demir, Nazlı Ceren; Yayla, Oğuz; Department of Cryptography (2021-2-10) Güvenli anahtar değişiminin sağlanması simetrik anahtar ile şifrelemede önemli bir konudur. Kuantum bilgisayarların geliştirilmesiyle günümüzde kullanımda olan sistemlerin güvenlik ihtiyacını karşılamayacağı değerlendirilmektedir. Bu doğrultuda öne çıkan önemli bir araştırma konusu kuantum anahtar değişimidir. Bu bitirme projesi, ilk kuantum anahtar değişimi protokolü olan BB84 Protokolünü ve kuantum anahtar paylaşımında son dönemde meydana gelen gelişmeleri ele almaktadır.
A Survey on the provable security using indistinguishability notion on cryptographic encryption schemes Ayar, Emre; Doğanaksoy, Ali; Koçak, Onur; Department of Cryptography (2018) For an encryption scheme, instead of Shannon's perfect security definition, Goldwasser and Micali defined a realistic provable security called semantic security. Using indistinguishability notion, one can define security levels according to the polynomial time adversaries' capabilities such as chosen plaintext attacks (CPA) and chosen ciphertext attacks (CCA) for both symmetric and asymmetric encryption schemes in addition to the hard mathematical problems the algorithms based on. Precautions to prevent the...
Design and analysis of hash functions Koçak, Onur; Doğanaksoy, Ali; Department of Cryptography (2009) Hash functions are cryptographic tools that are used in various applications like digital signature, message integrity checking, password storage and random number generation. These cryptographic primitives were, first, constructed using modular arithmetical operations which were popular at that time because of public key cryptography. Later, in 1989, Merkle and Damgard independently proposed an iterative construction method. This method was easy to implement and had a security proof. MD-4 was the first has...
NEW TMVP-BASED MULTIPLICATION ALGORITHMS FOR POLYNOMIAL QUOTIENT RINGS AND APPLICATION TO POST-QUANTUM CRYPTOGRAPHY Keskinkurt Paksoy, İrem; Cenk, Murat; Department of Cryptography (2022-7-28) One of the quantum-safe cryptography research areas is lattice-based cryptography. Most lattice-based schemes need efficient algorithms for multiplication in polynomial quotient rings. The fastest algorithm known for multiplication is the Number Theoretic Transform (NTT), which requires certain restrictions on the parameters of the ring, such as prime modulus. Direct NTT application is not an option for some schemes that do not comply with these restrictions, e.g., the two finalists of the PQC standardizati...
Combined attacks on block ciphers Öztop, Neşe; Doğanaksoy, Ali; Department of Cryptography (2009) Cryptanalytic methods are very important tools in terms of evaluating the security of block ciphers in a more accurate and reliable way. Differential and linear attacks have been the most effective cryptanalysis methods since the early 1990s. However, as the technology developed and more secure ciphers are designed, these fundamental methods started to be not so efficient. In order to analyze the ciphers, new methods should be introduced. One approach is inventing new techniques that are different from the ...

Citation Formats

K. Akyuz, “Security of Quantum Key Recycling,” M.S. - Master of Science, Middle East Technical University, 2022.