1. One Time Signature

2. Introduction AKA Lamport Signature Use secure hash function
Potential development if quantum computer threatens the security of RSA and other common form of cryptography
Lamport Signature with large hash function would still be secure in that event

3. The algorithm Making of key pair Signing the Message
Verifying the Signature

4. Making of Key pair
Alice uses RNG to produce 256 pairs of random number, each being 265 bit in size. This is the private key.
Hash each private key to get public key.
Note that we use 256-bit hash function

5. Signing the message Hash message to get 256 bit hash sum.
For each bit pick one number from the corresponding pairs private key (i.e., if the bit is 0, the first number is chosen, and if the bit is 1, the second is chosen).
These sequence of 256 random number (each of 256 bit length) is digital signature .
Publish along with message
Destroy the private key, never use same private key again.

6. Verify the signature Hash message to get 256-bit hash sum.
Use bits in hash to pick out 256 of hashes in public key.
Hash each of 256 random number in signature.
If these 256 hashes exactly match the 256 hashes he just picked from Alice's public key then the signature is ok. If not, then the signature is wrong.

8. The End