Papers

2018

Evaluating the Maximum Order Complexity of a Uniformly distributed Sequence over Odd Characteristic

2018 IEEE INTERNATIONAL CONFERENCE ON CONSUMER ELECTRONICS-TAIWAN (ICCE-TW)
  • Yuta Kodera
  • ,
  • Takuya Kusaka
  • ,
  • Takeru Miyazaki
  • ,
  • Yasuyuki Nogami
  • ,
  • Satoshi Uehara
  • ,
  • Robert H. Morelos-Zaragoza

Language
English
Publishing type
Research paper (international conference proceedings)
Publisher
IEEE

This paper focuses on the Maximum Order Complexity of a pseudorandom sequence for security applications called NTU sequence. It shows the maximum feature on the nonlinear property and several properties have been theoretically proven. However, the NTU sequence requires a uniformization technique to overcome the drawback on its bits distribution. The technique has already proposed but the non-liear feature still has not investigated. Therefore, this paper evaluates the affects on the non-linear feature of the original NTU sequence by using Maximum Order Complexity.

Link information
Web of Science
https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=JSTA_CEL&SrcApp=J_Gate_JST&DestLinkType=FullRecord&KeyUT=WOS:000454897600134&DestApp=WOS_CPL
ID information
  • ISSN : 2381-5779
  • Web of Science ID : WOS:000454897600134

Export
BibTeX RIS