Secure Communication Scheme Based on Asymptotic Model of Deterministic Randomness

Abstract

We propose a new cryptosystem by combing the Lissajous map, which is the asymptotic model of deterministic randomness, with the one-way coupled map lattice (OCML) system. The key space, the encryption efficiency, and the security are investigated. We find that the parameter sensitivity can reach the computational precision when the system size is only three, all the lattice outputs can be treated as key stream parallelly, and the system is resistible against various attacks including the differential-like chosen cipher attack. The findings of this paper are a strong indication of the importance of deterministic randomness in secure communications.