Query for and automatically derive mathematical functions with desired computational complexity properties, for example, automatically derive RSA and Diffie-Hellman from their mathematical properties, for example "Derive a function for which calculating y=f(x) may be done in polynomial time but calculating the inverse x=f-1(y) requires exponential time".
Subroutine: The computer has knowledge of number theory, algebra, and operations which may be done in polynomial time. And "reduction" target problems which are thought to be hard. Combine these in an automated theorem proving like environment to prove, or guess, whether a new problem is hard.
This post was inspired by the mathematical description of various Identity Based Encryption schemes.
No comments :
Post a Comment