Winternitz signatures for 32-byte messages.

A wrapper for the stack types to print them better.

Winternitz signatures for 16-byte messages.

Define the AffinePairing trait for our affine mode operations

Winternitz signature verification using binary search. ## Verification Algorithm Simulates a for loop of hashing using binary search on the digit.

Create a struct to implement AffinePairing

Winternitz signature verification using brute force. ## Verification Algorithm Tries each possible digit value. ## Signature Format - `hash(digit[

High-level functionality for working with compact Winternitz signatures. Compact signatures contain the signature of each digit, but not the digit it

Converts the message on the stack after signature verification.