Abstract

The idea behind Lempel-Ziv (LZ) data compression algorithm and Yacobi fast exponentiation algorithm is investigated. Also based on the fulfillment of the fast cascade exponentiation algorithm, a novel method is proposed to obtain rational tradeoff between memory size and fast computing speed by modifying the process of creating compression tree in Yacobi algorithm. The analysis shows that this new algorithm is suitable for fast computation in embedded encryption systems.

Full Text
Published version (Free)

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