Optimal Pilot Length for Key Generation in Correlated Wireless Channels

IF 5.5 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS IEEE Wireless Communications Letters Pub Date : 2024-08-16 DOI:10.1109/LWC.2024.3444821
Danqi Li;Shihao Yan;Jia Zhang;Jiande Sun;Feng Shu
{"title":"Optimal Pilot Length for Key Generation in Correlated Wireless Channels","authors":"Danqi Li;Shihao Yan;Jia Zhang;Jiande Sun;Feng Shu","doi":"10.1109/LWC.2024.3444821","DOIUrl":null,"url":null,"abstract":"This letter examines the optimal pilot length for key generation in correlated wireless channels. We first deduce the secret key capacity as a function of the pilot length N and other system parameters. Then, derive two fixed-point equations to identify the optimal N with and without an eavesdropper. Our analysis and numerical results confirm the existence of the optimal N that maximizes the secret key capacity, and both results for optimal N are consistent. Furthermore, the optimal N generally decreases with average signal-to-noise ratio and maximum Doppler shift. Our examination can provide useful guidelines in designing practical key generation systems.","PeriodicalId":13343,"journal":{"name":"IEEE Wireless Communications Letters","volume":"13 10","pages":"2767-2771"},"PeriodicalIF":5.5000,"publicationDate":"2024-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Wireless Communications Letters","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10638138/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

This letter examines the optimal pilot length for key generation in correlated wireless channels. We first deduce the secret key capacity as a function of the pilot length N and other system parameters. Then, derive two fixed-point equations to identify the optimal N with and without an eavesdropper. Our analysis and numerical results confirm the existence of the optimal N that maximizes the secret key capacity, and both results for optimal N are consistent. Furthermore, the optimal N generally decreases with average signal-to-noise ratio and maximum Doppler shift. Our examination can provide useful guidelines in designing practical key generation systems.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
相关无线信道中密钥生成的最佳先导长度
这封信探讨了在相关无线信道中生成密钥的最佳先导长度。我们首先推导出密匙容量与先导长度 N 和其他系统参数的函数关系。然后,推导出两个定点方程,以确定有窃听器和无窃听器时的最佳 N。我们的分析和数值结果证实,存在能使密钥容量最大化的最佳 N,而且最佳 N 的两个结果是一致的。此外,最佳 N 通常随平均信噪比和最大多普勒频移而减小。我们的研究可以为设计实用的密钥生成系统提供有用的指导。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Wireless Communications Letters
IEEE Wireless Communications Letters Engineering-Electrical and Electronic Engineering
CiteScore
12.30
自引率
6.30%
发文量
481
期刊介绍: IEEE Wireless Communications Letters publishes short papers in a rapid publication cycle on advances in the state-of-the-art of wireless communications. Both theoretical contributions (including new techniques, concepts, and analyses) and practical contributions (including system experiments and prototypes, and new applications) are encouraged. This journal focuses on the physical layer and the link layer of wireless communication systems.
期刊最新文献
DDQN-Based Uplink Resource Allocation in LEO Satellite-Enabled IoT Networks Multihop Routing for Maximum Semantic Spectral Efficiency Efficient Selection of Decoding Order for Rate Maximization in Uplink RSMA Active Versus Passive: CRB Constrained Beamforming Design and Reflection Manipulation for RIS Assisted ISAC System 2DAM-SC: Two-Dimensional-Adaptive Modulation for Semantic Communications under Shadowed Fading Channels
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1