Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2509.15547

Help | Advanced Search

Computer Science > Cryptography and Security

arXiv:2509.15547 (cs)
[Submitted on 19 Sep 2025 ]

Title: Fluid Antenna System-assisted Physical Layer Secret Key Generation

Title: 基于流体天线系统的物理层秘密密钥生成

Authors:Zhiyu Huang, Guyue Li, Hao Xu, Derrick Wing Kwan Ng
Abstract: This paper investigates physical-layer key generation (PLKG) in multi-antenna base station systems, by leveraging a fluid antenna system (FAS) to dynamically customize radio environments. Without requiring additional nodes or extensive radio frequency chains, the FAS effectively enables adaptive antenna port selection by exploiting channel spatial correlation to enhance the key generation rate (KGR) at legitimate nodes. To comprehensively evaluate the efficiency of the FAS in PLKG, we propose an FAS-assisted PLKG model that integrates transmit beamforming and sparse port selection under independent and identically distributed and spatially correlated channel models, respectively. Specifically, the PLKG utilizes reciprocal channel probing to derive a closed-form KGR expression based on the mutual information between legitimate channel estimates. Nonconvex optimization problems for these scenarios are formulated to maximize the KGR subject to transmit power constraints and sparse port activation. We propose an iterative algorithm by capitalizing on successive convex approximation and Cauchy-Schwarz inequality to obtain a locally optimal solution. A reweighted $\ell_1$-norm-based algorithm is applied to advocate for the sparse port activation of FAS-assisted PLKG. Furthermore, a low-complexity sliding window-based port selection is proposed to substitute reweighted $\ell_1$-norm method based on Rayleigh-quotient analysis. Simulation results demonstrate that the FAS-PLKG scheme significantly outperforms the FA-PLKG scheme in both independent and spatially correlated environments. The sliding window-based port selection method introduced in this paper has been shown to yield superior KGR, compared to the reweighted $\ell_1$-norm method. It is shown that the FAS achieves higher KGR with fewer RF chains through dynamic sparse port selection.
Abstract: 本文研究了多天线基站系统中的物理层密钥生成(PLKG),通过利用流体天线系统(FAS)动态定制无线环境。 无需额外节点或大量射频链路,FAS通过利用信道空间相关性,有效实现自适应天线端口选择,以提高合法节点的密钥生成速率(KGR)。 为了全面评估FAS在PLKG中的效率,我们提出了一种FAS辅助的PLKG模型,在独立同分布和空间相关信道模型下分别集成发射波束成形和稀疏端口选择。 具体而言,PLKG利用互易信道探测来推导基于合法信道估计之间互信息的闭式KGR表达式。 针对这些场景,提出了非凸优化问题,以在发射功率约束和稀疏端口激活条件下最大化KGR。 我们提出了一种迭代算法,利用连续凸近似和柯西-施瓦茨不等式来获得局部最优解。 应用了一种重加权$\ell_1$-范数的算法,以促进FAS辅助PLKG的稀疏端口激活。 此外,提出了一种低复杂度的滑动窗口端口选择方法,以替代基于瑞利商分析的重加权$\ell_1$-范数方法。 仿真结果表明,FAS-PLKG方案在独立和空间相关环境中均显著优于FA-PLKG方案。 本文引入的基于滑动窗口的端口选择方法相比重加权$\ell_1$-范数方法表现出更优的KGR。 结果显示,FAS通过动态稀疏端口选择,在较少射频链路的情况下实现了更高的KGR。
Subjects: Cryptography and Security (cs.CR) ; Information Theory (cs.IT)
Cite as: arXiv:2509.15547 [cs.CR]
  (or arXiv:2509.15547v1 [cs.CR] for this version)
  https://doi.org/10.48550/arXiv.2509.15547
arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Zhiyu Huang [view email]
[v1] Fri, 19 Sep 2025 03:01:29 UTC (3,228 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
  • Other Formats
view license
Current browse context:
cs.CR
< prev   |   next >
new | recent | 2025-09
Change to browse by:
cs
cs.IT
math
math.IT

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号