Computing on the joint quadratic complexity of multiple periodic sequences
An algorithm for determining the joint quadratic complexity of the prescribed multiple periodic sequences over any finite field was presented by using the algorithm for computing the quadratic complexity of the prescribed single sequence proposed by Rizomiliotis and the methods for determining the s...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2012-06-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/1000-436X(2012)06-0011-08/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841539921431494656 |
|---|---|
| author | Li-hua DONG Yu-pu HU Yong ZENG |
| author_facet | Li-hua DONG Yu-pu HU Yong ZENG |
| author_sort | Li-hua DONG |
| collection | DOAJ |
| description | An algorithm for determining the joint quadratic complexity of the prescribed multiple periodic sequences over any finite field was presented by using the algorithm for computing the quadratic complexity of the prescribed single sequence proposed by Rizomiliotis and the methods for determining the solutions of the linear equations.The total processing time requirement is cubics function of the sequence length at most. |
| format | Article |
| id | doaj-art-c8028f98e8a34d4cb17fd0a515812695 |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2012-06-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-c8028f98e8a34d4cb17fd0a5158126952025-01-14T06:32:03ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2012-06-0133111859662595Computing on the joint quadratic complexity of multiple periodic sequencesLi-hua DONGYu-pu HUYong ZENGAn algorithm for determining the joint quadratic complexity of the prescribed multiple periodic sequences over any finite field was presented by using the algorithm for computing the quadratic complexity of the prescribed single sequence proposed by Rizomiliotis and the methods for determining the solutions of the linear equations.The total processing time requirement is cubics function of the sequence length at most.http://www.joconline.com.cn/zh/article/doi/1000-436X(2012)06-0011-08/cryptographystream cipherquadratic complexitymultiple sequences |
| spellingShingle | Li-hua DONG Yu-pu HU Yong ZENG Computing on the joint quadratic complexity of multiple periodic sequences Tongxin xuebao cryptography stream cipher quadratic complexity multiple sequences |
| title | Computing on the joint quadratic complexity of multiple periodic sequences |
| title_full | Computing on the joint quadratic complexity of multiple periodic sequences |
| title_fullStr | Computing on the joint quadratic complexity of multiple periodic sequences |
| title_full_unstemmed | Computing on the joint quadratic complexity of multiple periodic sequences |
| title_short | Computing on the joint quadratic complexity of multiple periodic sequences |
| title_sort | computing on the joint quadratic complexity of multiple periodic sequences |
| topic | cryptography stream cipher quadratic complexity multiple sequences |
| url | http://www.joconline.com.cn/zh/article/doi/1000-436X(2012)06-0011-08/ |
| work_keys_str_mv | AT lihuadong computingonthejointquadraticcomplexityofmultipleperiodicsequences AT yupuhu computingonthejointquadraticcomplexityofmultipleperiodicsequences AT yongzeng computingonthejointquadraticcomplexityofmultipleperiodicsequences |