[pt] A criptografia quântica foi proposta como uma solução para o problema da distribuição de chaves criptográficas com segurança total garantida pelos princípios da mecânica quântica. Através dessa técnica é possível saber se um espião tentou interceptar a transmissão, o que é impossível utilizando técnicas de transmissão clássicas. Nesse trabalho foi feito um breve resumo da teoria de criptografia quântica, de suas técnicas de transmissão e dos problemas tecnológicos enfrentados. Foi analisada em detalhes a técnica de transmissão de qubits utilizando codificação de freqüência e feita uma comparação dos diferentes esquemas de modulação frente aos protocolos BB84 e B92. Foi demonstrado que os dois esquemas de modulação existentes (AM-AM e PM-PM) são na realidade equivalentes e foi proposto um novo esquema, o AM-PM o único que suporta o protocolo BB84 clássico. Medidas foram realizadas classicamente nos formatos AM-AM e AM-PM. / [en] Quantum cryptography has been proposed as a solution to the cryptographic key distribution problem with absolute security guaranteed by the principles of quantum mechanics. Through this scheme it is possible to find out whether a spy tried to eavesdrop on the transmission, which was impossible to discover using classical transmission techniques. In this work a brief review of quantum cryptography theory, transmission techniques and technological problems involved were performed. It was analyzed in detail the transmission technique employing frequency coding, and a comparison was made between the different modulation schemes and the BB84 and B92 protocols. It was demonstrated that the two existing modulation formats (AM-AM and PM-PM) are in fact equivalent and a new format (AM-PM) was proposed, the only one able to accommodate classical BB84. Classical measurements were performed on the AM-AM and AMPM formats.

L'objectif de ce travail est de fournir des modèles et outils pour simplifier la construction des systèmes distribués à base de composants sécurisés, ainsi que la gestion des propriétés de sécurité, en utilisant des outils de haut niveau d'abstraction pour la configuration et la reconfiguration dynamique. En plus des propriétés d'accessibilité et de communications sécurisées classiques, nous focalisons notre travail sur une propriété des systèmes répartis plus générale : la non-interférence. Cette propriété atteste qu'il ne doit pas y avoir de flux d'information entre des parties publiques et privées du système. Ce qui implique le suivi de l'acheminement de l'information entre les différentes composantes du système distribué. Notre objectif principal est donc de proposer un modèle, accompagné d'un ensemble d'outils, garantissant la propriété de la non-interférence à la construction du système, et ce à une plus grosse granularité : celle des composants. Ces outils permettent de (1) configurer les paramètres de sécurité des composants et des liaisons entre eux, (2) vérifier la propriété de non-interférence dans le code d'un composant et entre les différents composants du système et (3) générer automatiquement le code nécessaire pour appliquer ces propriétés de sécurité. D'autre part, nous proposons une architecture permettant de vérifier dynamiquement la propriété de non-interférence dans un système réparti. / The goal of this thesis is to provide models and tools to simplify secured component-based distributed systems' construction and the management of their security properties, by using high-level tools for dynamic configuration and reconfiguration. In addition to the classic properties of accessibility and secured communications, we focus on a more general security property of distributed systems : the non-interference. This property says that there mustn't be information flow between secret and public parts of the system ; which requires information flow control across the system. Our main objective is to propose a model and set of tools guarantying the non-interference property at compiletime, and at a bigger granularity : the components. These tools are (1) tools for configuring security parameters of components and binding between components, (2) a compiler checking the non-interference property, and (3) tools for automatic generation of code assuring these security properties. On the other hand, we present an architecture enabling a dynamic verification of the non-interference property in a distributed system.

