DHA :um esquema de acordo de chaves baseado em matrizes para o protocolo Diffie-Hellman

AUTOR(ES)
DATA DE PUBLICAÇÃO

2007

RESUMO

In this work is proposed an annonimous cryptographic key agreement protocol by secure way based on Diffe-Hellman protocol. Actually key agreement protocols like Diffe-Hellman, ElGamal and other work with modular exponentiation operations and the complexity of such protocols are based on apparent diffcult to deal DLP (Discrete Logarithm Problems). The proposed protocol in this master degree thesis is based on Diffe-Hellman, but uses as base generator a matrix and a vector, doing with the complexity to solve such protocol be based on DLP solution, but much more complexity than was shown by Diffe-Hellman. Based on ccomplexity analysis of DHA1 and DHA2, improvements were proposed to difcult the criptanalisys of DHA1 generating thus, a third proposal called DHA3 Protocol. The usage of matrices, vectors and operations under GL(n) are responsable by diffculting the criptanalisys. Due to using matrices and vectors the proposed method can work with prime numbers with small precision under modular operaions, decreesing thus the computational cost without decreesing the complexity to break. One prototype was developed as concept proof to show the proposal viability. In this prototype it was constacted that DHA3 taken about five less computer processing time than DH to generate the session key and also transmited at least half information than DH.

ASSUNTO(S)

data protection proteção de dados assinatura digital computer networks informática - dissertações digital signatures criptografia de dados (computação) computadores - medidas de segurança redes de computação - medidas de segurança ciencia da computacao data encryption (computer science) computer security

ACESSO AO ARTIGO

Documentos Relacionados