引进了弱n-adic集映射和具有全n-adic集系统的概念,讨论了弱n-adic集映射具有正拓扑熵条件和具有全n-adic集系统在回复性上的混沌性。证明了n不是2的倍数的n-adic系统是Devaney混沌的,Wiggins混沌的,按序列分布混沌的,分布混沌的,Marte...引进了弱n-adic集映射和具有全n-adic集系统的概念,讨论了弱n-adic集映射具有正拓扑熵条件和具有全n-adic集系统在回复性上的混沌性。证明了n不是2的倍数的n-adic系统是Devaney混沌的,Wiggins混沌的,按序列分布混沌的,分布混沌的,Martelli’s混沌的,ω混沌的,Block and cop-ple混沌的。展开更多
Complexity measures for keystream multisequences over Z/(N) play a crucial role in designing good stream cipher systems. This correspondence shows a general upper bound on k-error joint N-adic complexity of periodic m...Complexity measures for keystream multisequences over Z/(N) play a crucial role in designing good stream cipher systems. This correspondence shows a general upper bound on k-error joint N-adic complexity of periodic multisequences over Z/(N), and establishes the existence of periodic N-adic multisequences over Z/(N) which simultaneously possess maximal joint N-adic complexity and large k-error joint N-adic complexity. Under some conditions the overwhelming majority of all T-periodic N-adic multisequences over Z/(N) with maximal joint N-adic complexity logN(NT- 1)have a k-error joint N-adic complexity close to logN(NT- 1).展开更多
文摘引进了弱n-adic集映射和具有全n-adic集系统的概念,讨论了弱n-adic集映射具有正拓扑熵条件和具有全n-adic集系统在回复性上的混沌性。证明了n不是2的倍数的n-adic系统是Devaney混沌的,Wiggins混沌的,按序列分布混沌的,分布混沌的,Martelli’s混沌的,ω混沌的,Block and cop-ple混沌的。
基金supported by the National Natural Science Foundation of China under Grant Nos.61271271 and 61370089100 Talents Program of Chinese Academy of Sciencethe Fundamental Research Funds for the Central Universities under Grant No.2012HGBZ0622
文摘Complexity measures for keystream multisequences over Z/(N) play a crucial role in designing good stream cipher systems. This correspondence shows a general upper bound on k-error joint N-adic complexity of periodic multisequences over Z/(N), and establishes the existence of periodic N-adic multisequences over Z/(N) which simultaneously possess maximal joint N-adic complexity and large k-error joint N-adic complexity. Under some conditions the overwhelming majority of all T-periodic N-adic multisequences over Z/(N) with maximal joint N-adic complexity logN(NT- 1)have a k-error joint N-adic complexity close to logN(NT- 1).