Cette thèse porte sur les attaques par observations. Ces attaques étudient les variations d'émanation d'un composant pour retrouver une clé secrète. Ces émanations peuvent être multiples, par exemple, la consommation de courant électrique, le rayonnement électromagnétique, etc. Généralement, ces attaques font appel à des méthodes statistiques pour examiner la relation entre les émanations du composant et des modèles de consommation imaginés par l'attaquant. Trois axes sont développés dans cette thèse. Dans un premier temps, nous avons implémenté différentes attaques par observations sur des cartes graphiques en utilisant l'API OpenCL. Ces implémentations sont plus performantes que les implémentations classiques, ce qui permet à un attaquant de pouvoir traiter plus de données. Dans un second temps, nous avons proposé l'utilisation du MIC dans le cadre des attaques par observations. L'avantage du MIC, par rapport à l'information mutuelle, est sa facilité de calcul, ne dépendant pas de choix de noyau ou de taille de fenêtre. Son utilisation dans une attaque par observations est donc aisée, même si, la complexité des calculs à effectuer est souvent très importante. Enfin, nous avons introduit une nouvelle attaque, basée sur la distribution jointe de l'entrée et de la sortie de fonction cryptographique. Si cette distribution varie en fonction de la valeur de la clé impliquée par la fonction, on est capable de retrouver la clé secrète utilisée par le composant. Cette nouvelle attaque a la particularité de ne nécessiter ni la connaissance du texte clair, ni la connaissance du texte chiffré, ce qui lui permet d'être efficace même en présence de certaines contre-mesures. / The main subject of this manuscript is the Side Channel Attacks. These attacks investigate the variation of device emanations to retrieve a secret key. These emanations can be the power consumption, the electromagnetic radiation, etc. Most of the time, those attacks use statistical methods to examine the relationship between the emanations and some leakage models supposed by the attacker. Three main axis are developed here. First, we have implemented many side channel attacks on GPGPU using the API OpenCL. These implementations are more effective than the classical ones, so an attacker can exploit more data. Then, in order to provide a new side channel attack, we have suggested the use of a new dependency measurement proposed by Reshef et al., the MIC. The MIC is more advantageous than the mutual information, because its computation does not depend of a kernel choice nor a windows size. So, its use in side channel analysis is simple, even if the time complexity is large. Finally, we have introduced a new attack based on the join distribution of the input and the output of a cryptographic sub-function. If the distribution depends on the key used in the function, we can retrieve the secret key. This attack can be efficient even in presence of some countermeasures because it does not required the knowledge of both plain text or cipher text.

Je souhaite réaliser un modèle théorique optimal pour les protocoles de partage de secret quantique basé sur l'utilisation des états graphes. Le paramètre représentatif d'un partage de secret à seuil est, entre autres la taille du plus grand ensemble de joueurs qui ne peut pas accéder au secret. Je souhaite donc trouver un famille de protocoles pour laquelle ce paramètre est le plus petit possible. J'étudie également les liens entre les protocoles de partage de secret quantique et des familles de courbes en géométrie algébrique. / I 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.

Les échanges des informations confidentielles ou critiques dans un environnement public, et donc potentiellement hostile, nécessitent l'emploi de techniques cryptographiques (protocoles et primitives). Malheureusement, l'expérience montre qu'une mauvaise conception, ou une expression peu claire des propriétés et hypothèses de sécurité attendues conduisent à des attaques, et qu'il faut parfois des années avant que celles-ci soient découvertes et corrigées. D'où l'adoption croissante de la sécurité prouvable, où on donne une définition rigoureuse des objectifs de sécurité et des démonstrations mathématiques que ceux-ci sont remplis. Par ailleurs, la complexité et la diversité des systèmes cryptographiques croît également. Il est donc largement admis qu'il n'est plus viable d'écrire ou vérifier manuellement des démonstrations cryptographiques (Bellare& Rogaway 2004, Shoup 2004, Halevi 2005) et qu'il faut développer des méthodes de vérification des systèmes cryptographiques assistées par ordinateur. L'objectif de cette thèse est d'effectuer des progrès significatifs dans cette direction. Plus précisement on s'interesse à la preuve formelle de protocoles cryptographiques. Vérifier des protocoles cryptographiques requiert le développement d'un cadre théorique qui doit permettre: - une modélisation précise des protocoles cryptographiques et des propriétés de sécurité qu'on veut prouver dans le modèle calculatoire. - mise en place de stratégies d'automatisation de preuves. - prise en compte des modèles plus réalistes pour l'adversaire (canaux cachés, ressources de calcul). A la fin de la thèse on a obtenu un cadre formel et un ensemble de méthodes logicielles capable d'aider à la vérification des protocoles cryptographiques. / Critical and private information are exchanged on public environment. To protect it from dishonest users, we use cryptographic tools. Unfortunately, bad conception, poorly written security properties and required security hypothesis lead to attacks, and it may take years before one discover the attack and fix the security schemes involved. In this context, provable security provides formal definitions for security objectives and implied mathematical proofs that these objectives are fullfilled. On another hand, complexity and variety of cryptographic systems are increasing, and proofs by hand are too complicated to write and to verify (Bellare& Rogaway 2004, Shoup 2004, Halevi 2005). Thus, we need computer-assisted verification methods for cryptographic systems. The aim of this thesis is to progress in this direction. More precisely we want significant progress over formal proofs on cryptographic protocols. To verify cryptographic protocols we need to develop a theoritical framework providing: - a precise modelisation for cryptographic protocols and security properties we want to prove in the computationnal model, - designing tactics to automate proofs, - taking into account realistic models for adversary (side-channels...). By the end of the thesis we have enhanced a theoretical framework and computing tools helping verifying cryptographic protocols.

