Some chaotic sequences generated from maps conjugated with tent map can be reconstructed precisely by short sequence prediction,since the problem of finite precision degrades the statistical properties of chaotic ma...Some chaotic sequences generated from maps conjugated with tent map can be reconstructed precisely by short sequence prediction,since the problem of finite precision degrades the statistical properties of chaotic maps.This paper discusses the topological conjugation properties of the chaotic maps;analyzes in detail the reconstruction process of the chaotic sequences and the security of the oversampled chaotic map (OSCM) binary sequences.The result demonstrates that OSCM binary sequences can sustain the attack of the short sequence prediction,that is,they cant be reconstructed.Furthermore,all attack strategies aiming at the chaotic systems based on synchronization will fail,meaning that they are secure.展开更多
This paper deals with the locallyβ-convex analysis that generalizes the locally convex analysis. The second separation theorem in locallyβ-convex spaces, the Minkowski theorem and the Krein-Milman theorem in theβ-c...This paper deals with the locallyβ-convex analysis that generalizes the locally convex analysis. The second separation theorem in locallyβ-convex spaces, the Minkowski theorem and the Krein-Milman theorem in theβ-convex analysis are given. Moreover, it is obtained that the U F-boundedness and the U B-boundedness in its conjugate cone are equivalent if and only if X is subcomplete.展开更多
文摘Some chaotic sequences generated from maps conjugated with tent map can be reconstructed precisely by short sequence prediction,since the problem of finite precision degrades the statistical properties of chaotic maps.This paper discusses the topological conjugation properties of the chaotic maps;analyzes in detail the reconstruction process of the chaotic sequences and the security of the oversampled chaotic map (OSCM) binary sequences.The result demonstrates that OSCM binary sequences can sustain the attack of the short sequence prediction,that is,they cant be reconstructed.Furthermore,all attack strategies aiming at the chaotic systems based on synchronization will fail,meaning that they are secure.
文摘This paper deals with the locallyβ-convex analysis that generalizes the locally convex analysis. The second separation theorem in locallyβ-convex spaces, the Minkowski theorem and the Krein-Milman theorem in theβ-convex analysis are given. Moreover, it is obtained that the U F-boundedness and the U B-boundedness in its conjugate cone are equivalent if and only if X is subcomplete.
