TY - GEN
T1 - Binary sequence generated by alternative trace map function and its properties
AU - Akhter, Fatema
AU - Nogami, Yasuyuki
AU - Kusaka, Takuya
AU - Taketa, Yuki
AU - Tatara, Tomoya
N1 - Publisher Copyright:
© 2019 IEEE.
PY - 2019/11
Y1 - 2019/11
N2 - In this paper, we propose a new pseudo random binary sequence generated from a primitive polynomial over an extension field. The sequence has maximum period and high linear complexity suitable for security applications. While generation, a new mapping function is proposed which is faster than conventional trace map and translates extension field elements to prime field elements. The output of mapping function is a p-ary sequence with elements 0~ (p-1) that is balanced in pattern distribution and has ideal autocorrelation. Then, a binarization method is utilized to derive binary sequence from p-ary sequence. Period, autocorrelation, linear complexity and computation time of the proposed sequence are studied and experimental results are presented. Finally, the efficiency of the proposal is verified by comparing with existing sequences in terms of period, linear complexity and generation time for sequences of different length.
AB - In this paper, we propose a new pseudo random binary sequence generated from a primitive polynomial over an extension field. The sequence has maximum period and high linear complexity suitable for security applications. While generation, a new mapping function is proposed which is faster than conventional trace map and translates extension field elements to prime field elements. The output of mapping function is a p-ary sequence with elements 0~ (p-1) that is balanced in pattern distribution and has ideal autocorrelation. Then, a binarization method is utilized to derive binary sequence from p-ary sequence. Period, autocorrelation, linear complexity and computation time of the proposed sequence are studied and experimental results are presented. Finally, the efficiency of the proposal is verified by comparing with existing sequences in terms of period, linear complexity and generation time for sequences of different length.
KW - Autocorrelation
KW - Finite field
KW - Linear complexity
KW - Mapping function
KW - Primitive polynomial
KW - Pseudo random sequence
UR - http://www.scopus.com/inward/record.url?scp=85078841888&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85078841888&partnerID=8YFLogxK
U2 - 10.1109/CANDARW.2019.00076
DO - 10.1109/CANDARW.2019.00076
M3 - Conference contribution
AN - SCOPUS:85078841888
T3 - Proceedings - 2019 7th International Symposium on Computing and Networking Workshops, CANDARW 2019
SP - 408
EP - 411
BT - Proceedings - 2019 7th International Symposium on Computing and Networking Workshops, CANDARW 2019
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 7th International Symposium on Computing and Networking Workshops, CANDARW 2019
Y2 - 26 November 2019 through 29 November 2019
ER -