k-error linear complexity of q-ary sequence of period p<sup>2</sup>
Based on element statistics in a matrix,a new efficient computing method for computing the k-error linear complexity of q-ary sequence of period p<sup>2</sup>was proposed,where p,q were odd primes and q modulo p<sup>2</sup>was primitive.A gener...
Saved in:
Main Authors: | , , |
---|---|
Format: | Article |
Language: | zho |
Published: |
Editorial Department of Journal on Communications
2019-12-01
|
Series: | Tongxin xuebao |
Subjects: | |
Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2019230/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
_version_ | 1841539329089863680 |
---|---|
author | Chenhuang WU Chunxiang XU Xiaoni DU |
author_facet | Chenhuang WU Chunxiang XU Xiaoni DU |
author_sort | Chenhuang WU |
collection | DOAJ |
description | Based on element statistics in a matrix,a new efficient computing method for computing the k-error linear complexity of q-ary sequence of period p<sup>2</sup>was proposed,where p,q were odd primes and q modulo p<sup>2</sup>was primitive.A general result and a concrete proof were showed.To verify the correctness of the result,two kinds of q-ary sequence of period p<sup>2</sup>were illustrated.Because the new method does not need iterative calculation and when it is implemented by program and compared with existing algorithms,the results show that the proposed new algorithm is significantly more efficient in calculating k-error linear complexity of q-ary sequence of period p<sup>2</sup>. |
format | Article |
id | doaj-art-1d0a4b52b24c496a9473a7e6aa35eb82 |
institution | Kabale University |
issn | 1000-436X |
language | zho |
publishDate | 2019-12-01 |
publisher | Editorial Department of Journal on Communications |
record_format | Article |
series | Tongxin xuebao |
spelling | doaj-art-1d0a4b52b24c496a9473a7e6aa35eb822025-01-14T07:18:00ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2019-12-0140212859730618k-error linear complexity of q-ary sequence of period p<sup>2</sup>Chenhuang WUChunxiang XUXiaoni DUBased on element statistics in a matrix,a new efficient computing method for computing the k-error linear complexity of q-ary sequence of period p<sup>2</sup>was proposed,where p,q were odd primes and q modulo p<sup>2</sup>was primitive.A general result and a concrete proof were showed.To verify the correctness of the result,two kinds of q-ary sequence of period p<sup>2</sup>were illustrated.Because the new method does not need iterative calculation and when it is implemented by program and compared with existing algorithms,the results show that the proposed new algorithm is significantly more efficient in calculating k-error linear complexity of q-ary sequence of period p<sup>2</sup>.http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2019230/stream cipherq-ary sequencek-error linear complexityFermat quotient sequence |
spellingShingle | Chenhuang WU Chunxiang XU Xiaoni DU k-error linear complexity of q-ary sequence of period p<sup>2</sup> Tongxin xuebao stream cipher q-ary sequence k-error linear complexity Fermat quotient sequence |
title | k-error linear complexity of q-ary sequence of period p<sup>2</sup> |
title_full | k-error linear complexity of q-ary sequence of period p<sup>2</sup> |
title_fullStr | k-error linear complexity of q-ary sequence of period p<sup>2</sup> |
title_full_unstemmed | k-error linear complexity of q-ary sequence of period p<sup>2</sup> |
title_short | k-error linear complexity of q-ary sequence of period p<sup>2</sup> |
title_sort | k error linear complexity of q ary sequence of period p sup 2 sup |
topic | stream cipher q-ary sequence k-error linear complexity Fermat quotient sequence |
url | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2019230/ |
work_keys_str_mv | AT chenhuangwu kerrorlinearcomplexityofqarysequenceofperiodpsup2sup AT chunxiangxu kerrorlinearcomplexityofqarysequenceofperiodpsup2sup AT xiaonidu kerrorlinearcomplexityofqarysequenceofperiodpsup2sup |