GF中使用紧凑表示的高效密钥协议和签名方案(p/sup 10/)

International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. Pub Date : 2004-06-27 DOI:10.1109/ISIT.2004.1365050

Kenneth J. Giuliani, G. Gong

{"title":"GF中使用紧凑表示的高效密钥协议和签名方案(p/sup 10/)","authors":"Kenneth J. Giuliani, G. Gong","doi":"10.1109/ISIT.2004.1365050","DOIUrl":null,"url":null,"abstract":"This paper presents a efficient key agreement and signature schemes using compact representations in GF(p/sup 10/). We propose an analogous system using GF(p/sup 10/) which gives a 60% reduction in bandwidth from the canonical representation. We also present a signature scheme based on a new problem called the trace discrete log problem (Trace-DLP problem).","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Efficient key agreement and signature schemes using compact representations in GF(p/sup 10/)\",\"authors\":\"Kenneth J. Giuliani, G. Gong\",\"doi\":\"10.1109/ISIT.2004.1365050\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a efficient key agreement and signature schemes using compact representations in GF(p/sup 10/). We propose an analogous system using GF(p/sup 10/) which gives a 60% reduction in bandwidth from the canonical representation. We also present a signature scheme based on a new problem called the trace discrete log problem (Trace-DLP problem).\",\"PeriodicalId\":269907,\"journal\":{\"name\":\"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-06-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2004.1365050\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2004.1365050","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 10

摘要

本文提出了GF(p/sup 10/)中使用紧凑表示的一种高效密钥协议和签名方案。我们提出了一个使用GF(p/sup 10/)的类似系统，它使带宽比规范表示减少了60%。我们还提出了一个基于跟踪离散日志问题(trace - dlp问题)的签名方案。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Efficient key agreement and signature schemes using compact representations in GF(p/sup 10/)

This paper presents a efficient key agreement and signature schemes using compact representations in GF(p/sup 10/). We propose an analogous system using GF(p/sup 10/) which gives a 60% reduction in bandwidth from the canonical representation. We also present a signature scheme based on a new problem called the trace discrete log problem (Trace-DLP problem).

求助全文

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

来源期刊

International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.

自引率

0.00%

发文量

期刊最新文献

A new optimal double periodical construction of one target two-dimensional arrays Distributed power and admission control for time-varying wireless networks Optimal Bregman prediction and Jensen's equality Permutation codes: achieving the diversity-multiplexing tradeoff Subtree decomposition for network coding