联合加密与纠错编码

1983 IEEE Symposium on Security and Privacy Pub Date : 1983-04-25 DOI:10.1109/SP.1983.10017

S. Kak

{"title":"联合加密与纠错编码","authors":"S. Kak","doi":"10.1109/SP.1983.10017","DOIUrl":null,"url":null,"abstract":"This paper considers the problem of joint encryption and error-correction coding and proposes a solution using D-sequences, which are œdecimal' expansions of fractions. The encryption operation considered is equivalent to exponentiation which forms the basis of several public-key schemes. Several new results on D-sequences are also presented which make the applications to encryption and error coding possible.","PeriodicalId":236986,"journal":{"name":"1983 IEEE Symposium on Security and Privacy","volume":"40 2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1983-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"21","resultStr":"{\"title\":\"Joint Encryption and Error-Correction Coding\",\"authors\":\"S. Kak\",\"doi\":\"10.1109/SP.1983.10017\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper considers the problem of joint encryption and error-correction coding and proposes a solution using D-sequences, which are œdecimal' expansions of fractions. The encryption operation considered is equivalent to exponentiation which forms the basis of several public-key schemes. Several new results on D-sequences are also presented which make the applications to encryption and error coding possible.\",\"PeriodicalId\":236986,\"journal\":{\"name\":\"1983 IEEE Symposium on Security and Privacy\",\"volume\":\"40 2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1983-04-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"21\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1983 IEEE Symposium on Security and Privacy\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SP.1983.10017\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1983 IEEE Symposium on Security and Privacy","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SP.1983.10017","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 21

摘要

本文研究了联合加密和纠错编码问题，并提出了一种利用分数的œdecimal展开式d序列的解决方案。所考虑的加密操作等同于幂运算，幂运算构成了几个公钥方案的基础。本文还提出了一些关于d序列的新结果，使其在加密和错误编码方面的应用成为可能。

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

查看原文本刊更多论文

Joint Encryption and Error-Correction Coding

This paper considers the problem of joint encryption and error-correction coding and proposes a solution using D-sequences, which are œdecimal' expansions of fractions. The encryption operation considered is equivalent to exponentiation which forms the basis of several public-key schemes. Several new results on D-sequences are also presented which make the applications to encryption and error coding possible.

求助全文

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

来源期刊

1983 IEEE Symposium on Security and Privacy

自引率

0.00%

发文量