TY - GEN
T1 - Boundary for the Linear Complexity of Well Balanced NTU
AU - Kodera, Yuta
AU - Kusaka, Takuya
AU - Nogami, Yasuyuki
N1 - Funding Information:
ACKNOWLEDGEMENT This work was partly supported by JSPS KAKENHI Grant-in-Aid for Scientific Research (A) 16H01723.
PY - 2019/5
Y1 - 2019/5
N2 - A pseudorandom sequence has an inseparable role in various types of security applications. Especially, the linear complexity of a sequence is a measure of the randomness that should be large for secureness of a system. This paper considers the boundary of linear complexity of a geometric sequence called NTU sequence which is generated with a uniformization technique.
AB - A pseudorandom sequence has an inseparable role in various types of security applications. Especially, the linear complexity of a sequence is a measure of the randomness that should be large for secureness of a system. This paper considers the boundary of linear complexity of a geometric sequence called NTU sequence which is generated with a uniformization technique.
UR - http://www.scopus.com/inward/record.url?scp=85080110437&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85080110437&partnerID=8YFLogxK
U2 - 10.1109/ICCE-TW46550.2019.8992029
DO - 10.1109/ICCE-TW46550.2019.8992029
M3 - Conference contribution
AN - SCOPUS:85080110437
T3 - 2019 IEEE International Conference on Consumer Electronics - Taiwan, ICCE-TW 2019
BT - 2019 IEEE International Conference on Consumer Electronics - Taiwan, ICCE-TW 2019
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 6th IEEE International Conference on Consumer Electronics - Taiwan, ICCE-TW 2019
Y2 - 20 May 2019 through 22 May 2019
ER -