Matrix based asymmetric bulk encryption algorithm

This paper discusses a matrix based asymmetric bulk encryption algorithm. The security of the proposed algorithm is based on difficulty in factoring a composite integer into its component primes. We also propose a method to maintain the atomicity of the whole message to thwart all attacks based on any partial knowledge about the message. The novel part of the discussed public key encryption algorithm is that it is many times faster than the existing RSA public key algorithm for large messages. In the trivial case of 1×1 matrices it reduces to the RSA public key encryption algorithm.