The 4-adic complexity of quaternary sequences with low autocorrelation and high linear complexity
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866914632021573632 |
|---|---|
| author | Yan, Feifei Ke, Pinhui Xiao, Lingmei |
| author_facet | Yan, Feifei Ke, Pinhui Xiao, Lingmei |
| contents | Recently, Jiang et al. proposed several new classes of quaternary sequences with low autocorrelation and high linear complexity by using the inverse Gray mapping (JAMC, \textbf{69} (2023): 689--706). In this paper, we estimate the 4-adic complexity of these quaternary sequences. Our results show that these sequences have large 4-adic complexity to resist the attack of the rational approximation algorithm. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_03204 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | The 4-adic complexity of quaternary sequences with low autocorrelation and high linear complexity Yan, Feifei Ke, Pinhui Xiao, Lingmei Cryptography and Security Recently, Jiang et al. proposed several new classes of quaternary sequences with low autocorrelation and high linear complexity by using the inverse Gray mapping (JAMC, \textbf{69} (2023): 689--706). In this paper, we estimate the 4-adic complexity of these quaternary sequences. Our results show that these sequences have large 4-adic complexity to resist the attack of the rational approximation algorithm. |
| title | The 4-adic complexity of quaternary sequences with low autocorrelation and high linear complexity |
| topic | Cryptography and Security |
| url | https://arxiv.org/abs/2401.03204 |