Presentation 1999/6/22
A Cryptosystem Using Two Chaotic Maps
Motoi HARADA, Yoshifumi NISHIO, Akio USHIDA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Chaos has the characteristics that small variations of parameters make the results of recursive calculations quite different. In our past studies, cryptosystems used this characteristics on chaostic maps were proposed. These systems had the advantage of its simplicity. However, they had two disadvantages at the same time. One is that the maps used in the systems were piecewise-linear one, the other is that the ratio of the ciphertext size to the plaintext size becomes very large. The former makes the linear attack be possible and the latter makes the information efficioncy be bad. Therefore, in this study we try to overcome the two disadvantages by using two chotic maps in the system.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Chaotic Map / Secret Key Cryptosystem / Piecewise-linear / Information Efficiency
Paper # NLP99-31
Date of Issue

Conference Information
Committee NLP
Conference Date 1999/6/22(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Nonlinear Problems (NLP)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A Cryptosystem Using Two Chaotic Maps
Sub Title (in English)
Keyword(1) Chaotic Map
Keyword(2) Secret Key Cryptosystem
Keyword(3) Piecewise-linear
Keyword(4) Information Efficiency
1st Author's Name Motoi HARADA
1st Author's Affiliation Dept. of Electrical and Electronic Engineering, Tokushima University()
2nd Author's Name Yoshifumi NISHIO
2nd Author's Affiliation Dept. of Electrical and Electronic Engineering, Tokushima University
3rd Author's Name Akio USHIDA
3rd Author's Affiliation Dept. of Electrical and Electronic Engineering, Tokushima University
Date 1999/6/22
Paper # NLP99-31
Volume (vol) vol.99
Number (no) 134
Page pp.pp.-
#Pages 4
Date of Issue