嵌入压缩功能到混乱加密法.pptVIP

* Embedding Compression in Chaos-Based Cryptography嵌入壓縮功能到混亂加密法 IEEE Transactions on Circuits and Systems—II: Express Briefs, VOL. 55, NO. 11, NOV. 2008 Kwok-Wo Wong, Senior Member, IEEE, and Ching-Hung Yuen Adviser：鄭錦楸,郭文中 教授 Reporter：林彥宏 * Outline Introduction Proposed Approach Encryption Procedures Decryption Procedures Simulation Results Conclusions * Introduction(1/4) Entropy coding Arithmetic coding Huffman coding Baptista-type Chaotic cryptosystem One-Dimensional Logistic Map: * Introduction(3/4) trajectory * Introduction(2/4) S S-1 S-2 S-3 . . . 4 3 2 1 % a b c $ # @ . Alphabet unit Sit number Spacing position * Introduction(4/4) * Proposed Approach Number of Occurrence for Symbol Map Function Search Mode Mask Mode Huffman Tree Regenerate Chaotic Trajectory Extract Mask Bit Find Out Iteration Number Lookup Table Encryption Decryption Mask Intermediate Sequence * Proposed Approach (A,B,C,D)=(0.5 , 0.25 , 0.125 , 0.125) phase space [0 , 1] is divided into 256 partitions A=128 B=64 C=32 D=32 * Proposed Approach more probable symbols are encrypted by searching in the dynamic lookup table less probable symbols are masked by a pseudorandom bitstream * Encryption Procedures Step1) Scan the whole plaintext sequence once Step2) . . . . . 0 1 * Encryption Procedures Step3) encrypt each plaintext symbol sequentially if the number of iterations required is smaller than a preselected maximum value, this symbol is considered as encrypted by the search mode; Otherwise, it will be encrypted by the mask mode eight masking bits are extracted from the least significant byte of the chaotic map output: Step4) after all the plaintext blocks have been processed, a Huffman tree is built for all the collected number of iterations, including zero if intermediate sequence exceeds the plaintext length, this means that no compression is achieved at all; encrypted by the all-mask mod