- #1
Mr Peanut
- 30
- 0
Math name for "asymetric-pair" relationship?
Say I have a function (F) that takes an input (P) and returns an output (E). Suppose F isn't invertible so, knowing F and E, one could not reconstruct P.
Suppose also that there is another function (R) that can take E as input and returns P... without any prior knowledge about P other than it was generated with F. (R could also be non-invertible but need not necessarily be.)
I know the computer people refer to an imperfect, practical application of this idea as public key encryption or asymmetric encryption. It assumes that prime number factors for large numbers cannot be determined analytically in practical time.
But the concept has a perfect, general, underlying mathematical interpretation.
1) Does mathematics have a name for such a pair of functions?
2) Could they, in fact, exist?
3) If they do exist; are there any examples?
Say I have a function (F) that takes an input (P) and returns an output (E). Suppose F isn't invertible so, knowing F and E, one could not reconstruct P.
Suppose also that there is another function (R) that can take E as input and returns P... without any prior knowledge about P other than it was generated with F. (R could also be non-invertible but need not necessarily be.)
I know the computer people refer to an imperfect, practical application of this idea as public key encryption or asymmetric encryption. It assumes that prime number factors for large numbers cannot be determined analytically in practical time.
But the concept has a perfect, general, underlying mathematical interpretation.
1) Does mathematics have a name for such a pair of functions?
2) Could they, in fact, exist?
3) If they do exist; are there any examples?