用矩阵表示两个密码问题的变换

SIGSAM Bull. Pub Date : 2005-12-01 DOI:10.1145/1140378.1140384

E. Laskari, G. Meletiou, D. Tasoulis, M. Vrahatis

{"title":"用矩阵表示两个密码问题的变换","authors":"E. Laskari, G. Meletiou, D. Tasoulis, M. Vrahatis","doi":"10.1145/1140378.1140384","DOIUrl":null,"url":null,"abstract":"The Discrete Logarithm and the Diffie-Hellman are two hard computational problems, closely related to cryptography and its applications. The computational equivalence of these problems has been proved only for some special cases. In this study, using LU-decomposition to Vandermonde matrices, we are able to transform the two problems in terms of matrices, thus giving a new perspective to their equivalence. A first study on matrix transformations for the Double and Multiple Discrete Logarithms is also presented.","PeriodicalId":314801,"journal":{"name":"SIGSAM Bull.","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Transformations of two cryptographic problems in terms of matrices\",\"authors\":\"E. Laskari, G. Meletiou, D. Tasoulis, M. Vrahatis\",\"doi\":\"10.1145/1140378.1140384\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Discrete Logarithm and the Diffie-Hellman are two hard computational problems, closely related to cryptography and its applications. The computational equivalence of these problems has been proved only for some special cases. In this study, using LU-decomposition to Vandermonde matrices, we are able to transform the two problems in terms of matrices, thus giving a new perspective to their equivalence. A first study on matrix transformations for the Double and Multiple Discrete Logarithms is also presented.\",\"PeriodicalId\":314801,\"journal\":{\"name\":\"SIGSAM Bull.\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SIGSAM Bull.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1140378.1140384\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIGSAM Bull.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1140378.1140384","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

离散对数和Diffie-Hellman是两个与密码学及其应用密切相关的难计算问题。这些问题的计算等价性仅在一些特殊情况下得到了证明。在本研究中，通过对Vandermonde矩阵的lu分解，我们可以将这两个问题转化为矩阵，从而为它们的等价性提供了新的视角。本文还首次研究了二重和多重离散对数的矩阵变换。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Transformations of two cryptographic problems in terms of matrices

The Discrete Logarithm and the Diffie-Hellman are two hard computational problems, closely related to cryptography and its applications. The computational equivalence of these problems has been proved only for some special cases. In this study, using LU-decomposition to Vandermonde matrices, we are able to transform the two problems in terms of matrices, thus giving a new perspective to their equivalence. A first study on matrix transformations for the Double and Multiple Discrete Logarithms is also presented.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

SIGSAM Bull.

自引率

0.00%

发文量