| •owl:Thing |
| •sec:Model |
| •sec:CryptographyModel |
| •sec:DiscreteLogarithm |
| dc:description | It is easy to generate y given x in: y = g^x modulo p (with p a prime and g < p) but it is hard to do the reverse. |
Class(sec:DiscreteLogarithm partial sec:CryptographyModel)