New answers tagged

1 vote

Are RSA keypairs proof of work?

RSA keypair generation is slow because large prime numbers have to be found. Prime generation can be used as proof-of-work, but not on its own because one could just store a list of pre-generated ...
user avatar
  • 13.5k
1 vote
Accepted

I need an encryption algorithm that doesn't require keys and computationally easy to encrypt, hard to decrypt

From you mentioning that you are more concerned about the wall clock (i.e. real-life), I think what you are looking for is a delay (i.e. sequential) function. The basic concept is to require your ...
user avatar
  • 488
2 votes

I need an encryption algorithm that doesn't require keys and computationally easy to encrypt, hard to decrypt

You can encrypt your password using some symmetric key cipher with a random key sampled from a small space (e.g., they key can be a number between 0 and 999) and then throw away the key. Then you need ...
user avatar
  • 992

Top 50 recent answers are included