Made available in DSpace on 2016-06-02T19:05:17Z (GMT). No. of bitstreams: 1 DissRPBM.pdf: 1011856 bytes, checksum: 715ebb8b484f0962fc766a3efbebb601 (MD5) Previous issue date: 2006-05-31 / Financiadora de Estudos e Projetos / EPCGlobal communication protocol for RFID (Radio Frequency Identification) does not ensure security and privacy for its system users. This fact makes possible several kinds of security problems on RFID technology usage justifying that security mechanisms should be added to communication protocol preserving the existing standards. This work proposal is based on communication authentication usage making use of low-cost cryptography with the TEA algorithm. The proposed mutual authentication mechanism was specified and proved using BAN logic. All protocol specification has considered the EPCGlobal standard for Class 1 tags as base adding security and privacy extensions to data communication to get protection against several attacks. The results from this work include an authentication protocol formal specification with cryptography allowing this way the protocol standardization using as base the current Class 1 protocol. / O protocolo de comunicação para a Identificação por Radiofreqüência (RFID- Radio Frequency Identification), definido como padrão pela EPCGlobal, não oferece mecanismos para a garantia de segurança e privacidade aos usuários do sistema. Esta característica possibilita a presença de diversos tipos de problemas no emprego da tecnologia justificando que novos mecanismos de segurança sejam incorporados diretamente ao protocolo de comunicação, preservando os padrões existentes. A proposta deste trabalho baseia-se na utilização de autenticação da comunicação com emprego de criptografia de baixo custo utilizando o algoritmo TEA. O mecanismo de autenticação mútua proposto foi especificado e validado com lógica BAN. Toda a especificação do protocolo considerou o padrão EPCGlobal para tags Classe 1 como base, adicionando extensões visando combater as possibilidades de ataques relacionados à segurança e privacidade na comunicação dos dados. Os resultados obtidos com este trabalho incluem a especificação formal de um protocolo de autenticação com criptografia, permitindo a padronização deste protocolo baseado no padrão para tags Classe 1 e preservando a especificação padrão base.

Submitted by Viviane Lima da Cunha (viviane@biblioteca.ufpb.br) on 2015-11-04T10:36:45Z No. of bitstreams: 2 arquivototal.pdf: 4819014 bytes, checksum: b89987c92ac5294da134e67b82d09cd2 (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) / Approved for entry into archive by Viviane Lima da Cunha (viviane@biblioteca.ufpb.br) on 2015-11-04T11:40:46Z (GMT) No. of bitstreams: 2 arquivototal.pdf: 4819014 bytes, checksum: b89987c92ac5294da134e67b82d09cd2 (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) / Made available in DSpace on 2015-11-04T11:40:46Z (GMT). No. of bitstreams: 2 arquivototal.pdf: 4819014 bytes, checksum: b89987c92ac5294da134e67b82d09cd2 (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) Previous issue date: 2013-04-15 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES / In this paper we are studying cryptography’s evolution throughout history; analyzing the difference between symmetric and asymmetric cryptographies; enunciating definitions and theorems about binary relations, group theories, primitive roots and discrete logarithms; understanding the procedure of Diffie-Hellman’s key change protocol. In the last part in this work, we are proposing three activities to be applied in classroom. / Neste trabalho, vamos estudar a evolução da criptografia ao longo da história; analisar a diferença entre as criptografias simétricas e assimétricas; enunciar definições e teoremas sobre relações binárias, teoria dos grupos, raízes primitivas e logaritmos discretos; entender o procedimento do protocolo da troca de chaves de Diffie-Hellman; e, na parte final deste trabalho, iremos propor três atividades para serem aplicadas em sala de aula.

