Winternitz signature verification using brute force. ## Verification Algorithm Tries each possible digit value. ## Signature Format - `hash(digit[0])` - `hash(digit[1])` - ... - `hash(digit[n + m - 1])` There are `n` message digits followed by `m` checksum digits. ## Approximate Max Stack Depth Used During Verification `total_length()`
| 426 | /// |
| 427 | /// `total_length()` |
| 428 | pub struct BruteforceVerifier {} |
| 429 | |
| 430 | impl Verifier for BruteforceVerifier { |
| 431 | /// Creates a Winternitz signature for the given `secret_key` and `digits`. |
nothing calls this directly
no outgoing calls
no test coverage detected