{"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":"114 1","pages":"0"},"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\":\"114 1\",\"pages\":\"0\"},\"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}
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).
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
