| 摘要 |
The invention relates to an algorithm and inverse algorithm for lossless and fully reversible non-entropic data decompression and compression respectively. The algorithm, named the "PIAT Algorithm", finds and manipulates the coefficients of polynomials. It starts with an initial or generator polynomial and governs the generation of associated polynomials of increasing degree. For decompression, coefficients of the initial polynomial are arranged in an ordered set and are used as an input to the algorithm which then generates a first increased ordered set of coefficients. An inverse technique is used for compression (the "inverse PIAT algorithm"). Multiple cycles of the algorithm can be effected to give higher compression/decompression rates. An index may be used to indicate the compression level, i.e, the number of cycles performed. The algorithm is independent of the form of the data, provides increased security and can be performed at high speed. Also disclosed is a system for cyclic encryption that makes use of prime numbers. |