Submitted by GEOVANE MODENA PEREIRA null (geovanemodena@hotmail.com) on 2018-02-10T03:04:38Z No. of bitstreams: 1 Dissertação Geovane - Criptografia de Qubits de Férmions de Majorana por meio de Estados Ligados no Contínuo.pdf: 7524654 bytes, checksum: 0bd9409e8fa9c0c2da9190e44f4cfa33 (MD5) / Approved for entry into archive by Ana Paula Santulo Custódio de Medeiros null (asantulo@rc.unesp.br) on 2018-02-14T16:11:32Z (GMT) No. of bitstreams: 1 pereira_gm_me_rcla.pdf: 7420427 bytes, checksum: 0a0aec5beec2ecdd26883e0f4524844f (MD5) / Made available in DSpace on 2018-02-14T16:11:32Z (GMT). No. of bitstreams: 1 pereira_gm_me_rcla.pdf: 7420427 bytes, checksum: 0a0aec5beec2ecdd26883e0f4524844f (MD5) Previous issue date: 2017-12-01 / Nós investigamos teoricamente uma cadeia topológica de Kitaev conectada a dois pontos quânticos (QDs) hibridizados a terminais metálicos. Neste sistema, observamos o surgimento de dois fenômenos marcantes: (i) uma decriptografia do Férmion de Majorana (MF), que é detectado por meio de medições de condutância devido ao estado de vazamento assimétrico do qubit de MFs nos QDs; (ii) criptografia desse qubit em ambos os QDs quando o vazamento é simétrico. Em tal regime, temos portanto a criptografia proposta, uma vez que o qubit de MFs separa-se nos QDs como estados ligados no contínuo (BICs), os quais não são detectáveis em experimentos de condutância. / We theoretically investigate a topological Kitaev chain connected to a double quantum-dot (QD) setup hybridized with metallic leads. In this system, we observe the emergence of two striking phenomena: i) a decrypted Majorana Fermion (MF) - qubit recorded over a single QD, which is detectable by means of conductance measurements due to the asymmetrical MF-leaked state into the QDs; ii) an encrypted qubit recorded in both QDs when the leakage is symmetrical. In such a regime, we have a cryptography-like manifestation, since the MF-qubit becomes bound states in the continuum, which is not detectable in conductance experiments.

Made available in DSpace on 2015-05-14T12:36:36Z (GMT). No. of bitstreams: 1 ArquivoTotalElenilson.pdf: 4384305 bytes, checksum: 9256e23f2f52ecd3f4d8262f8ada2941 (MD5) Previous issue date: 2013-03-22 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES / The Information and Communications Technology (ICT) field has changed due to both universalization of connectivity and popularization of devices. Such events have provided for the appearance of new networks which are able to send larges amounts of data and also on a faster way. The broadband networks support the development of new technologies and then more data can be generated and sent by these networks. When these technologies are applied to medical or military domains, for example, one of the main issues is the integrity and confidentiality of the data being transmitted over the network. This work presents a privacy and security strategy based on authentication, verification of users authenticity and distribution of encrypted streams. This paper is divided into two parts: the first one describes a strategy for multimedia reflectors which send AES-encrypted streams and are able to perform many types of media encoding. The second part describes a security server which authenticates, creates user groups and distributes group keys only to authenticated and permitted users. It uses Federated Authentications provided by the Federated Academic Community (CAFe). For the matter of comparison of the present strategy with previous studies, a systematic mapping was done to discuss the techniques for authentication and media transmission. In order to validate the work, the whole strategy was integrated to the Arthron - a tool for multimedia transmissions. The testing scheme used the 2k factorial designs and it analyzed the influence of the processing, encrypting and coding in the time transmission. / A área de Tecnologia da Informação e Comunicação (TIC) tem sofrido uma notável transformação caracterizada pela universalização das formas de conectividade e popularização de dispositivos. Tais fatores propiciaram o surgimento de novas redes de transmissão para lidar com grandes volumes de dados e com grande poder de transmissão , o q ue leva o rápido desenvolvimento de várias tecnologias multimídia onde cada vez mais dados são gerados e transmitidos pela rede. Quando aplicadas a domínios médicos, comerciais e militares, por exemplo, um dos principais pontos a serem considerados é a int egridade e confidencialidades d esses dados . Assim, este trabalho apresenta uma estratégia de segurança com ênfase em confidencialidade , baseada na autenticação e verificação de autenticidade de usuários, além da distri buição de fluxos criptografados . Para atingir tais objetivos, foi dividido em duas partes : uma que descreve uma estratégia de refletores para transmissão de fluxos com criptografia AES e múltiplas codificações e outra que demonstra um servidor de segurança para fazer autenticação, criação de g rupos e distribuição de chaves de grupos para usuários autenticados e com permissão para acessar tais informações , além da utilização de autenticação federada através da Comunidade Acadêmica Federada (CAFe) . Um Mapeamento Sistemático foi feito o que permit iu a descoberta de diversas técnicas que puderam ser aplicadas ou comparadas tanto nos refletores quanto no servidor de segurança, além do destacamento de possíveis lacunas na literatura que permitem su a exploração. Como parte dos resultados, a estratégia foi aplicada à Arthron 3.0 e possibilitou realização de transmissões com diversos fluxos de vídeo em alta definição

