Presentation 2015-04-23
Complexity in chaotic time series subject to augmented Lorenz equations
Kenichiro Cho, Takaya Miyano,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Augmented Lorenz equations are expressed as a star network of N Lorenz subsystems sharing the scalar variable X as the central node. We evaluate the complexity in chaotic time series subject to the augmented Lorenz equations in terms of the degree of visible determinism, i.e., the degree of parallelness of neighboring trajectories in phase space. The determinism underlying the chaotic time series becomes less visible when N increases. In particular, the determinism in the time series of the matrix variable Y is as invisible as that of uncorrelated white noise. In this report, we discuss the degree of security for the one-time-pad cryptographic method using pseudorandom numbers sampled from the chaotic time series.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Augmented Lorenz equations / parallelness of neighboring trajectories / pseudorandom numbers / one-time pad cryptography
Paper # NLP2015-6
Date of Issue 2015-04-16 (NLP)

Conference Information
Committee NLP
Conference Date 2015/4/23(2days)
Place (in Japanese) (See Japanese page)
Place (in English) Kagawa Social Welfare Center
Topics (in Japanese) (See Japanese page)
Topics (in English) Nonlinear Problems, etc.
Chair Kenya Jinno(Nippon Inst. of Tech.)
Vice Chair Naoto Fujisaka(Hiroshima City Univ.)
Secretary Naoto Fujisaka(Tokyo Univ. of Science)
Assistant Hidehiro Nakano(Tokyo City Univ.) / Hiroyuki Asahara(Okayama Univ. of Science)

Paper Information
Registration To Technical Committee on Nonlinear Problems
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Complexity in chaotic time series subject to augmented Lorenz equations
Sub Title (in English)
Keyword(1) Augmented Lorenz equations
Keyword(2) parallelness of neighboring trajectories
Keyword(3) pseudorandom numbers
Keyword(4) one-time pad cryptography
1st Author's Name Kenichiro Cho
1st Author's Affiliation Ritsumeikan Univercity(Ritsumeikan Univ)
2nd Author's Name Takaya Miyano
2nd Author's Affiliation Ritsumeikan Univercity(Ritsumeikan Univ)
Date 2015-04-23
Paper # NLP2015-6
Volume (vol) vol.115
Number (no) NLP-14
Page pp.pp.23-26(NLP),
#Pages 4
Date of Issue 2015-04-16 (NLP)