{"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}
引用次数: 21
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.