基于椭圆曲线的公钥密码体制

1993 IEEE South African Symposium on Communications and Signal Processing Pub Date : 1993-08-06 DOI:10.1109/COMSIG.1993.365883

J. Botes, W. Penzhorn

{"title":"基于椭圆曲线的公钥密码体制","authors":"J. Botes, W. Penzhorn","doi":"10.1109/COMSIG.1993.365883","DOIUrl":null,"url":null,"abstract":"We discuss the use of elliptic curves in cryptography. Compared to the difficulty of solving the classical discrete logarithm problem, it appears that the elliptic curve analog of the discrete logarithm problem is at least as difficult to solve, especially over GF (2/sup m/). Furthermore, elliptic curve cryptosystems might prove to have a higher bit-rate operation than conventional cryptosystems.<<ETX>>","PeriodicalId":398160,"journal":{"name":"1993 IEEE South African Symposium on Communications and Signal Processing","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Public-key cryptosystems based on elliptic curves\",\"authors\":\"J. Botes, W. Penzhorn\",\"doi\":\"10.1109/COMSIG.1993.365883\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We discuss the use of elliptic curves in cryptography. Compared to the difficulty of solving the classical discrete logarithm problem, it appears that the elliptic curve analog of the discrete logarithm problem is at least as difficult to solve, especially over GF (2/sup m/). Furthermore, elliptic curve cryptosystems might prove to have a higher bit-rate operation than conventional cryptosystems.<<ETX>>\",\"PeriodicalId\":398160,\"journal\":{\"name\":\"1993 IEEE South African Symposium on Communications and Signal Processing\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-08-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1993 IEEE South African Symposium on Communications and Signal Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/COMSIG.1993.365883\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1993 IEEE South African Symposium on Communications and Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMSIG.1993.365883","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

讨论椭圆曲线在密码学中的应用。与求解经典离散对数问题的难度相比，离散对数问题的椭圆曲线模拟似乎至少同样难以求解，特别是在GF (2/sup m/)上。此外，椭圆曲线密码系统可能被证明具有比传统密码系统更高的比特率操作。

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

查看原文本刊更多论文

Public-key cryptosystems based on elliptic curves

We discuss the use of elliptic curves in cryptography. Compared to the difficulty of solving the classical discrete logarithm problem, it appears that the elliptic curve analog of the discrete logarithm problem is at least as difficult to solve, especially over GF (2/sup m/). Furthermore, elliptic curve cryptosystems might prove to have a higher bit-rate operation than conventional cryptosystems.<>

求助全文

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

来源期刊

1993 IEEE South African Symposium on Communications and Signal Processing

自引率

0.00%

发文量