椭圆曲线与点阵密码系统

2019 International Conference on Intelligent Systems and Advanced Computing Sciences (ISACS) Pub Date : 2019-12-01 DOI:10.1109/ISACS48493.2019.9068885

M. Elhassani, A. Chillali, A. Mouhib

{"title":"椭圆曲线与点阵密码系统","authors":"M. Elhassani, A. Chillali, A. Mouhib","doi":"10.1109/ISACS48493.2019.9068885","DOIUrl":null,"url":null,"abstract":"In this work, we will present a new hybrid cryptography method based on two hard problems: 1- The problem of the discrete logarithm on an elliptic curve defined on a finite local ring. 2- The closest vector problem in lattice and the conjugate problem on square matrices. At first, we will make the exchange of keys to the Diffie-Hellman. The encryption of a message is done with a bad basis of a lattice.","PeriodicalId":312521,"journal":{"name":"2019 International Conference on Intelligent Systems and Advanced Computing Sciences (ISACS)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Elliptic curve and Lattice cryptosystem\",\"authors\":\"M. Elhassani, A. Chillali, A. Mouhib\",\"doi\":\"10.1109/ISACS48493.2019.9068885\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this work, we will present a new hybrid cryptography method based on two hard problems: 1- The problem of the discrete logarithm on an elliptic curve defined on a finite local ring. 2- The closest vector problem in lattice and the conjugate problem on square matrices. At first, we will make the exchange of keys to the Diffie-Hellman. The encryption of a message is done with a bad basis of a lattice.\",\"PeriodicalId\":312521,\"journal\":{\"name\":\"2019 International Conference on Intelligent Systems and Advanced Computing Sciences (ISACS)\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 International Conference on Intelligent Systems and Advanced Computing Sciences (ISACS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISACS48493.2019.9068885\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 International Conference on Intelligent Systems and Advanced Computing Sciences (ISACS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISACS48493.2019.9068885","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

本文提出了一种新的混合密码方法，该方法基于两个难题:1-有限局部环上椭圆曲线上的离散对数问题。格中的最近向量问题和方阵上的共轭问题。首先，我们要交换迪菲-海尔曼的钥匙。消息的加密是用一个不好的格基来完成的。

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

查看原文本刊更多论文

Elliptic curve and Lattice cryptosystem

In this work, we will present a new hybrid cryptography method based on two hard problems: 1- The problem of the discrete logarithm on an elliptic curve defined on a finite local ring. 2- The closest vector problem in lattice and the conjugate problem on square matrices. At first, we will make the exchange of keys to the Diffie-Hellman. The encryption of a message is done with a bad basis of a lattice.

求助全文

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

来源期刊

2019 International Conference on Intelligent Systems and Advanced Computing Sciences (ISACS)

自引率

0.00%

发文量