TY - JOUR

T1 - Relation between the irreducible polynomials that generates the same binary sequence over odd characteristic field

AU - Ali, Md Arshad

AU - Kodera, Yuta

AU - Park, Taehwan

AU - Kusaka, Takuya

AU - Nogmi, Yasuyuki

AU - Kim, Howon

N1 - Funding Information:
This work has been supported by JSPS KAKENHI Grantin-Aid for Scientific Research (A) Number 16H01723 and the Ministry of Science and ICT (MSIT), Korea, under the Information Technology Research Center support program (No. IITP-2017-2014-1-00743) supervised by the Institute for Information & Communications Technology Promotion (IITP).

PY - 2018

Y1 - 2018

N2 - A pseudo-random sequence generated by using a primitive polynomial, trace function, and Legendre symbol has been researched in our previous work. Our previous sequence has some interesting features such as period, autocorrelation, and linear complexity. A pseudo-random sequence widely used in cryptography. However, from the aspect of the practical use in cryptographic systems sequence needs to generate swiftly. Our previous sequence generated by utilizing a primitive polynomial, however, finding a primitive polynomial requires high calculating cost when the degree or the characteristic is large. It's a shortcoming of our previous work. The main contribution of this work is to find some relation between the generated sequence and irreducible polynomials. The purpose of this relationship is to generate the same sequence without utilizing a primitive polynomial. From the experimental observation, it is found that there are (p - 1)/2 kinds of polynomial, which generates the same sequence. In addition, some of these polynomials are non-primitive polynomial. In this paper, these relationships between the sequence and the polynomials are shown by some examples. Furthermore, these relationships are proven theoretically also.

AB - A pseudo-random sequence generated by using a primitive polynomial, trace function, and Legendre symbol has been researched in our previous work. Our previous sequence has some interesting features such as period, autocorrelation, and linear complexity. A pseudo-random sequence widely used in cryptography. However, from the aspect of the practical use in cryptographic systems sequence needs to generate swiftly. Our previous sequence generated by utilizing a primitive polynomial, however, finding a primitive polynomial requires high calculating cost when the degree or the characteristic is large. It's a shortcoming of our previous work. The main contribution of this work is to find some relation between the generated sequence and irreducible polynomials. The purpose of this relationship is to generate the same sequence without utilizing a primitive polynomial. From the experimental observation, it is found that there are (p - 1)/2 kinds of polynomial, which generates the same sequence. In addition, some of these polynomials are non-primitive polynomial. In this paper, these relationships between the sequence and the polynomials are shown by some examples. Furthermore, these relationships are proven theoretically also.

KW - Irreducible polynomial

KW - Legendre symbol

KW - Odd characteristic field

KW - Pseudo-random sequence

KW - Trace function

UR - http://www.scopus.com/inward/record.url?scp=85055900483&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85055900483&partnerID=8YFLogxK

U2 - 10.6109/jicce.2018.16.3.166

DO - 10.6109/jicce.2018.16.3.166

M3 - Article

AN - SCOPUS:85055900483

VL - 16

SP - 166

EP - 172

JO - Journal of Information and Communication Convergence Engineering

JF - Journal of Information and Communication Convergence Engineering

SN - 2234-8255

IS - 3

ER -