Lattice-based lightweight post quantum access authentication scheme for satellite network

Aiming at the problems of quantum computing attacks, high authentication overhead and long interaction time in satellite network access authentication schemes, a lightweight post quantum access authentication scheme based on lattice for a satellite network was proposed. In the registration phase, a lattice Hash function based on the approximate shortest vector problem (SVP) was used to keep the user's identity confidential, which reduced the computation time and completes identity registration. In the authentication phase, a low dimensional modular multiplication modular addition mutual authentication algorithm was designed based on the bonsai tree algorithm, which reduced the algorithm complexity from the quadratic level to the linear level, further decreasing the communication costs during the authentication process and computational costs on satellite. Theoretical proof and performance analysis show that the scheme resists quantum computing attacks and reduces authentication time by at least 150% compared to lattice authentication schemes.

Publication Details

Journal
SHILAP Revista de lepidopterología
Published
2024-10-01
Primary Topic
Astronomy and Astrophysical Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Lattice-based lightweight post quantum access authentication scheme for satellite network

SHILAP Revista de lepidopterología
Astronomy and Astrophysical Research
article

Lattice-based lightweight post quantum access authentication scheme for satellite network

article en

Abstract

Aiming at the problems of quantum computing attacks, high authentication overhead and long interaction time in satellite network access authentication schemes, a lightweight post quantum access authentication scheme based on lattice for a satellite network was proposed. In the registration phase, a lattice Hash function based on the approximate shortest vector problem (SVP) was used to keep the user's identity confidential, which reduced the computation time and completes identity registration. In the authentication phase, a low dimensional modular multiplication modular addition mutual authentication algorithm was designed based on the bonsai tree algorithm, which reduced the algorithm complexity from the quadratic level to the linear level, further decreasing the communication costs during the authentication process and computational costs on satellite. Theoretical proof and performance analysis show that the scheme resists quantum computing attacks and reduces authentication time by at least 150% compared to lattice authentication schemes.

SHILAP Revista de lepidopterología
Peace, Justice and strong institutions
Openalex Percentile: Top 37%
Astronomy and Astrophysical Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Lattice-based lightweight post quantum access authentication scheme for satellite network · SHILAP Revista de lepidopterología (2024) | TGRS Research Map | TGRS