The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Urutan pseudorandom dengan kerumitan linear yang besar boleh menahan serangan linear. Perwakilan surih memainkan peranan penting dalam analisis dan reka bentuk jujukan pseudorandom. Dalam surat ini, kami membentangkan pembinaan keluarga jujukan binari baharu yang diperoleh daripada modulo hasil bagi Euler pq, Di mana pq ialah hasil darab dua nombor perdana dan p membahagi q-1. Pertama, kerumitan linear jujukan disiasat. Dibuktikan bahawa jujukan mempunyai kerumitan linear yang lebih besar dan boleh menahan serangan algoritma Berlekamp-Massey. Kemudian, kami memberikan perwakilan surih bagi jujukan yang dicadangkan dengan menentukan pasangan penentu yang sepadan. Selain itu, kami umumkan hasilnya kepada modulo hasil Euler pmqn bersama m≤n. Keputusan menunjukkan bahawa jujukan umum masih mempunyai kerumitan linear yang tinggi. Kami juga memberikan gambaran surih bagi jujukan umum dengan menentukan pasangan penentu yang sepadan. Hasilnya akan membantu untuk pelaksanaan dan analisis sifat pseudorandom bagi jujukan.
Jiang MA
Yanshan University
Jun ZHANG
Tangshan Administration for Market Regulation
Yanguo JIA
Yanshan University
Xiumin SHEN
Yanshan University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Salinan
Jiang MA, Jun ZHANG, Yanguo JIA, Xiumin SHEN, "New Binary Sequences Derived from Euler Quotients Modulo pq and Their Generalizations" in IEICE TRANSACTIONS on Fundamentals,
vol. E106-A, no. 4, pp. 657-664, April 2023, doi: 10.1587/transfun.2022EAP1069.
Abstract: Pseudorandom sequences with large linear complexity can resist the linear attack. The trace representation plays an important role in analysis and design of pseudorandom sequences. In this letter, we present the construction of a family of new binary sequences derived from Euler quotients modulo pq, where pq is a product of two primes and p divides q-1. Firstly, the linear complexity of the sequences are investigated. It is proved that the sequences have larger linear complexity and can resist the attack of Berlekamp-Massey algorithm. Then, we give the trace representation of the proposed sequences by determining the corresponding defining pair. Moreover, we generalize the result to the Euler quotients modulo pmqn with m≤n. Results indicate that the generalized sequences still have high linear complexity. We also give the trace representation of the generalized sequences by determining the corresponding defining pair. The result will be helpful for the implementation and the pseudorandom properties analysis of the sequences.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2022EAP1069/_p
Salinan
@ARTICLE{e106-a_4_657,
author={Jiang MA, Jun ZHANG, Yanguo JIA, Xiumin SHEN, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={New Binary Sequences Derived from Euler Quotients Modulo pq and Their Generalizations},
year={2023},
volume={E106-A},
number={4},
pages={657-664},
abstract={Pseudorandom sequences with large linear complexity can resist the linear attack. The trace representation plays an important role in analysis and design of pseudorandom sequences. In this letter, we present the construction of a family of new binary sequences derived from Euler quotients modulo pq, where pq is a product of two primes and p divides q-1. Firstly, the linear complexity of the sequences are investigated. It is proved that the sequences have larger linear complexity and can resist the attack of Berlekamp-Massey algorithm. Then, we give the trace representation of the proposed sequences by determining the corresponding defining pair. Moreover, we generalize the result to the Euler quotients modulo pmqn with m≤n. Results indicate that the generalized sequences still have high linear complexity. We also give the trace representation of the generalized sequences by determining the corresponding defining pair. The result will be helpful for the implementation and the pseudorandom properties analysis of the sequences.},
keywords={},
doi={10.1587/transfun.2022EAP1069},
ISSN={1745-1337},
month={April},}
Salinan
TY - JOUR
TI - New Binary Sequences Derived from Euler Quotients Modulo pq and Their Generalizations
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 657
EP - 664
AU - Jiang MA
AU - Jun ZHANG
AU - Yanguo JIA
AU - Xiumin SHEN
PY - 2023
DO - 10.1587/transfun.2022EAP1069
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E106-A
IS - 4
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - April 2023
AB - Pseudorandom sequences with large linear complexity can resist the linear attack. The trace representation plays an important role in analysis and design of pseudorandom sequences. In this letter, we present the construction of a family of new binary sequences derived from Euler quotients modulo pq, where pq is a product of two primes and p divides q-1. Firstly, the linear complexity of the sequences are investigated. It is proved that the sequences have larger linear complexity and can resist the attack of Berlekamp-Massey algorithm. Then, we give the trace representation of the proposed sequences by determining the corresponding defining pair. Moreover, we generalize the result to the Euler quotients modulo pmqn with m≤n. Results indicate that the generalized sequences still have high linear complexity. We also give the trace representation of the generalized sequences by determining the corresponding defining pair. The result will be helpful for the implementation and the pseudorandom properties analysis of the sequences.
ER -