Trial encoding algorithms ensemble

Abstract

This paper proposes trial algorithms for some basic components in cryptography and lossless bit compression. The symmetric encryption is accomplished by mixing up randomizations and scrambling with hashing of the key playing an essential role. The asymmetric encryption is a straight extension of the Hill cipher by turning symmetric homomorphic encryption into a public key scheme. Also viable are asymmetric homomorphic encryption and secure twoparty computation. The digital signature is adapted from the Hill cipher with the verification key matrices incorporating un-invertible parts to hide the signature matrix. The simplicity of key generation may facilitate easier key management. The hash is a straight running summation (addition chain) of data bytes plus some randomization. One simplified version can be burst error correcting code. The lossless bit compressor is the Shannon-Fano coding that is less optimal than the later Huffman and Arithmetic coding, but can be conveniently implemented without the use of a tree structure and improvable with bytes concatenation. © 2013 Cheng and Yeh.