The 4-adic complexity of new quaternary sequences with good autocorrelation

Quaternary sequences with high 4-adic complexity have attracted widespread attention in communication and cryptography systems. In this paper, for an odd prime  p ,  several new classes of quaternary sequences with even period 2 p  are constructed by using the Legendre sequences of period  p . And t...

Full description

Saved in:
Bibliographic Details
Published in:Applicable algebra in engineering, communication and computing Vol. 36; no. 3; pp. 521 - 542
Main Authors: Wang, Yan, Li, Jiawei, Li, Nian, Fu, Yanxi
Format: Journal Article
Language:English
Published: Berlin/Heidelberg Springer Berlin Heidelberg 01.05.2025
Springer Nature B.V
Subjects:
Artificial Intelligence
Autocorrelation
Complexity
Computer Hardware
Computer Science
Original Paper
Symbolic and Algebraic Manipulation
Theory of Computation
Legendre sequences
more
Quaternary sequences
MSC code2
4-adic complexity
MSC code1
Autocorrelation
ISSN:0938-1279, 1432-0622
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Quaternary sequences with high 4-adic complexity have attracted widespread attention in communication and cryptography systems. In this paper, for an odd prime  p ,  several new classes of quaternary sequences with even period 2 p  are constructed by using the Legendre sequences of period  p . And the autocorrelation distribution of the new quaternary sequences is derived. We determine the 4-adic complexity of these new quaternary sequences. The results show that the new quaternary sequences have good autocorrelation properties, and the 4-adic complexity of these new quaternary sequences is large enough to resist the attack of the rational approximation algorithm.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0938-1279
1432-0622
DOI:10.1007/s00200-023-00623-5