Abstract

In this work, we present a new chaos-based cryptosystem scheme consisting of a noniterative plaintext transformation and a high dimensionally (K-map) populated dynamic Look-Up Table (LUT) with random access that outperforms the security and speed of previous LUT-based chaotic encryption schemes. Experimental analysis of the proposed scheme reveals excellent statistical properties, naturally extended permanent cycle, and high performance for real-time multimedia communications. Our scheme is one order of magnitude faster than the fastest LUT-based approach in the literature and robust to differential and chosen plaintext attacks.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call