RLWE/MLWE信道的循环PAM和矢量量化编码

I. Bocharova, H. Hollmann, Karan Khathuria, B. Kudryashov, Vitaly Skachek
{"title":"RLWE/MLWE信道的循环PAM和矢量量化编码","authors":"I. Bocharova, H. Hollmann, Karan Khathuria, B. Kudryashov, Vitaly Skachek","doi":"10.1109/ISIT50566.2022.9834501","DOIUrl":null,"url":null,"abstract":"In some lattice-based cryptosystems, the encryption and decryption processes can be interpreted as a noisy communication channel. In this work, we focus on cryptosystems based on the ring learning with errors (RLWE) and module learning with errors (MLWE) problems, e.g. Kyber. We provide new coding schemes for the communication channel involved in these cryptosystems. For encoding we use an error-correction code (ECC) along with modulo Q pulse amplitude modulation (PAM) (for some fixed small prime power Q), and vector dequantization. For decoding we perform vector quantization followed by hard/soft decision decoding (HDD/SDD) for the ECC. This construction provides remarkable reduction in the decryption failure rate (DFR), compared to some earlier proposed coding schemes for the same bitrate. For example, in Kyber encryption scheme, we reduce the DFR from 2−174 (uncoded) to 2−1325 (using HDD) or 2−1414 (using SDD).","PeriodicalId":348168,"journal":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","volume":"519 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Coding with Cyclic PAM and Vector Quantization for the RLWE/MLWE Channel\",\"authors\":\"I. Bocharova, H. Hollmann, Karan Khathuria, B. Kudryashov, Vitaly Skachek\",\"doi\":\"10.1109/ISIT50566.2022.9834501\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In some lattice-based cryptosystems, the encryption and decryption processes can be interpreted as a noisy communication channel. In this work, we focus on cryptosystems based on the ring learning with errors (RLWE) and module learning with errors (MLWE) problems, e.g. Kyber. We provide new coding schemes for the communication channel involved in these cryptosystems. For encoding we use an error-correction code (ECC) along with modulo Q pulse amplitude modulation (PAM) (for some fixed small prime power Q), and vector dequantization. For decoding we perform vector quantization followed by hard/soft decision decoding (HDD/SDD) for the ECC. This construction provides remarkable reduction in the decryption failure rate (DFR), compared to some earlier proposed coding schemes for the same bitrate. For example, in Kyber encryption scheme, we reduce the DFR from 2−174 (uncoded) to 2−1325 (using HDD) or 2−1414 (using SDD).\",\"PeriodicalId\":348168,\"journal\":{\"name\":\"2022 IEEE International Symposium on Information Theory (ISIT)\",\"volume\":\"519 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-06-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE International Symposium on Information Theory (ISIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT50566.2022.9834501\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE International Symposium on Information Theory (ISIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT50566.2022.9834501","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在一些基于格的密码系统中,加解密过程可以解释为一个有噪声的通信信道。在这项工作中,我们重点研究了基于错误环学习(RLWE)和错误模块学习(MLWE)问题的密码系统,例如Kyber。我们为这些密码系统中涉及的通信信道提供了新的编码方案。对于编码,我们使用纠错码(ECC)以及模Q脉冲幅度调制(PAM)(用于一些固定的小素数功率Q)和矢量去量化。对于解码,我们执行矢量量化,然后对ECC进行硬/软判决解码(HDD/SDD)。与之前提出的相同比特率的编码方案相比,这种结构显著降低了解密失败率(DFR)。例如,在Kyber加密方案中,我们将DFR从2−174(未编码)降低到2−1325(使用HDD)或2−1414(使用SDD)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Coding with Cyclic PAM and Vector Quantization for the RLWE/MLWE Channel
In some lattice-based cryptosystems, the encryption and decryption processes can be interpreted as a noisy communication channel. In this work, we focus on cryptosystems based on the ring learning with errors (RLWE) and module learning with errors (MLWE) problems, e.g. Kyber. We provide new coding schemes for the communication channel involved in these cryptosystems. For encoding we use an error-correction code (ECC) along with modulo Q pulse amplitude modulation (PAM) (for some fixed small prime power Q), and vector dequantization. For decoding we perform vector quantization followed by hard/soft decision decoding (HDD/SDD) for the ECC. This construction provides remarkable reduction in the decryption failure rate (DFR), compared to some earlier proposed coding schemes for the same bitrate. For example, in Kyber encryption scheme, we reduce the DFR from 2−174 (uncoded) to 2−1325 (using HDD) or 2−1414 (using SDD).
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Fast Low Rank column-wise Compressive Sensing Ternary Message Passing Decoding of RS-SPC Product Codes Understanding Deep Neural Networks Using Sliced Mutual Information Rate-Optimal Streaming Codes Over the Three-Node Decode-And-Forward Relay Network Unlimited Sampling via Generalized Thresholding
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1