Gotowa bibliografia na temat „Cryptographie – Mesures de sûreté – Évaluation”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Spis treści
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Cryptographie – Mesures de sûreté – Évaluation”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Cryptographie – Mesures de sûreté – Évaluation"
Kelly, H. William. "Comparison of Inhaled Corticosteroids". Annals of Pharmacotherapy 32, nr 2 (luty 1998): 220–32. http://dx.doi.org/10.1345/aph.17014.
Pełny tekst źródłaRozprawy doktorskie na temat "Cryptographie – Mesures de sûreté – Évaluation"
Demay, Jonathan-Christofer. "Génération et évaluation de mécanismes de détection des intrusions au niveau applicatif". Phd thesis, Université Rennes 1, 2011. http://tel.archives-ouvertes.fr/tel-00659694.
Pełny tekst źródłaDemay, Jonathan-Christofer. "Génération et évaluation de mécanismes de détection des intrusions au niveau applicatif". Phd thesis, Rennes 1, 2011. http://www.theses.fr/2011REN1S050.
Pełny tekst źródłaLa plupart des mécanismes de détection des anomalies au niveau applicatif reposent sur la détection de la déviation du flot de contrôle d'un programme. Bien souvent, pour détecter cela, le mécanisme repose sur les séquences d'appels système des applications. Cependant, ces méthodes ne permettent pas de détecter les attaques par imitation ou bien les attaques qui modifient les paramètres des appels système. De telles attaques peuvent être réalisées en ciblant les données de calcul utilisées par les processus. Pour compléter ces mécanismes de détection, nous proposons une approche pour détecter la corruption de données de calcul qui influencent l'exécution des appels système. Cette approche repose sur la construction d'un modèle de comportement orienté autour des données et construit par analyse statique du code source. Nous avons implémenté notre approche pour les programmes écrits en langage C. Cette implémentation est utilisée pour illustrer la faisabilité de notre approche sur plusieurs exemples. Pour évaluer plus en détails notre mécanisme de détection, nous proposons aussi une approche pour la simulation d'attaques contre les données de calcul. Cette approche repose sur un modèle de faute qui reproduit l'état interne d'une application après ce type d'attaque. Nous avons implémenté une plateforme d'évaluation en combinant notre modèle de faute avec un mécanisme d'injection en mémoire. Cette plateforme est utilisée pour réaliser une campagne d'injections sur deux exemples afin d'évaluer les capacitées de détection de notre modèle orienté autour des données
Liu, Yi. "Security Assessment Against Side-Channel Attacks : Insights from an Information-Theoretic Perspective". Electronic Thesis or Diss., Institut polytechnique de Paris, 2023. http://www.theses.fr/2023IPPAT033.
Pełny tekst źródłaIn today's world, the widespread use of cryptographic devices highlights the need for their secure operation. Unintended leakages, like time, power, and electromagnetic emissions, can allow attackers to deduce secret keys via side-channel attacks (SCAs). Evaluating the security of cryptographic devices against SCAs is important for both the industrial and academic sectors, and information-theoretic metrics turn out to be effective tools. “Masking” stands out as a key countermeasure, with ongoing discussions on its optimization and the security of its implementations. In light of this context, the central aims of this thesis are to quantify side-channel leakage, appraise the security of cryptographic devices against SCAs (both unprotected and masked), and to explore methodologies for formulating more potent masking codes. For masking code construction, we establish linear programming bounds for the kissing number of q-ary linear codes, guided by recent findings on optimized code-based masking performance related to the dual code's kissing number. In addition, we demonstrate the connection between code-based masking efficacy and the whole weight enumeration of the dual of the masking code. The lexicographical order based on weight distribution prefixes is proposed for selecting ideal masking codes. Regarding side-channel leakage evaluation, we introduce a novel information metric, called conditional Sibson's alpha-information. This metric has an explicit expression and possesses several beneficial properties. Utilizing this metric, we delve into the sidechannel leakage of unprotected devices. Additionally, we use Fano's mutual information to evaluate the sidechannel leakage of code-based masked implementations under probing model. Lastly, when considering the security assessment of masked implementations, we utilize the alphainformation measure to appraise the security of both arithmetic and Boolean masking implementations. We derive universal bounds on the probability of success of any type of side-channel attack. These also provide lower bounds on the minimum number of queries required to achieve a given success rate
Piètre-Cambacédès, Ludovic. "Des relations entre sûreté et sécurité". Phd thesis, Télécom ParisTech, 2010. http://pastel.archives-ouvertes.fr/pastel-00570432.
Pełny tekst źródłaLandry, Simon. "Étude de la résistance des algorithmes cryptographiques symétriques face à la cryptanalyse moderne". Electronic Thesis or Diss., Sorbonne université, 2021. http://www.theses.fr/2021SORUS287.
Pełny tekst źródłaThe goal of this thesis is to contribute to the state-of-the-art by proposing new areas of research in order to secure cryptographic algorithms within an embedded device.Our main focal axis is organized around the countermeasure called threshold implementations which is known to be resistant against side-channel analysis attacks in the presence of glitches.These latter phenomenon occur randomly within an electronic circuit and lead to numerous attacks in cryptanalysis. We study the application of threshold implementations on symmetric-key cryptography.In a first phase, we participate to the cryptographic litterature by designing new threshold implementations easily applicable on a large variety of symmetric-key algorithms. Our countermeasures are provable mathematically secured against side-channel analysis attacks in the presence of glitches. In comparison with the recent publications of the state-of-the-art, we adress new issues and we assure similar or better performances. Therefore, our research has resulted in two patents within STMicroelectronics, thereby contributing to the industrial innovation process.In a second phase, we are interested in the study of the symmetric-key algorithm SM4 and its resistance against side-channel analysis attacks. The works obtained allow to centralize the proposed SM4 countermeasures against side-channel analysis attacks of the state-of-the-art and offer a visibility on the software performances of these constructions. We finally introduce the first threshold implementation of the SM4 algorithm. Our construction is provably mathematically resistant against side-channel analysis attacks in the presence of glitches
Noumon, Allini Elie. "Caractérisation, évaluation et utilisation du jitter d'horloge comme source d'aléa dans la sécurité des données". Thesis, Lyon, 2020. http://www.theses.fr/2020LYSES019.
Pełny tekst źródłaThis thesis, funded by the DGA, is motivated by the problem of evaluation of TRNG for applications with a very high level of security. As current standards such as AIS-31 are not sufficient for these types of applications, the DGA proposes a complementary procedure, validated on TRNG using ring oscillators (RO), which aims to characterize the source of randomness of TRNG in order to identify electronic noises present in it. These noises are manifested in the digital circuits by the clock jitter generated in the RO. They can be characterized by their power spectral density related to the time Allan variance which allows, unlike the standard variance which is still widely used, to discriminate these different types of noise (mainly thermal, flicker). This study was used as a basis for estimating the proportion of jitter due to thermal noise used in stochastic models describing the output of TRNG. In order to illustrate and validate the DGA certification approach on other principles of TRNG apart from RO, we propose a characterization of PLL as a source of randomness. We have modeled the PLL in terms of transfer functions. This modeling has led to the identification of the source of noise at the output of the PLL, as well as its nature as a function of the physical parameters of the PLL. This allowed us to propose recommendations on the choice of parameters to ensure maximum entropy. In order to help in the design of this type of TRNG, we also propose a tool to search for the non-physical parameters of the generator ensuring the best compromise between security and throughput
Longevialle, Christophe. "Contribution à la sécurisation d'un réseau d'information élaborée, par cryptographie et "pare-feu" informatique : application à une base de gestion de rssources humaines". Marne-la-Vallée, 2004. http://www.theses.fr/2004MARN0187.
Pełny tekst źródłaChevallier-Mames, Benoit. "Cryptographie à clé publique : constructions et preuves de sécurité". Paris 7, 2006. http://www.theses.fr/2006PA077008.
Pełny tekst źródłaThe 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)
Martinelli, Jean. "Protection d'algorithmes de chiffrement par blocs contre les attaques par canaux auxiliaires d'ordre supérieur". Versailles-St Quentin en Yvelines, 2011. http://www.theses.fr/2011VERS0043.
Pełny tekst źródłaTraditionally, a cryptographic algorithm is estimated through its resistance to "logical" attacks. When this algorithm is implanted within a material device, physical leakage can be observed during the computation and can be analyzed by an attacker in order to mount "side channel" attacks. The most studied side channel attack is the differential power analysis (DPA). First order DPA is now well known and can be prevented by securely proven countermeasures. In 2008, some results are known for second order, but none for third order. The goal of this thesis is to propose a frame for k-th order DPA where k>1. We developed several masking schemes as alternatives to the classical ones in order to propose a better complexity-security ratio. These schemes make use of various mathematical operations such as field multiplication or matrix product and cryptographic tools as secret sharing and multi-party computation. We estimated the security of the proposed schemes following a methodology using both theoretical analysis and practical results. At last we proposed an evaluation of the action of the word size of a cryptographic algorithm upon its resistance against side channel attacks, with respect to the masking scheme implemented
Masmoudi, Khaled. "Gestion de la confiance dans les réseaux personnels". Evry, Institut national des télécommunications, 2008. http://www.theses.fr/2008TELE0002.
Pełny tekst źródłaWith the advent of new networking paradigms and evolutions, spanning from distributed and self-organized systems such as ad hoc networks, P2P networks or grids, to pervasive computing, wireless mesh networks or embedded devices, many research effort have been conducted to bring the previous theoretic concepts into real life. Security protocols have to fulfill a new requirement : how is it possible to establish trust between parties without any a priori credential, central administration or shared context ? We go even farther in this dissertation : what if each single party was a heterogeneous distributed domain ? This thesis builds a layered architecture with a set of cryptographic protocols, meant to establish trust between devices and services belonging to different users through their Personal Networks. In the first part, the trust vector is an out-of-band channel, based on proximity. The resulting protocols combine identity-based cryptography to link identities to cryptographic material, and cryptographically-generated addresses to provide identity ownership. These new identifiers form a novel namespace that allows cross-layer trust establishment. The de facto security negotiation protocols, namely Internet Key Exchange protocol and Transport layer Security handshake sub-protocol, provide end-to-end secure tunnel establishment, but fail to fit scenarios when a domain controller has to define the security parameters for a device under its supervision. We define in the second part of this dissertation how extensions could be applied to fullfill the previous requirement and delegate tunnel negotiation to a third party. Security validation results and the details of a preliminary implementation are also provided. Last, we design a framework for establishing trust basing on the entity behavior within a group of Personal Networks that share a part of their devices and services. Focusing on service discovery, we show that reputation-based trust can be applied to mitigate selfishness and fake announcements in a federation of Personal Networks
Książki na temat "Cryptographie – Mesures de sûreté – Évaluation"
Schneier, Bruce. Cryptographie appliquée: Protocoles, algorithmes et codes sources en C. Wyd. 2. Paris: Vuibert, 2001.
Znajdź pełny tekst źródłaCRYPTO (Conference) (1992 Santa Barbara, Calif.). Advances in cryptology--CRYPTO '92: 12th Annual International Cryptology Conference, Santa Barbara, California, USA, August 16-20, 1992 : proceedings. Berlin: Springer-Verlag, 1993.
Znajdź pełny tekst źródłaFaith, Cranor Lorrie, i Garfinkel Simson, red. Security and Usability: Designing Secure Systems That People Can Use. Beijing: O'Reilly, 2005.
Znajdź pełny tekst źródłaBauer, Friedrich Ludwig. Decrypted secrets: Methods and maxims of cryptology. Berlin: Springer, 1997.
Znajdź pełny tekst źródłaJaworski, Jamie. Java sécurité. Paris: CampusPress, 2001.
Znajdź pełny tekst źródłaSecrets and lies: Digital security in a networked world. New York: John Wiley, 2000.
Znajdź pełny tekst źródłaJ, Simmons Gustavus, i Institute of Electrical and Electronics Engineers., red. Contemporary cryptology: The science of information integrity. Piscataway, NJ: IEEE Press, 1992.
Znajdź pełny tekst źródłaAnguilla), FC '97 (1997. Financial cryptography: First International Conference, FC '97, Anguilla, British West Indies, February 24-28, 1997 : proceedings. Berlin: Springer, 1997.
Znajdź pełny tekst źródłaBruce, Christianson, i International Workshop on Security Protocols (8th : 2000 : Cambridge, England), red. Security protocols: 8th international workshop, Cambridge, UK, April 3-5, 2000 : revised papers. Berlin: Springer-Verlag, 2001.
Znajdź pełny tekst źródłaGarfinkel, Simson. Practical UNIX and Internet Security. Wyd. 2. Bonn: O'Reilly & Associates, 1996.
Znajdź pełny tekst źródła