1,352 research outputs found
Strong connections between quantum encodings, non-locality and quantum cryptography
Encoding information in quantum systems can offer surprising advantages but
at the same time there are limitations that arise from the fact that measuring
an observable may disturb the state of the quantum system. In our work, we
provide an in-depth analysis of a simple question: What happens when we perform
two measurements sequentially on the same quantum system? This question touches
upon some fundamental properties of quantum mechanics, namely the uncertainty
principle and the complementarity of quantum measurements. Our results have
interesting consequences, for example they can provide a simple proof of the
optimal quantum strategy in the famous Clauser-Horne-Shimony-Holt game.
Moreover, we show that the way information is encoded in quantum systems can
provide a different perspective in understanding other fundamental aspects of
quantum information, like non-locality and quantum cryptography. We prove some
strong equivalences between these notions and provide a number of applications
in all areas.Comment: Version 3. Previous title: "Oblivious transfer, the CHSH game, and
quantum encodings
Decoding LDPC Codes with Probabilistic Local Maximum Likelihood Bit Flipping
Communication channels are inherently noisy making error correction coding a major topic of research for modern communication systems. Error correction coding is the addition of redundancy to information transmitted over communication channels to enable detection and recovery of erroneous information. Low-density parity-check (LDPC) codes are a class of error correcting codes that have been effective in maintaining reliability of information transmitted over communication channels. Multiple algorithms have been developed to benefit from the LDPC coding scheme to improve recovery of erroneous information. This work develops a matrix construction that stores the information error probability statistics for a communication channel. This combined with the error correcting capability of LDPC codes enabled the development of the Probabilistic Local Maximum Likelihood Bit Flipping (PLMLBF) algorithm, which is the focus of this research work
Decryption Failure Attacks on Post-Quantum Cryptography
This dissertation discusses mainly new cryptanalytical results related to issues of securely implementing the next generation of asymmetric cryptography, or Public-Key Cryptography (PKC).PKC, as it has been deployed until today, depends heavily on the integer factorization and the discrete logarithm problems.Unfortunately, it has been well-known since the mid-90s, that these mathematical problems can be solved due to Peter Shor's algorithm for quantum computers, which achieves the answers in polynomial time.The recently accelerated pace of R&D towards quantum computers, eventually of sufficient size and power to threaten cryptography, has led the crypto research community towards a major shift of focus.A project towards standardization of Post-quantum Cryptography (PQC) was launched by the US-based standardization organization, NIST. PQC is the name given to algorithms designed for running on classical hardware/software whilst being resistant to attacks from quantum computers.PQC is well suited for replacing the current asymmetric schemes.A primary motivation for the project is to guide publicly available research toward the singular goal of finding weaknesses in the proposed next generation of PKC.For public key encryption (PKE) or digital signature (DS) schemes to be considered secure they must be shown to rely heavily on well-known mathematical problems with theoretical proofs of security under established models, such as indistinguishability under chosen ciphertext attack (IND-CCA).Also, they must withstand serious attack attempts by well-renowned cryptographers both concerning theoretical security and the actual software/hardware instantiations.It is well-known that security models, such as IND-CCA, are not designed to capture the intricacies of inner-state leakages.Such leakages are named side-channels, which is currently a major topic of interest in the NIST PQC project.This dissertation focuses on two things, in general:1) how does the low but non-zero probability of decryption failures affect the cryptanalysis of these new PQC candidates?And 2) how might side-channel vulnerabilities inadvertently be introduced when going from theory to the practice of software/hardware implementations?Of main concern are PQC algorithms based on lattice theory and coding theory.The primary contributions are the discovery of novel decryption failure side-channel attacks, improvements on existing attacks, an alternative implementation to a part of a PQC scheme, and some more theoretical cryptanalytical results
LDPC-coded modulation for transmission over AWGN and flat rayleigh fading channels
La modulation codée est une technique de transmission efficace en largeur de bande qui intègre le codage de canal et la modulation en une seule entité et ce, afin d'améliorer les performances tout en conservant la même efficacité spectrale comparé à la modulation non codée. Les codes de parité à faible densité (low-density parity-check codes, LDPC) sont les codes correcteurs d'erreurs les plus puissants et approchent la limite de Shannon, tout en ayant une complexité de décodage relativement faible. L'idée de combiner les codes LDPC et la modulation efficace en largeur de bande a donc été considérée par de nombreux chercheurs. Dans ce mémoire, nous étudions une méthode de modulation codée à la fois puissante et efficace en largeur de bande, ayant d'excellentes performances de taux d'erreur binaire et une complexité d'implantation faible. Ceci est réalisé en utilisant un encodeur rapide, un décoder de faible complexité et aucun entrelaceur. Les performances du système proposé pour des transmissions sur un canal additif gaussien blanc et un canal à évanouissements plats de Rayleigh sont évaluées au moyen de simulations. Les résultats numériques montrent que la méthode de modulation codée utilisant la modulation d'amplitude en quadrature à M niveaux (M-QAM) peut atteindre d'excellentes performances pour toute une gamme d'efficacité spectrale. Une autre contribution de ce mémoire est une méthode simple pour réaliser une modulation codée adaptative avec les codes LDPC pour la transmission sur des canaux à évanouissements plats et lents de Rayleigh. Dans cette méthode, six combinaisons de paires encodeur modulateur sont employées pour une adaptation trame par trame. L'efficacité spectrale moyenne varie entre 0.5 et 5 bits/s/Hz lors de la transmission. Les résultats de simulation montrent que la modulation codée adaptative avec les codes LDPC offre une meilleure efficacité spectrale tout en maintenant une performance d'erreur acceptable
Experimental Realization of A Two Bit Phase Damping Quantum Code
Using nuclear magnetic resonance techniques, we experimentally investigated
the effects of applying a two bit phase error detection code to preserve
quantum information in nuclear spin systems. Input states were stored with and
without coding, and the resulting output states were compared with the
originals and with each other. The theoretically expected result, net reduction
of distortion and conditional error probabilities to second order, was indeed
observed, despite imperfect coding operations which increased the error
probabilities by approximately 5%. Systematic study of the deviations from the
ideal behavior provided quantitative measures of different sources of error,
and good agreement was found with a numerical model. Theoretical questions in
quantum error correction in bulk nuclear spin systems including fidelity
measures, signal strength and syndrome measurements are discussed.Comment: 21 pages, 17 figures, mypsfig2, revtex. Minor changes made to appear
in PR
- …