1. Research Title:Analysis of Advanced Cryptography Technologies Hash-based Post-quantum One-time Digital Signature Schemes Dr. Douglas Stebila Kaan Osmanagaoglu

2. Executive Summary A signature, as a proof of identity and intent, can consist of a handwritten or a digital mark for integrity purposes. The latest technology improves the scope widely, improves and makes it possible to sign multiple electronic documents with “One Time Signature” and “Merkle Tree Signature” schemes.

3. Digital Signatures

4. Integrity In many scenarios, the sender and receiver of a message may have a need for confidence that the message has not been altered during transmission. Authentication Although messages may often include information about the entity sending a message, that information may not be accurate. Digital signatures can be used to authenticate the source of messages. The importance of high confidence in sender authenticity is especially obvious in a financial context. For example, suppose a bank's branch office sends instructions to the central office requesting a change in the balance of an account. If the central office is not convinced that such a message is truly sent from an authorized source, acting on such a request could be a grave mistake.

5. 3 Main Schemes LD (Lamport & Diffie) In cryptography, a Lamport signature or Lamport one-time signature scheme is a method for constructing a digital signature. Lamport signatures can be built from any cryptographically secure one-way function; usually a cryptographic hash function is used.cryptographydigital signatureone-way functioncryptographic hash function

6. Winternitz Merkle’s Authentication Tree In cryptography and computer science a hash tree or Merkle tree is a tree in which every non-leaf node is labelled with the hash of the labels of its children nodes. Hash trees are useful because they allow efficient and secure verification of the contents of larger data structures. Hash trees are a generalization of hash lists and hash chains.cryptographycomputer sciencehashhash listshash chains

8. Further possible upgrades Fig. 5. (Left) The height of the Merkle tree is H, and thus, the number of leaves is N =2 H. The height of each subtree is h. The altitude A ( t 1 ) and A ( t 2 ) of the subtrees t 1 and t 2 is marked. (Right) Instead of storing all tree nodes, we store a smaller set hose within the stacked subtrees. The leaf whose pre-image will be output next is contained in the lowest-most subtree; the entire authentication path is contained in the stacked set of subtrees.

10. Current Progress