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
선형 복잡도가 큰 의사 난수 시퀀스는 선형 공격에 저항할 수 있습니다. 추적 표현은 의사 난수 시퀀스의 분석 및 설계에 중요한 역할을 합니다. 이 편지에서 우리는 오일러 몫 모듈로에서 파생된 새로운 이진 시퀀스 계열의 구성을 제시합니다. pq어디로 pq 는 두 소수의 곱이고 p 나누다 q-1. 첫째, 시퀀스의 선형 복잡도를 조사합니다. 시퀀스의 선형 복잡성이 더 크고 Berlekamp-Massey 알고리즘의 공격에 저항할 수 있다는 것이 입증되었습니다. 그런 다음 해당 정의 쌍을 결정하여 제안된 시퀀스의 추적 표현을 제공합니다. 또한 결과를 오일러 지수 모듈로로 일반화합니다. pmqn 과 m≤n. 결과는 일반화된 시퀀스가 여전히 높은 선형 복잡성을 가지고 있음을 나타냅니다. 또한 해당 정의 쌍을 결정하여 일반화된 시퀀스의 추적 표현을 제공합니다. 결과는 시퀀스의 구현 및 의사 난수 속성 분석에 도움이 될 것입니다.
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.
부
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
부
@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},}
부
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 -