A fast chaotic cryptographic scheme with dynamic look-up table

K. W. Wong

    Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

    195 Citations (Scopus)

    Abstract

    We propose a fast chaotic cryptographic scheme based on iterating a logistic map. In particular, no random numbers need to be generated and the look-up table used in the cryptographic process is updated dynamically. Simulation results show that the proposed method leads to a substantial reduction in the encryption and decryption time. As a result, chaotic cryptography becomes more practical in the secure transmission of large multi-media files over public data communication network. © 2002 Elsevier Science B.V. All rights reserved.
    Original languageEnglish
    Pages (from-to)238-242
    JournalPhysics Letters, Section A: General, Atomic and Solid State Physics
    Volume298
    Issue number4
    DOIs
    Publication statusPublished - 10 Jun 2002

    Research Keywords

    • Chaos
    • Cryptography
    • Fast algorithm
    • Logistic map

    Fingerprint

    Dive into the research topics of 'A fast chaotic cryptographic scheme with dynamic look-up table'. Together they form a unique fingerprint.

    Cite this