Sistema criptográfico para almacenamiento y transporte de información basado en álgebra de curvas hiperelípticas
This work presents the implementation of a cryptographic system that uses a hypereleptic curve of genus 2 working in a finite field GF [q]; Where q is a prime number of 192 bits, uses the Cantor algorithm for addition and doubling of divisors and the Montgomery ladder Multiplication method to perfor...
| Autor Principal: | Cortés Osorio, Carlos Eduardo |
|---|---|
| Formato: | info:eu-repo/semantics/bachelorThesis |
| Idioma: | spa |
| Publicado: |
Ingenierias
2017
|
| Materias: | |
| Acceso en línea: |
http://hdl.handle.net/10819/4277 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| Sumario: |
This work presents the implementation of a cryptographic system that uses a hypereleptic curve of genus 2 working in a finite field GF [q]; Where q is a prime number of 192 bits, uses the Cantor algorithm for addition and doubling of divisors and the Montgomery ladder Multiplication method to perform the computation of an integer by a divisor, all this in order to perform the algorithm Diffie-Hellman key exchange version for hypereliptic curves (DHHEC). The system also uses a 128-bit block cipher called TWOFISH for encryption and decryption of information. The key to this algorithm results from selecting the least significant 128 bits of the 192-bit agreed-upon key. |
|---|