Literatura académica sobre el tema "Protocoles de cryptographie quantique"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "Protocoles de cryptographie quantique".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Artículos de revistas sobre el tema "Protocoles de cryptographie quantique"
Sangouard, Nicolas. "Cryptographie quantique : le protocole qui échappe aux espions". Pour la Science N° 555 – janvier, n.º 1 (22 de diciembre de 2023): 28–37. http://dx.doi.org/10.3917/pls.555.0028.
Texto completoBencheikh, K., A. Jankovic, T. Symul y J. A. Levenson. "Cryptographie quantique à variables continues". Journal de Physique IV (Proceedings) 12, n.º 5 (junio de 2002): 167–69. http://dx.doi.org/10.1051/jp4:20020120.
Texto completoDiamanti, Eleni. "Progrés et défis pour la cryptographie quantique". Photoniques, n.º 91 (mayo de 2018): 33–37. http://dx.doi.org/10.1051/photon/20189133.
Texto completoGrosshans, Frédéric y Philippe Grangier. "La cryptographie quantique : l’incertitude quantique au service de la confidentialité". Photoniques, n.º 71 (mayo de 2014): 34–39. http://dx.doi.org/10.1051/photon/20147134.
Texto completoLodewyck, J., R. Tualle-Brouri, T. Debuisschert y P. Grangier. "Cryptographie quantique avec des états cohérents à longueur d'onde télécom". Journal de Physique IV (Proceedings) 135, n.º 1 (octubre de 2006): 227–28. http://dx.doi.org/10.1051/jp4:2006135066.
Texto completoAlibart, Olivier, Virginia D’Auria, Grégory Sauder, Laurent Labonte y Sébastien Tanzilli. "Comprendre. Le comptage de photons corrélés en temps". Photoniques, n.º 91 (mayo de 2018): 38–42. http://dx.doi.org/10.1051/photon/20189138.
Texto completoBEVERATOS, Alexios. "Cryptographie quantique en sécurisation des réseaux. Situation et perspectives". Optique Photonique, abril de 2008. http://dx.doi.org/10.51257/a-v1-nm2400.
Texto completoTesis sobre el tema "Protocoles de cryptographie quantique"
Javelle, Jérôme. "Cryptographie Quantique : Protocoles et Graphes". Thesis, Grenoble, 2014. http://www.theses.fr/2014GRENM093/document.
Texto completoI want to realize an optimal theoretical model for quantum secret sharing protocols based on graph states. The main parameter of a threshold quantum secret sharing scheme is the size of the largest set of players that can not access the secret. Thus, my goal is to find a collection of protocols for which the value of this parameter is the smallest possible. I also study the links between quantum secret sharing protocols and families of curves in algebraic geometry
Mayers, Dominic. "La sécurité des protocoles de la cryptographie quantique". Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1996. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/nq21490.pdf.
Texto completoHauteville, Adrien. "Nouveaux protocoles et nouvelles attaques pour la cryptologie basée sur les codes en métrique rang". Thesis, Limoges, 2017. http://www.theses.fr/2017LIMO0088/document.
Texto completoSecurity of public keys cryptography is based on difficult mathematic problems, especially in number field theory, such as the factorization for RSA or the discrete logarithm for ElGamal. However, algorithms are more and more efficient to solve these problems. Furthermore, quantum computers would be able to easily break these cryptosystems. Code-based cryptography in rank metric is a solid candidate to design new postquatum cryptosystems since it is fast and has low weight keysize. The goals of this thesis are to study hard problems in rank metric and algorithms which solve them, also to search for new attacks and new primitives based on these problems
Tale, kalachi Herve. "Sécurité des protocoles cryptographiques fondés sur la théorie des codes correcteurs d'erreurs". Thesis, Normandie, 2017. http://www.theses.fr/2017NORMR045/document.
Texto completoContrary to the cryptosystems based on number theory, the security of cryptosystems based on error correcting codes appears to be resistant to the emergence of quantum computers. Another advantage of these systems is that the encryption and decryption are very fast, about five times faster for encryption, and 10 to 100 times faster for decryption compared to RSA cryptosystem. Nowadays, the interest of scientific community in code-based cryptography is highly motivated by the latest announcement of the National Institute of Standards and Technology (NIST). They initiated the Post-Quantum cryptography Project which aims to define new standards for quantum resistant cryptography and fixed the deadline for public key cryptographic algorithm submissions for November 2017. This announcement motivates to study the security of existing schemes in order to find out whether they are secure. This thesis thus presents several attacks which dismantle several code-based encryption schemes. We started by a cryptanalysis of a modified version of the Sidelnikov cryptosystem proposed by Gueye and Mboup [GM13] which is based on Reed-Muller codes. This modified scheme consists in inserting random columns in the secret generating matrix or parity check matrix. The cryptanalysis relies on the computation of the square of the public code. The particular nature of Reed-Muller which are defined by means of multivariate binary polynomials, permits to predict the values of the dimensions of the square codes and then to fully recover in polynomial time the secret positions of the random columns. Our work shows that the insertion of random columns in the Sidelnikov scheme does not bring any security improvement. The second result is an improved cryptanalysis of several variants of the GPT cryptosystem which is a rank-metric scheme based on Gabidulin codes. We prove that any variant of the GPT cryptosystem which uses a right column scrambler over the extension field as advocated by the works of Gabidulin et al. [Gab08, GRH09, RGH11] with the goal to resist Overbeck’s structural attack [Ove08], are actually still vulnerable to that attack. We show that by applying the Frobeniusoperator appropriately on the public key, it is possible to build a Gabidulin code having the same dimension as the original secret Gabidulin code, but with a lower length. In particular, the code obtained by this way corrects less errors than thesecret one but its error correction capabilities are beyond the number of errors added by a sender, and consequently an attacker is able to decrypt any ciphertext with this degraded Gabidulin code. We also considered the case where an isometrictransformation is applied in conjunction with a right column scrambler which has its entries in the extension field. We proved that this protection is useless both in terms of performance and security. Consequently, our results show that all the existingtechniques aiming to hide the inherent algebraic structure of Gabidulin codes have failed. To finish, we studied the security of the Faure-Loidreau encryption scheme [FL05] which is also a rank-metric scheme based on Gabidulin codes. Inspired by our precedent work and, although the structure of the scheme differs considerably from the classical setting of the GPT cryptosystem, we show that for a range of parameters, this scheme is also vulnerable to a polynomial-time attack that recovers the private key by applying Overbeck’s attack on an appropriate public code. As an example we break in a few seconds parameters with 80-bit security claim
Pappa, Anna. "Protocoles de chiffrement quantiques de plusieurs parties en environnements réalistes". Electronic Thesis or Diss., Paris, ENST, 2014. http://www.theses.fr/2014ENST0045.
Texto completoThis thesis stands at the interface between quantum theory and experiments, focusing on practical protocols that can be implemented using present-day technology. Our goal is to build a general framework for the design and implementation of quantum cryptographic schemes that will improve the safety of future telecommunication networks. In addition, this thesis aims to advance research on quantum physics and computer science, by improving our understanding of entanglement. The correlations of entangled states can not be reproduced by conventional means, allowing to perform tasks (eg teleportation and superdense coding) that are otherwise impossible. It is therefore of major importance to be able to check whether a quantum state is entangled. In this thesis, we show how to efficiently check whether a physical source can create multi-party entangled states and share them with many parties, some of which are dishonest and work with the source. This protocol could prove essential for quantum computation between suspicious parties and could also facilitate the secure delegation of tasks to powerful untrusted quantum servers. Finally, we study the link between game theory and quantum non-locality, in the context of Bayesian games. We examine how the shared entanglement helps players win a game with a higher probability than the conventional resources could achieve
Music, Luka. "Multi-Party Quantum Cryptography : from Folklore to Real-World". Electronic Thesis or Diss., Sorbonne université, 2021. http://www.theses.fr/2021SORUS412.
Texto completoQuantum cryptography builds upon decades of advances both in classical cryptography and networks. However, contrary to its classical counterparts, it is still in its infancy applicability-wise, even in the scenario where powerful quantum computers are readily available, and more theoretical work is required before it can provide concrete benefits. The first goal is to formalise in rigorous quantum security frameworks the properties of various techniques that have been transposed, often without proper justification, from the classical world.Then, the recent developments in quantum technologies suggest a mostly cloud-based future availability of quantum devices. Therefore, quantum computation and communication cost of protocol participants must be lowered before being useful.Finally, in most situations, additional steps need to be taken to tailor protocols to the specifications of devices. This allows for optimisations both in terms of quantum memory and operation requirements.This thesis contributes to these three aspects by: (i) giving the first general security definition of the Quantum Cut-and-Choose, a technique for proving the correctness of a quantum message; (ii) presenting a more realistic framework of security against superposition attacks, where classical protocols run on inherently quantum devices; (iii) constructing an efficient delegated multi-party quantum computation protocol, allowing clients to delegate securely to a quantum server a private computation; (iv) building a method for verifying the honesty of a quantum server performing computations on behalf of a client with no operation or memory overhead compared to the unprotected computation
Colisson, Léo. "Study of Protocols Between Classical Clients and a Quantum Server". Electronic Thesis or Diss., Sorbonne université, 2022. http://www.theses.fr/2022SORUS105.
Texto completoQuantum computers promise surprising powers of computation by exploiting the stunning physical properties of infinitesimally small particles. I focused on designing and proving the security of protocols that allow a purely classical client to use the computational resources of a quantum server, so that the performed computation is never revealed to the server. To this end, I develop a modular tool to generate on a remote server a quantum state that only the client is able to describe, and I show how multi-qubits quantum states can be generated more efficiently. I also prove that there is no such protocol that is secure in a generally composable model of security, including when our module is used in the UBQC protocol. In addition to delegated computation, this tool also proves to be useful for performing a task that might seem impossible to achieve at first sight: proving advanced properties on a quantum state in a non-interactive and non-destructive way, including when this state is generated collaboratively by several participants. This can be seen as a quantum analogue of the classical Non-Interactive Zero-Knowledge proofs. This property is particularly useful to filter the participants of a protocol without revealing their identity, and may have applications in other domains, for example to transmit a quantum state over a network while hiding the source and destination of the message. Finally, I discuss my ongoing independent work on One-Time Programs, mixing quantum cryptography, error correcting codes and information theory
Mamann, Hadriel. "Cold-atomic ensemble implemented as an efficient optical quantum memory layer in a cryptographic protocol". Electronic Thesis or Diss., Sorbonne université, 2024. https://accesdistant.sorbonne-universite.fr/login?url=https://theses-intra.sorbonne-universite.fr/2024SORUS120.pdf.
Texto completoCombining cryptographic protocols with quantum memories is an important step for quantum network development in order to establish secure communications where information can be stored and retrieved on demand. One possible use case of these networks is to perform authenticated transactions synchronized by the use of memories. However, the losses and noise added by storage devices can be exploited by dishonest agents to hide their cheating attempts. The constraints to operate in a secure regime are thus very demanding in terms of memory efficiency and fidelity. This thesis focuses on the implementation of a cold-atomic ensemble used as an EIT-based quantum memory in a cryptographic protocol. The key ingredients to optimize the storage-and-retrieval efficiency and the method employed to mitigate the decoherence sources are detailed. This work reports the first demonstration of the unforgeable quantum money including an intermediate quantum memory layer, taking advantage of our highly-efficient and low-noise storage platform. The next step would be to spatially multiplex the atomic cloud in order to store the whole sequence of random qubits at once. In this scenario, the multimode capacity of our memory has been numerically simulated using two different spatial multiplexing techniques
Pappa, Anna. "Protocoles de chiffrement quantiques de plusieurs parties en environnements réalistes". Thesis, Paris, ENST, 2014. http://www.theses.fr/2014ENST0045/document.
Texto completoThis thesis stands at the interface between quantum theory and experiments, focusing on practical protocols that can be implemented using present-day technology. Our goal is to build a general framework for the design and implementation of quantum cryptographic schemes that will improve the safety of future telecommunication networks. In addition, this thesis aims to advance research on quantum physics and computer science, by improving our understanding of entanglement. The correlations of entangled states can not be reproduced by conventional means, allowing to perform tasks (eg teleportation and superdense coding) that are otherwise impossible. It is therefore of major importance to be able to check whether a quantum state is entangled. In this thesis, we show how to efficiently check whether a physical source can create multi-party entangled states and share them with many parties, some of which are dishonest and work with the source. This protocol could prove essential for quantum computation between suspicious parties and could also facilitate the secure delegation of tasks to powerful untrusted quantum servers. Finally, we study the link between game theory and quantum non-locality, in the context of Bayesian games. We examine how the shared entanglement helps players win a game with a higher probability than the conventional resources could achieve
Richmond, Tania. "Implantation sécurisée de protocoles cryptographiques basés sur les codes correcteurs d'erreurs". Thesis, Lyon, 2016. http://www.theses.fr/2016LYSES048/document.
Texto completoThe first cryptographic protocol based on error-correcting codes was proposed in 1978 by Robert McEliece. Cryptography based on codes is called post-quantum because until now, no algorithm able to attack this kind of protocols in polynomial time, even using a quantum computer, has been proposed. This is in contrast with protocols based on number theory problems like factorization of large numbers, for which efficient Shor's algorithm can be used on quantum computers. Nevertheless, the McEliece cryptosystem security is based not only on mathematical problems. Implementation (in software or hardware) is also very important for its security. Study of side-channel attacks against the McEliece cryptosystem have begun in 2008. Improvements can still be done. In this thesis, we propose new attacks against decryption in the McEliece cryptosystem, used with classical Goppa codes, including corresponding countermeasures. Proposed attacks are based on evaluation of execution time of the algorithm or its power consumption analysis. Associate countermeasures are based on mathematical and algorithmic properties of the underlying algorithm. We show that it is necessary to secure the decryption algorithm by considering it as a whole and not only step by step
Libros sobre el tema "Protocoles de cryptographie quantique"
Schneier, Bruce. Cryptographie appliquée: Protocoles, algorithmes et codes sources en C. 2a ed. Paris: Vuibert, 2001.
Buscar texto completoSingh, Simon. Histoire des codes secrets: De l'Égypte des Pharaons à l'ordinateur quantique. Paris, France: J.-C. Lattès, 1999.
Buscar texto completoStamp, Mark. Information Security. New York: John Wiley & Sons, Ltd., 2005.
Buscar texto completoSingh, Simon. Los Códigos Secretos. Barcelona, Spain: Debate, 2000.
Buscar texto completoSingh, Simon. The code book: The secret history of codes and codebreaking. London: Ted Smart, 2000.
Buscar texto completoSingh, Simon. The code book: The evolution of secrecy from Mary, Queen of Scots, to quantum cryptography. New York: Doubleday, 1999.
Buscar texto completoSingh, Simon. The code book: The science of secrecy from ancient Egypt to quantum cryptography. London: Fourth Estate, 1999.
Buscar texto completoERIC, A. B. Sécurisation de l'accès Logique Aux Ressources Réseaux IT: Fondamentaux de la Sécurité Informatique, Attaques Réseaux, Cryptographie, Authentification,Protocoles de Sécurité, Pare-Feu, Technologie VPN. Independently Published, 2020.
Buscar texto completoStamp, Mark. Information Security: Principles and Practice. Wiley & Sons, Incorporated, John, 2021.
Buscar texto completoStamp, Mark. Information Security: Principles and Practice. Wiley & Sons, Incorporated, John, 2007.
Buscar texto completoCapítulos de libros sobre el tema "Protocoles de cryptographie quantique"
VISCONTI, Ivan. "Preuves à divulgation nulle de connaissance". En Cryptographie asymétrique, 73–97. ISTE Group, 2024. http://dx.doi.org/10.51926/iste.9096.ch3.
Texto completoJARECKI, Stanislaw. "Échange de clé authentifié par mot de passe : protocoles et modèles de sécurité". En Cryptographie asymétrique, 241–89. ISTE Group, 2024. http://dx.doi.org/10.51926/iste.9096.ch10.
Texto completo"Chapitre 3 Physique quantique". En Énergie, entropie, information, cryptographie et cybersécurité, 45–56. EDP Sciences, 2020. http://dx.doi.org/10.1051/978-2-7598-2349-9-004.
Texto completo"Chapitre 3 Physique quantique". En Énergie, entropie, information, cryptographie et cybersécurité, 45–56. EDP Sciences, 2020. http://dx.doi.org/10.1051/978-2-7598-2349-9.c004.
Texto completo