Auswahl der wissenschaftlichen Literatur zum Thema „Cryptage à clé publique“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Inhaltsverzeichnis
Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Cryptage à clé publique" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Zeitschriftenartikel zum Thema "Cryptage à clé publique"
Mbuyamba, Elisée Ilunga, und Simon Tshibengabu Kalonji. „Chiffrement et déchiffrement d’images à l’aide de l’algorithme AES“. European Journal of Computer Science and Information Technology 11, Nr. 1 (15.01.2023): 1–8. http://dx.doi.org/10.37745/ejcsit.2013/vol11n118.
Der volle Inhalt der QuelleGabrielle De Micheli. „Exponentiation modulaire pour la cryptographie à clé publique“. Bulletin 1024, Nr. 19 (April 2022): 75–80. http://dx.doi.org/10.48556/sif.1024.19.75.
Der volle Inhalt der QuelleGuillou, Louis C., Marc Davio und Jean-Jacques Quisquater. „L’état de l’art en matière de techniques à clé publique“. Annales Des Télécommunications 43, Nr. 9-10 (September 1988): 489–505. http://dx.doi.org/10.1007/bf03011105.
Der volle Inhalt der QuelleAmstutz, Delphine. „« Sanglante raillerie ». Des mauvais usages de la raillerie dans l’écriture polémique du premier xvii e siècle“. Littératures classiques N° 110, Nr. 1 (20.09.2023): 133–43. http://dx.doi.org/10.3917/licla1.110.0133.
Der volle Inhalt der QuelleFrucquet, Pascal, David Carassus, Didier Chabaud und Pierre Marin. „Politiques publiques de Villes et de Territoires Intelligents : le rôle clé de la gouvernance dans le processus de création de valeur publique“. Gestion et management public Pub. anticipées, Nr. 3 (21.04.2050): 22–47. http://dx.doi.org/10.3917/gmp.pr1.0004.
Der volle Inhalt der QuelleFrucquet, Pascal, David Carassus, Didier Chabaud und Pierre Marin. „Politiques publiques de Villes et de Territoires Intelligents : le rôle clé de la gouvernance dans le processus de création de valeur publique“. Gestion et management public Volume 11 / N° 4, Nr. 4 (19.12.2023): 9–33. http://dx.doi.org/10.3917/gmp.114.0009.
Der volle Inhalt der QuelleBadra, Lamia. „Le bibliothécaire de lecture publique, un acteur clé du développement socioculturel d’un territoire ?“ Documentation et bibliothèques 70, Nr. 1 (2024): 45. http://dx.doi.org/10.7202/1110569ar.
Der volle Inhalt der QuelleSéne, Mame Fatou. „Enseigner et prêcher au Sénégal : l’appropriation du savoir religieux par les femmes“. Protocole de solidarité - Articles hors thème 30, Nr. 1 (29.08.2017): 220–38. http://dx.doi.org/10.7202/1040983ar.
Der volle Inhalt der QuelleAugé, Pascale. „L’innovation et le transfert de technologie issus de la recherche publique : Inserm Transfert, une stratégie axée sur la compétitivité internationale et la vision à long terme“. Annales des Mines - Réalités industrielles Novembre 2023, Nr. 4 (09.11.2023): 60–63. http://dx.doi.org/10.3917/rindu1.234.0060.
Der volle Inhalt der QuelleLevan, Véronique. „Résilience et formes de régulation sociale informelle dans un quartier de Brooklyn“. Lien social et Politiques, Nr. 57 (20.09.2007): 77–90. http://dx.doi.org/10.7202/016389ar.
Der volle Inhalt der QuelleDissertationen zum Thema "Cryptage à clé publique"
Chakraborty, Olive. „Design and Cryptanalysis of Post-Quantum Cryptosystems“. Electronic Thesis or Diss., Sorbonne université, 2020. http://www.theses.fr/2020SORUS283.
Der volle Inhalt der QuellePolynomial system solving is one of the oldest and most important problems incomputational mathematics and has many applications in computer science. Itis intrinsically a hard problem with complexity at least single exponential in the number of variables. In this thesis, we focus on cryptographic schemes based on the hardness of this problem. In particular, we give the first known cryptanalysis of the Extension Field Cancellation cryptosystem. We work on the scheme from two aspects, first we show that the challenge parameters don’t satisfy the 80 bits of security claimed by using Gröbner basis techniques to solve the underlying algebraic system. Secondly, using the structure of the public keys, we develop a new technique to show that even altering the parameters of the scheme still keeps the scheme vulnerable to attacks for recovering the hidden secret. We show that noisy variant of the problem of solving a system of equations is still hard to solve. Finally, using this new problem to design a new multivariate key-exchange scheme as a candidate for NIST Post Quantum Cryptographic Standards
Chevallier-Mames, Benoit. „Cryptographie à clé publique : constructions et preuves de sécurité“. Paris 7, 2006. http://www.theses.fr/2006PA077008.
Der volle Inhalt der QuelleThe public key cryptography concept, proposed by Whitfield Diffie et Martin Hellman, changed the cryptology world. After the description of first heuristically secure schemes, thé formalization of models and security notions has allowed the emergency of provable security. After some reminds about cryptography and security reduction, we propose new signature and encryption schemes, with some advantages over the existing Systems. Indeed, we propose two new signature schemes with a security proof in the random oracle model, and expose a new signature scheme which features a provable security in the standard model. All of these schemes feature both tight security and the possible use of coupons. Next, we describe a new encryption scheme, based on a new cryptographical problem. We also give another look to the universel paddings, and show how to obtain tight security for identity-based encryption schemes. In the last part of this thesis, we deal with the physical security of cryptographical software. We propose notably new efficient countermeasures against simple side-channel attacks (SPA) and differentiel side-channel attacks (DPA)
Coron, Jean-Sébastien. „Cryptanalyses et preuves de sécurité de schémas à clé publique“. Palaiseau, Ecole polytechnique, 2001. http://www.theses.fr/2001EPXX0008.
Der volle Inhalt der QuelleBultel, Xavier. „Mécanismes de délégation pour les primitives de cryptographie à clé publique“. Thesis, Université Clermont Auvergne (2017-2020), 2018. http://www.theses.fr/2018CLFAC100.
Der volle Inhalt der QuelleJaulmes, Eliane. „Analyse de sécurité des schémas cryptographiques“. Palaiseau, Ecole polytechnique, 2003. http://www.theses.fr/2003EPXX0016.
Der volle Inhalt der QuelleLefranc, David. „Authentification asymétrique à bas coût et vérification assistée par ordinateur“. Caen, 2005. http://www.theses.fr/2005CAEN2024.
Der volle Inhalt der QuelleChaulet, Julia. „Etude de cryptosystèmes à clé publique basés sur les codes MDPC quasi-cycliques“. Thesis, Paris 6, 2017. http://www.theses.fr/2017PA066064/document.
Der volle Inhalt der QuelleConsidering the McEliece cryptosystem using quasi-cylcic MDPC (Moderate Density Parity Check matrix) codes allows us to build a post-quantum encryption scheme with nice features. Namely, it has reasonable key sizes and both encryption and decryption are performed using binary operations. Thus, this scheme seems to be a good candidate for embedded and lightweight implementations. In this case, any information obtained through side channels can lead to an attack. In the McEliece cryptosystem, the decryption process essentially consists in decoding. As we consider the use of an iterative and probabilistic algorithm, the number of iterations needed to decode depends on the instance considered and some of it may fail to be decoded. These behaviors are not suitable because they may be used to extract information about the secrets. One countermeasure could be to bound the number of encryptions using the same key. Another solution could be to employ a constant time decoder with a negligible decoding failure probability, that is to say which is about the expected security level of the cryptosystem. The main goal of this thesis is to present new methods to analyse decoder behavior in a cryptographic context.Second, we explain why a McEliece encryption scheme based on polar code does not ensure the expected level of security. To do so, we apply new techniques to resolve the code equivalence problem. This allows us to highlight several common properties shared by Reed-Muller codes and polar codes. We introduce a new family of codes, named decreasing monomial codes, containing both Reed-Muller and polar codes. These results are also of independent interest for coding theory
Chaulet, Julia. „Etude de cryptosystèmes à clé publique basés sur les codes MDPC quasi-cycliques“. Electronic Thesis or Diss., Paris 6, 2017. https://accesdistant.sorbonne-universite.fr/login?url=https://theses-intra.sorbonne-universite.fr/2017PA066064.pdf.
Der volle Inhalt der QuelleConsidering the McEliece cryptosystem using quasi-cylcic MDPC (Moderate Density Parity Check matrix) codes allows us to build a post-quantum encryption scheme with nice features. Namely, it has reasonable key sizes and both encryption and decryption are performed using binary operations. Thus, this scheme seems to be a good candidate for embedded and lightweight implementations. In this case, any information obtained through side channels can lead to an attack. In the McEliece cryptosystem, the decryption process essentially consists in decoding. As we consider the use of an iterative and probabilistic algorithm, the number of iterations needed to decode depends on the instance considered and some of it may fail to be decoded. These behaviors are not suitable because they may be used to extract information about the secrets. One countermeasure could be to bound the number of encryptions using the same key. Another solution could be to employ a constant time decoder with a negligible decoding failure probability, that is to say which is about the expected security level of the cryptosystem. The main goal of this thesis is to present new methods to analyse decoder behavior in a cryptographic context.Second, we explain why a McEliece encryption scheme based on polar code does not ensure the expected level of security. To do so, we apply new techniques to resolve the code equivalence problem. This allows us to highlight several common properties shared by Reed-Muller codes and polar codes. We introduce a new family of codes, named decreasing monomial codes, containing both Reed-Muller and polar codes. These results are also of independent interest for coding theory
Perret, Ludovic. „Étude d'outils algébriques et combinatoires pour la cryptographie à clef publique“. Université de Marne-la-Vallée, 2005. http://www.theses.fr/2005MARN0250.
Der volle Inhalt der QuelleBiswas, Bhaskar. „Implementational aspects of code-based cryptography“. Palaiseau, Ecole polytechnique, 2010. http://pastel.archives-ouvertes.fr/docs/00/52/30/07/PDF/thesis.pdf.
Der volle Inhalt der QuelleSur la plateforme de thèses en ligne Tel on trouve le résumé suivant : We present the implementation details of Hybrid McEliece Encryption Scheme (HyMES), a improved version of the original McEliece scheme developed with Nicolas Sendrier. We present a modified version of the original scheme (which we call hybrid). It has two modifications, the first increases the information rate by putting some data in the error pattern. The second reduces the public key size by making use of a generator matrix in systematic form. We will show that the same security reduction as for the original system holds. We then describe the key generation, the encryption and the decryption algorithms and their implementation. Finally we will give some computation time for various parameters, compare them with the best known attacks, and discuss the best trade-offs. The idea of McEliece scheme is to hide the structure of the code by means of a transformation of the generator matrix. The transformed generator matrix becomes the public key and the secret key is the structure of the Goppa code together with the transformation parameters. The security relies on the fact that the decoding problem for general linear code is NP-complete. While the RSA public-key cryptosystem has become most widely used, McEliece cryptosystem has not been quite as successful. Partly because of the large public key, which impose less problem with the advance in hardware today. Our aim has been to implement a fairly fast and concise software implementation that may be used as a reference benchmark. We present the algorithmic details of our implementation as well. That is to specify the algorithms we use and the way we use them. The whole project is freely available at http://www-roc. Inria. Fr/secret/CBCrypto/index. Php?pg=hymes
Bücher zum Thema "Cryptage à clé publique"
Ateba-Eyene, Charles. Marketing et communication politiques: Clé du succès pour les élections, la vie publique et la promotion de la démocratie. [Yaoundé]: Éditions Saint-Paul, 2007.
Den vollen Inhalt der Quelle findenLambert, Alain. La mise en oeuvre de la loi organique relative aux lois de finances: Réussir la LOLF, clé d'une gestion publique, responsable et efficace : rapport au gouvernement. Paris: Documentation française, 2005.
Den vollen Inhalt der Quelle findenPKI Security Solutions for the Enterprise: Solving HIPAA, E-Paper Act, and Other Compliance Issues. Hoboken, NJ: John Wiley & Sons, 2003.
Den vollen Inhalt der Quelle findenStallings, William. Cryptography and network security: Principles and practice. 4. Aufl. Upper Saddle River, N.J: Pearson/Prentice Hall, 2006.
Den vollen Inhalt der Quelle findenLucas, Michael. PGP & GPG: Assurer la confidentialite de son courrier e lectronique. Paris: E ditions Eyrolles, 2006.
Den vollen Inhalt der Quelle findenLucas, Michael. PGP & GPG: Email for the practical paranoid. San Francisco, CA: No Starch Press, 2006.
Den vollen Inhalt der Quelle findenLucas, Michael. PGP & GPG: Assurer la confidentialité de son courrier électronique. Paris: Eyrolles, 2006.
Den vollen Inhalt der Quelle findenWelschenbach, Michael. Cryptography in C and C++. 2. Aufl. Berkeley, CA: Apress, 2001.
Den vollen Inhalt der Quelle findenCryptography in C and C++. 2. Aufl. New York: Springer-Verlag, 2005.
Den vollen Inhalt der Quelle findenQin, Zhen, Athanasios V. Vasilakos und Hu Xiong. Introduction to Certificateless Cryptography. Taylor & Francis Group, 2016.
Den vollen Inhalt der Quelle findenBuchteile zum Thema "Cryptage à clé publique"
„3 La cryptographie à clé publique“. In La cryptologie, 45–80. EDP Sciences, 2020. http://dx.doi.org/10.1051/978-2-7598-0995-0-005.
Der volle Inhalt der Quelle„3 La cryptographie à clé publique“. In La cryptologie, 45–80. EDP Sciences, 2020. http://dx.doi.org/10.1051/978-2-7598-0995-0.c005.
Der volle Inhalt der QuelleJARECKI, Stanislaw. „Échange de clé authentifié par mot de passe : protocoles et modèles de sécurité“. In Cryptographie asymétrique, 241–89. ISTE Group, 2024. http://dx.doi.org/10.51926/iste.9096.ch10.
Der volle Inhalt der QuelleATTRAPADUNG, Nuttapong, und Takahiro MATSUDA. „Chiffrement à clé publique et notions de sécurité“. In Cryptographie asymétrique, 5–53. ISTE Group, 2024. http://dx.doi.org/10.51926/iste.9096.ch1.
Der volle Inhalt der QuelleHIEU PHAN, Duong. „Diffusion chiffrée et traçage de traîtres“. In Cryptographie asymétrique, 139–71. ISTE Group, 2024. http://dx.doi.org/10.51926/iste.9096.ch6.
Der volle Inhalt der QuelleDelahaie, Noélie, Anne Fretel und Héloïse Petit. „Que sait‐on du travail ?“ In Que sait‐on du travail ?, 290–305. Presses de Sciences Po, 2023. http://dx.doi.org/10.3917/scpo.colle.2023.01.0290.
Der volle Inhalt der QuelleRollet †, Catherine. „Le sevrage, un moment clé pour les mères, les médecins, les industriels et la puissance publique“. In Premiers cris, premières nourritures, 77–111. Presses universitaires de Provence, 2019. http://dx.doi.org/10.4000/books.pup.34343.
Der volle Inhalt der QuelleBerichte der Organisationen zum Thema "Cryptage à clé publique"
Ripoll, Santiago, Tabitha Hrynick, Ashley Ouvrier, Megan Schmidt-Sane, Federico Marco Federici und Elizabeth Storer. 10 façons dont les gouvernements locaux en milieu urbain multiculturel peuvent appuyer l’égalité vaccinale en cas de pandémie. SSHAP, Januar 2023. http://dx.doi.org/10.19088/sshap.2023.001.
Der volle Inhalt der Quelle