|
| |
| Algorithm 3 Temporary hash chain generation of a message-specific puzzle. | |
|
| |
| 1: | Get N1 from input |
| 2: | X1 ⇐ H160(N1) |
| 3: | Store X in RAM or EEPROM. |
| 4: | for i = 2 to I do |
| 5: | Xi ⇐ H160(X) |
| 6: | Store Xi in RAM or EEPROM. |
| 7: | end for |
|
| |
|
| |
| Algorithm 3 Temporary hash chain generation of a message-specific puzzle. | |
|
| |
| 1: | Get N1 from input |
| 2: | X1 ⇐ H160(N1) |
| 3: | Store X in RAM or EEPROM. |
| 4: | for i = 2 to I do |
| 5: | Xi ⇐ H160(X) |
| 6: | Store Xi in RAM or EEPROM. |
| 7: | end for |
|
| |