32 | | Brian and David-Sarah wrote [wiki:OneHundredYearCryptography/hashbasedsig.py a simulator] or two to explore performance trade-offs in hash-based signature parameters. The output of one run is this: |
| 32 | Brian and David-Sarah wrote [wiki:OneHundredYearCryptography/hashbasedsig.py a simulator] or two to explore performance trade-offs in hash-based signature parameters. The output of one run with the following parameters is this: |
| 33 | {{{ |
| 34 | # range of hash output lengths |
| 35 | range_L_hash = [128] |
| 36 | |
| 37 | lg_M = 53 # lg(required number of signatures before losing security) |
| 38 | |
| 39 | limit_bytes = 480000 # limit on signature length |
| 40 | limit_cost = 500 # limit on Mcycles_Sig + weight_ver*Mcycles_ver |
| 41 | weight_ver = 1 # how important verification cost is relative to signature cost |
| 42 | # (note: setting this too high will just exclude useful candidates) |
| 43 | |
| 44 | L_block = 512 # bitlength of hash input blocks |
| 45 | L_pad = 64 # bitlength of hash padding overhead (for M-D hashes) |
| 46 | L_label = 80 # bitlength of hash position label |
| 47 | L_prf = 256 # bitlength of hash output when used as a PRF |
| 48 | cycles_per_byte = 15.8 # cost of hash |
| 49 | }}} |