透過您的圖書館登入
IP:18.216.205.123
  • 期刊

2-Adic Complexity of Sequences Generated by T-Functions

摘要


Single cycle T-functions are cryptographic primitives which can generate maximum periodic sequences. 2-Adic complexity of a sequence measures the difficulty of out- putting a binary sequence using a feedback with carry shift register. Based on the special properties of single cycle T-functions, this paper investigates the 2-adic complexity of sequences generated by single cycle T-functions from the kth coordinate sequence to the state output sequence using the primality of Fermat number. It is shown that the state output sequence of a T-function is far from high 2-adic complexity.

延伸閱讀