基于可对角群不变量的公钥密码系统

IF 0.1 Q4 MATHEMATICS

Groups Complexity Cryptology Pub Date : 2015-07-28 DOI:10.1515/gcc-2017-0003

M. Jurás, F. Marko, A. Zubkov

{"title":"基于可对角群不变量的公钥密码系统","authors":"M. Jurás, F. Marko, A. Zubkov","doi":"10.1515/gcc-2017-0003","DOIUrl":null,"url":null,"abstract":"Abstract We develop a public-key cryptosystem based on invariants of diagonalizable groups and investigate properties of such a cryptosystem first over finite fields, then over number fields and finally over finite rings. We consider the security of these cryptosystem and show that it is necessary to restrict the set of parameters of the system to prevent various attacks (including linear algebra attacks and attacks based on the Euclidean algorithm).","PeriodicalId":41862,"journal":{"name":"Groups Complexity Cryptology","volume":"151 1","pages":"31 - 54"},"PeriodicalIF":0.1000,"publicationDate":"2015-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Public-key cryptosystem based on invariants of diagonalizable groups\",\"authors\":\"M. Jurás, F. Marko, A. Zubkov\",\"doi\":\"10.1515/gcc-2017-0003\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract We develop a public-key cryptosystem based on invariants of diagonalizable groups and investigate properties of such a cryptosystem first over finite fields, then over number fields and finally over finite rings. We consider the security of these cryptosystem and show that it is necessary to restrict the set of parameters of the system to prevent various attacks (including linear algebra attacks and attacks based on the Euclidean algorithm).\",\"PeriodicalId\":41862,\"journal\":{\"name\":\"Groups Complexity Cryptology\",\"volume\":\"151 1\",\"pages\":\"31 - 54\"},\"PeriodicalIF\":0.1000,\"publicationDate\":\"2015-07-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Groups Complexity Cryptology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1515/gcc-2017-0003\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Groups Complexity Cryptology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1515/gcc-2017-0003","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 2

摘要

摘要建立了一个基于可对角群不变量的公钥密码系统，研究了该密码系统在有限域、数域和有限环上的性质。我们考虑了这些密码系统的安全性，并表明有必要限制系统的参数集，以防止各种攻击(包括线性代数攻击和基于欧几里得算法的攻击)。

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

查看原文本刊更多论文

Public-key cryptosystem based on invariants of diagonalizable groups

Abstract We develop a public-key cryptosystem based on invariants of diagonalizable groups and investigate properties of such a cryptosystem first over finite fields, then over number fields and finally over finite rings. We consider the security of these cryptosystem and show that it is necessary to restrict the set of parameters of the system to prevent various attacks (including linear algebra attacks and attacks based on the Euclidean algorithm).

求助全文

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

来源期刊

Groups Complexity Cryptology MATHEMATICS-

CiteScore

1.10

自引率

0.00%

发文量