Hash Based Encryption Schemes Using Physically Unclonable Functions.

In recent years public key cryptography has been revolutionary developed in cryptosystems. Algorithms such as RSA, ECC and DSA are commonly used as public key cryptography in a variety of applications. The drawback of these protocols is vulnerability against quantum computing. These protocols rely on the computational hardness of finding factorization but Peter Shor has proved that quantum computing can break all the public key cryptosystems that are relying on this factorization. Hash-Based Cryptography has been subject of debates for past few decades since it is known to be resistant to quantum computer attacks and there have been some advancements over this field. But all the available methods are concentrated on the digital signature schemes. None of them have the ability to encrypt and decrypt a plain text. This paper will describe some methods that can be used as encryption and decryption of plain text using hash functions.