Hash-based encryption system
This paper describes a symmetric-key encryption algorithm based on a use of an underlying one-way hash function. The strength of this encryption algorithm depends on security of a one-way hash function. It is computationally more efficient and, most importantly, more secure than using traditional symmetric encryption tools such as DES. The algorithm can be further enhanced by using the services of a random number generator. This random number generator does not have to be shared between the parties involved, so it can be a strong random number generator, not a pseudo-random one. Our scheme also has the forward and backward secrecy properties; that is, if a particular message is somehow decrypted by an attacker, it will not affect the security of messages sent before and after it. The algorithm itself is very simple and can be implemented in either software or hardware. In short, the proposed scheme has all the desired properties of a one-time pad encryption algorithm and solves the problem of safely transmitting the pads from one party to another. The described method has a potential positive impact on several cryptographic standards, especially since some standards are going through a review because of the recently published reports of successful attacks on DES.
encryption hash function random number generator symmetric key public key