有无互易的MIMO信道密钥生成

Y. Hua, Ahmed Maksud
{"title":"有无互易的MIMO信道密钥生成","authors":"Y. Hua, Ahmed Maksud","doi":"10.1109/CISS56502.2023.10089738","DOIUrl":null,"url":null,"abstract":"This paper presents a generalized channel probing (GCP) method and a generalized pre-processing (GPP) method as two consecutive frontend steps for secret key generation from a MIMO channel between two multi-antenna legitimate nodes against a multi-antenna eavesdropper (Eve). The degree of freedom (DoF) of the secret key capacity (SKC) of GCP/GPP are highlighted and discussed. If the number of antennas on Eve is larger than or equal to the larger number of the antennas on the two legitimate nodes, the SKC-DoF of GCP/GPP within each coherence period equals its minimum, which is either zero for non-reciprocal channel or the product of the numbers of antennas on the two legitimate nodes for reciprocal channel. Otherwise, the SKC-DoF of GCP/GPP increases with the number of random transmissions in GCP within each coherence period regardless of the channel reciprocity. A computational algorithm required for GPP is also discussed, and its performance illustrated via simulations.","PeriodicalId":243775,"journal":{"name":"2023 57th Annual Conference on Information Sciences and Systems (CISS)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Secret Key Generation from MIMO Channel With or Without Reciprocity\",\"authors\":\"Y. Hua, Ahmed Maksud\",\"doi\":\"10.1109/CISS56502.2023.10089738\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a generalized channel probing (GCP) method and a generalized pre-processing (GPP) method as two consecutive frontend steps for secret key generation from a MIMO channel between two multi-antenna legitimate nodes against a multi-antenna eavesdropper (Eve). The degree of freedom (DoF) of the secret key capacity (SKC) of GCP/GPP are highlighted and discussed. If the number of antennas on Eve is larger than or equal to the larger number of the antennas on the two legitimate nodes, the SKC-DoF of GCP/GPP within each coherence period equals its minimum, which is either zero for non-reciprocal channel or the product of the numbers of antennas on the two legitimate nodes for reciprocal channel. Otherwise, the SKC-DoF of GCP/GPP increases with the number of random transmissions in GCP within each coherence period regardless of the channel reciprocity. A computational algorithm required for GPP is also discussed, and its performance illustrated via simulations.\",\"PeriodicalId\":243775,\"journal\":{\"name\":\"2023 57th Annual Conference on Information Sciences and Systems (CISS)\",\"volume\":\"90 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-03-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2023 57th Annual Conference on Information Sciences and Systems (CISS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CISS56502.2023.10089738\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 57th Annual Conference on Information Sciences and Systems (CISS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CISS56502.2023.10089738","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

本文提出了一种通用信道探测(GCP)方法和一种通用预处理(GPP)方法,作为两个连续的前端步骤,从两个多天线合法节点之间的MIMO信道中针对多天线窃听者(Eve)生成密钥。重点讨论了GCP/GPP保密密钥容量(SKC)的自由度。如果Eve上的天线数大于或等于两个合法节点上的天线数,则GCP/GPP在每个相干周期内的SKC-DoF等于其最小值,对于非倒向信道,该最小值为零,对于倒向信道,则为两个合法节点上的天线数之积。否则,无论信道互反与否,GCP/GPP的SKC-DoF随GCP中每个相干周期内随机传输数的增加而增加。讨论了GPP所需的计算算法,并通过仿真说明了其性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Secret Key Generation from MIMO Channel With or Without Reciprocity
This paper presents a generalized channel probing (GCP) method and a generalized pre-processing (GPP) method as two consecutive frontend steps for secret key generation from a MIMO channel between two multi-antenna legitimate nodes against a multi-antenna eavesdropper (Eve). The degree of freedom (DoF) of the secret key capacity (SKC) of GCP/GPP are highlighted and discussed. If the number of antennas on Eve is larger than or equal to the larger number of the antennas on the two legitimate nodes, the SKC-DoF of GCP/GPP within each coherence period equals its minimum, which is either zero for non-reciprocal channel or the product of the numbers of antennas on the two legitimate nodes for reciprocal channel. Otherwise, the SKC-DoF of GCP/GPP increases with the number of random transmissions in GCP within each coherence period regardless of the channel reciprocity. A computational algorithm required for GPP is also discussed, and its performance illustrated via simulations.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信