Spelling suggestions: "subject:"crytography"" "subject:"artography""
1 |
A survey on Traitor Tracing SchemesChen, Jason January 2000 (has links)
When intellectual properties are distributed over a broadcast network, the content is usually encrypted in a way such that only authorized users who have a certain set of keys, can decrypt the content. Some authorized users may be willing to disclose their keys in constructing a pirate decoder which allows illegitimate users to access the content. It is desirable to determine the source of the keys in a pirate decoder, once one is captured. Traitor tracing schemes were introduced to help solve this problem. A traitor tracing scheme usually consists of: a scheme to generate and distribute each user's personal key, a cryptosystem used to protect session keys that are used to encrypt/decrypt the actual content, and a tracing algorithm to determine one source of the keys in a pirate decoder. In this thesis, we survey the traitor tracing schemes that have been suggested. We group the schemes into two groups: <i>symmetric</i> in which the session key is encrypted and decrypted using the same key and <i>asymmetric</i> schemes in which the session key is encrypted and decrypted using different keys. We also explore the possibility of a truly public scheme in which the data supplier knows the encryption keys only. A uniform analysisis presented on the efficiency of these schemes using a set of performance parameters.
|
2 |
A survey on Traitor Tracing SchemesChen, Jason January 2000 (has links)
When intellectual properties are distributed over a broadcast network, the content is usually encrypted in a way such that only authorized users who have a certain set of keys, can decrypt the content. Some authorized users may be willing to disclose their keys in constructing a pirate decoder which allows illegitimate users to access the content. It is desirable to determine the source of the keys in a pirate decoder, once one is captured. Traitor tracing schemes were introduced to help solve this problem. A traitor tracing scheme usually consists of: a scheme to generate and distribute each user's personal key, a cryptosystem used to protect session keys that are used to encrypt/decrypt the actual content, and a tracing algorithm to determine one source of the keys in a pirate decoder. In this thesis, we survey the traitor tracing schemes that have been suggested. We group the schemes into two groups: <i>symmetric</i> in which the session key is encrypted and decrypted using the same key and <i>asymmetric</i> schemes in which the session key is encrypted and decrypted using different keys. We also explore the possibility of a truly public scheme in which the data supplier knows the encryption keys only. A uniform analysisis presented on the efficiency of these schemes using a set of performance parameters.
|
3 |
Características y aplicaciones de las funciones resumen criptográficas en la gestión de contraseñasAndrade, Alicia 07 January 2019 (has links)
Actualmente, la criptografía resulta de vital importancia en la protección de la información, garantizando la confidencialidad, autenticidad, integridad y disponibilidad. Dentro de esta área, las funciones resumen o hash criptográficas tienen mucha aplicabilidad en sistemas y protocolos seguros. Su función principal consiste en pasar de una cadena de longitud arbitraria (mensaje) a una de longitud fija (resumen) de forma que sea muy improbable obtener el mensaje a partir del resumen o encontrar dos mensajes que generen el mismo resumen. Las funciones de derivación de claves basadas en contraseña (PBKDF), son funciones hash especializadas que se usan, comúnmente, para transformar las contraseñas de los usuarios en claves para el cifrado simétrico, así como para la autenticación de usuarios. Se propone un PBKDF con tres niveles de optimización cuyo diseño se basa en emplear el estándar de cifrado avanzado (AES), como un generador pseudoaleatorio y aprovechar el soporte para la aceleración de hardware para AES para mitigar los ataques comunes a los sistemas de autenticación de usuarios basados en contraseña. Se analizan, también, sus características de seguridad, estableciendo que resulta equivalente a la seguridad de AES, y se compara su rendimiento con algoritmos PBKDF de prestigio, como Scrypt y Argon2, con resultados favorables.
|
4 |
Détection Optique Homodyne: application à la cryptographie quantiqueXu, Qing 28 April 2009 (has links) (PDF)
Les réseaux et systèmes de télécommunications mondiaux fondent aujourd'hui leur confidentialité sur la cryptographie classique, qui repose sur des hypothèses mathématiques fragiles. La distribution quantique de clef (QKD) est aujourd'hui la seule façon connue pour distribuer des clefs avec une sécurité inconditionnelle. Ce travail de thèse contribue à combler de manière pluridisciplinaire et polyvalente le gap entre les limites physiques fondamentales et l'implémentation expérimentale, en termes de vitesse, fiabilité et robustesse. Dans un premier temps, nous avons donc proposé une implémentation du protocole BB84 utilisant les états de phase cohérents. Le récepteur homodyne a été conçu de manière à compenser les fluctuations de phase et de polarisation dans les interféromètres, ainsi que dans le reste du canal de propagation. Ensuite, nous avons mis en place un dispositif expérimental de système QKD à la longueur d'onde 1550 nm, avec une modulation QPSK fonctionnant avec un trajet et un sens de parcours uniques, dans une fibre optique mono-mode. Les deux schémas de détection: le comptage de photons (PC) et la détection homodyne équilibrée (BHD) ont été mis en œuvre. Enfin, nous avons effectué des comparaisons théoriques et expérimentales de ces deux récepteurs. Le récepteur BHD a été élaboré avec une décision à double seuil. La mise en œuvre d'un tel processus accepte des mesures non-conclusives, et réduit l'efficacité de génération des clés, mais reste encore bien meilleur que celle des PCs à 1550 nm. Nous avons également prouvé que ce système est robust sous la plupart des attaques potentielles.
|
5 |
Low Power Elliptic Curve CryptographyOzturk, Erdinc 04 May 2005 (has links)
This M.S. thesis introduces new modulus scaling techniques for transforming a class of primes into special forms which enable efficient arithmetic. The scaling technique may be used to improve multiplication and inversion in finite fields. We present an efficient inversion algorithm that utilizes the structure of a scaled modulus. Our inversion algorithm exhibits superior performance to the Euclidean algorithm and lends itself to efficient hardware implementation due to its simplicity. Using the scaled modulus technique and our specialized inversion algorithm we develop an elliptic curve processor architecture. The resulting architecture successfully utilizes redundant representation of elements in GF(p) and provides a low-power, high speed, and small footprint specialized elliptic curve implementation. We also introduce a unified Montgomery multiplier architecture working on the extension fields GF(p), GF(2) and GF(3). With the increasing research activity for identity based encryption schemes, there has been an increasing need for arithmetic operations in field GF(3). Since we based our research on low-power and small footprint applications, we designed a unified architecture rather than having a seperate hardware for GF{3}. To the best of our knowledge, this is the first time a unified architecture was built working on three different extension fields.
|
Page generated in 0.0875 seconds