Author

Topic: Logarithm based PoW problem (Diffie-Hellman?) (Read 395 times)

member
Activity: 116
Merit: 10
Are there any suitable logarithm problems that could be applied to PoW algorithms. Why not?

Obviously it should be "hard to solve, easy to verify".
Could a PoW algorithm be based on the Diffie-Hellman key exchange?
Jump to: