Linear Complexity of New Binary Sequence Derived From Polynomial Quotients Modulo p in General Case and Their Generalizations
Pseudorandom sequences with large linear complexity have been widely applied in electronic countermeasures, mobile communication and cryptography. Linear complexity is considered as a primary security criterion to measure the unpredictability of pseudorandom sequences. This paper presents the linear...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2022-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/9866754/ |
| _version_ | 1811204008548761600 |
|---|---|
| author | Jiang Ma Jun Zhang Yanguo Jia Xiumin Shen |
| author_facet | Jiang Ma Jun Zhang Yanguo Jia Xiumin Shen |
| author_sort | Jiang Ma |
| collection | DOAJ |
| description | Pseudorandom sequences with large linear complexity have been widely applied in electronic countermeasures, mobile communication and cryptography. Linear complexity is considered as a primary security criterion to measure the unpredictability of pseudorandom sequences. This paper presents the linear complexity and minimal polynomial of a new family of binary sequences derived from polynomial quotients modulo an odd prime <inline-formula> <tex-math notation="LaTeX">$p$ </tex-math></inline-formula> in general case. The results indicate that the sequences have high linear complexity, which means they can resist the linear attack against pseudo-noise or stream ciphers. Moreover, we generalize the result to the polynomial quotients modulo a power of <inline-formula> <tex-math notation="LaTeX">$p$ </tex-math></inline-formula> in general case. Finally, we design a Gpqs stream cipher generator based on the generalized binary pseudorandom sequences to implement the sequences in hardware. |
| first_indexed | 2024-04-12T03:04:31Z |
| format | Article |
| id | doaj.art-ef39793c480142ad820b9beb046588ef |
| institution | Directory Open Access Journal |
| issn | 2169-3536 |
| language | English |
| last_indexed | 2024-04-12T03:04:31Z |
| publishDate | 2022-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj.art-ef39793c480142ad820b9beb046588ef2022-12-22T03:50:33ZengIEEEIEEE Access2169-35362022-01-0110988559885910.1109/ACCESS.2022.32014979866754Linear Complexity of New Binary Sequence Derived From Polynomial Quotients Modulo p in General Case and Their GeneralizationsJiang Ma0https://orcid.org/0000-0001-6994-0533Jun Zhang1Yanguo Jia2https://orcid.org/0000-0003-0249-7869Xiumin Shen3School of Information Science and Engineering, Yanshan University, Qinhuangdao, ChinaTangshan Administration for Market Regulation, Tangshan Institute of Measurement Test, Tangshan, ChinaSchool of Information Science and Engineering, Yanshan University, Qinhuangdao, ChinaSchool of Information Science and Engineering, Yanshan University, Qinhuangdao, ChinaPseudorandom sequences with large linear complexity have been widely applied in electronic countermeasures, mobile communication and cryptography. Linear complexity is considered as a primary security criterion to measure the unpredictability of pseudorandom sequences. This paper presents the linear complexity and minimal polynomial of a new family of binary sequences derived from polynomial quotients modulo an odd prime <inline-formula> <tex-math notation="LaTeX">$p$ </tex-math></inline-formula> in general case. The results indicate that the sequences have high linear complexity, which means they can resist the linear attack against pseudo-noise or stream ciphers. Moreover, we generalize the result to the polynomial quotients modulo a power of <inline-formula> <tex-math notation="LaTeX">$p$ </tex-math></inline-formula> in general case. Finally, we design a Gpqs stream cipher generator based on the generalized binary pseudorandom sequences to implement the sequences in hardware.https://ieeexplore.ieee.org/document/9866754/Pseudorandom sequenceselectronic countermeasuresstream cipherlinear complexitypolynomial quotients |
| spellingShingle | Jiang Ma Jun Zhang Yanguo Jia Xiumin Shen Linear Complexity of New Binary Sequence Derived From Polynomial Quotients Modulo p in General Case and Their Generalizations IEEE Access Pseudorandom sequences electronic countermeasures stream cipher linear complexity polynomial quotients |
| title | Linear Complexity of New Binary Sequence Derived From Polynomial Quotients Modulo p in General Case and Their Generalizations |
| title_full | Linear Complexity of New Binary Sequence Derived From Polynomial Quotients Modulo p in General Case and Their Generalizations |
| title_fullStr | Linear Complexity of New Binary Sequence Derived From Polynomial Quotients Modulo p in General Case and Their Generalizations |
| title_full_unstemmed | Linear Complexity of New Binary Sequence Derived From Polynomial Quotients Modulo p in General Case and Their Generalizations |
| title_short | Linear Complexity of New Binary Sequence Derived From Polynomial Quotients Modulo p in General Case and Their Generalizations |
| title_sort | linear complexity of new binary sequence derived from polynomial quotients modulo p in general case and their generalizations |
| topic | Pseudorandom sequences electronic countermeasures stream cipher linear complexity polynomial quotients |
| url | https://ieeexplore.ieee.org/document/9866754/ |
| work_keys_str_mv | AT jiangma linearcomplexityofnewbinarysequencederivedfrompolynomialquotientsmodulopingeneralcaseandtheirgeneralizations AT junzhang linearcomplexityofnewbinarysequencederivedfrompolynomialquotientsmodulopingeneralcaseandtheirgeneralizations AT yanguojia linearcomplexityofnewbinarysequencederivedfrompolynomialquotientsmodulopingeneralcaseandtheirgeneralizations AT xiuminshen linearcomplexityofnewbinarysequencederivedfrompolynomialquotientsmodulopingeneralcaseandtheirgeneralizations |