Generating cryptographic function parameters from a puzzle
Methods, systems, and computer programs for generating cryptographic function parameters are described. In some examples, a solution to a puzzle is obtained. A pseudorandom generator is seeded based on the solution. After seeding the pseudorandom generator, an output from the pseudorandom generator is obtained. A parameter for a cryptographic function is generated. The parameter is generated from the output from the pseudorandom generator.
1. A cryptography method comprising:
obtaining, by operation of one or more processors, a solution to a puzzle, wherein the solution to the puzzle is obtained by performing an iterative process that includes two or more iterations, wherein each iteration comprises:
generating a puzzle solution for the iteration by applying a puzzle function to a puzzle input for the iteration, wherein the puzzle input comprises an output product of a de-sparser function; and applying the puzzle function to the puzzle input for the iteration comprises seeding the puzzle function with the output product of the de-sparser function for the iteration, wherein the de-sparser function comprises a pseudorandom function that takes one input;
seeding a pseudorandom generator based on the puzzle solution for the iteration; and
after seeding the pseudorandom generator, obtaining an output from the pseudorandom generator for the iteration;
wherein a puzzle input for at least one iteration is based on an output from the pseudorandom generator for a prior iteration of the iterative process; and
generating a parameter for a cryptographic function by operation of one or more data processors, the parameter being generated from an output from the pseudorandom generator for a last iteration of the iterative process.
2. The method of claim 1 , wherein generating the puzzle solution has a higher computational cost than verifying the puzzle solution.
3. The method of claim 1 , wherein the cryptographic function comprises an elliptic curve function, and the parameter comprises a constant for the elliptic curve function.
4. The method of claim 1 , wherein generating the parameter comprises deriving the parameter from one or more outputs produced by operating the pseudorandom generator seeded by the solution.
5. The method of claim 1 , further comprising using the parameter to perform cryptographic operations according to a cryptographic communication protocol.
6. The method of claim 1 , comprising generating a full set of parameters for the cryptographic function from the output from the pseudorandom generator.
7. A computing system comprising:
a memory; and
one or more hardware data processors configured to perform operations comprising:
obtaining a solution to a puzzle, wherein the solution to the puzzle is obtained by performing an iterative process that includes two or more iterations, wherein each iteration comprises:
generating a puzzle solution for the iteration by applying a puzzle function to a puzzle input for the iteration, wherein the puzzle input comprises an output product of a de-sparser function; and applying the puzzle function to the puzzle input for the iteration comprises seeding the puzzle function with the output product of the de-sparser function for the iteration, wherein the de-sparser function comprises a pseudorandom function that takes one input;
seeding a pseudorandom generator based on the puzzle solution for the iteration; and
after seeding the pseudorandom generator, obtaining an output from the pseudorandom generator for the iteration;
wherein a puzzle input for at least one iteration is based on an output from the pseudorandom generator for a prior iteration of the iterative process; and
generating a parameter for a cryptographic function, the parameter being generated from an output from the pseudorandom generator for a last iteration of the iterative process.
8. The system of claim 7 , wherein generating the puzzle solution has a higher computational cost than verifying the puzzle solution.
9. The system of claim 7 , wherein the cryptographic function comprises an elliptic curve function, and the parameter comprises a constant for the elliptic curve function.
10. The system of claim 7 , the operations comprising generating a full set of parameters for the cryptographic function from the output from the pseudorandom generator.
11. The system of claim 7 , wherein generating the parameter comprises deriving the parameter from one or more outputs produced by operating the pseudorandom generator seeded by the solution.
12. The system of claim 7 , further comprising a terminal configured to use the parameter in a cryptographic communication protocol.
13. A non-transitory computer-readable medium storing instructions that, when executed by data processing apparatus, cause the data processing apparatus to perform operations comprising:
obtaining, by operation of one or more processors, a solution to a puzzle, wherein the solution to the puzzle is obtained by performing an iterative process that includes two or more iterations, wherein each iteration comprises:
generating a puzzle solution for the iteration by applying a puzzle function to a puzzle input for the iteration, wherein the puzzle input comprises an output product of a de-sparser function; and applying the puzzle function to the puzzle input for the iteration comprises seeding the puzzle function with the output product of the de-sparser function for the iteration, wherein the de-sparser function comprises a pseudorandom function that takes one input;
seeding a pseudorandom generator based on the puzzle solution for the iteration; and
after seeding the pseudorandom generator, obtaining an output from the pseudorandom generator for the iteration;
wherein a puzzle input for at least one iteration is based on an output from the pseudorandom generator for a prior iteration of the iterative process; and
generating a parameter for a cryptographic function by operation of one or more data processors, the parameter being generated from an output from the pseudorandom generator for a last iteration of the iterative process.
14. The computer-readable medium of claim 13 , wherein generating the puzzle solution has a higher computational cost than verifying the puzzle solution.
15. The computer-readable medium of claim 13 , wherein the cryptographic function comprises an elliptic curve function, and the parameter comprises a constant for the elliptic curve function.
16. The computer-readable medium of claim 13 , the operations further comprising using the parameter to perform cryptographic operations according to a cryptographic communication protocol.
17. The computer-readable medium of claim 13 , the operations comprising generating a full set of parameters for the cryptographic function from the output from the pseudorandom generator.