Made available in DSpace on 2014-12-17T14:55:40Z (GMT). No. of bitstreams: 1 JoseMF.pdf: 585000 bytes, checksum: d743090da952a3d8b178ffb4048abd4b (MD5) Previous issue date: 2009-12-16 / Coordena??o de Aperfei?oamento de Pessoal de N?vel Superior / RFID (Radio Frequency Identification) identifies object by using the radio frequency which is a non-contact automatic identification technique. This technology has shown its powerful practical value and potential in the field of manufacturing, retailing, logistics and hospital automation. Unfortunately, the key problem that impacts the application of RFID system is the security of the information. Recently, researchers have demonstrated solutions to security threats in RFID technology. Among these solutions are several key management protocols. This master dissertations presents a performance evaluation of Neural Cryptography and Diffie-Hellman protocols in RFID systems. For this, we measure the processing time inherent in these protocols. The tests was developed on FPGA (Field-Programmable Gate Array) platform with Nios IIr embedded processor. The research methodology is based on the aggregation of knowledge to development of new RFID systems through a comparative analysis between these two protocols. The main contributions of this work are: performance evaluation of protocols (Diffie-Hellman encryption and Neural) on embedded platform and a survey on RFID security threats. According to the results the Diffie-Hellman key agreement protocol is more suitable for RFID systems / Identifica??o por r?dio freq??ncia, tamb?m chamada de RFID (Radio Frequency Identification), representa uma tecnologia de transmiss?o de dados sem fio. Estes dados s?o relacionados principalmente a c?digos de identifica??o. A tecnologia RFID vem apresentando um grande potencial de utiliza??o em setores da automa??o industrial, residencial e hospitalar. No entanto, estas aplica??es podem resultar em riscos a seguran?a e privacidade dos usu?rios. Recentemente, pesquisadores v?m apresentando poss?veis solu??es as amea?as de seguran?a da tecnologia. Entre estas solu??es est?o os protocolos de distribui??o de chaves criptogr?ficas. O presente trabalho tem como objetivo realizar uma avalia??o de desempenho dos protocolos de Criptografia Neural e Diffie-Hellman na gera??o de chaves em sistemas RFID. Para isso, iremos mensurar o tempo de processamento destes protocolos. Para os testes foi desenvolvido uma plataforma em FPGA (Field-Programmable Gate Array) com o processador embarcado Nios IIr. Sobre esta plataforma foram utilizados os protocolos de Criptografia Neural e Diffie-Hellman no processo de gera??o de chaves criptogr?ficas. A metodologia de pesquisa baseia-se na agrega??o de conhecimento ao desenvolvimento de novos sistemas RFID atrav?s de uma an?lise comparativa entre esses dois protocolos de seguran?a da informa??o. As principais contribui??es deste trabalho s?o: avalia??o de desempenho dos protocolos (Diffie- Hellman e Criptografia Neural) em uma plataforma embarcada e um levantamento bibliogr?fico de pesquisas relacionadas ? seguran?a da informa??o em sistemas RFID. Nos resultados obtidos foi poss?vel observar que o protocolo de Diffie-Hellman ? mais apropriado para sistemas RFID