logo back     Home     deutsch

The modular exponential function. The graph of the discrete modular exponential function

f(m) = me mod n

which is used for the RSA algorithm, is plotted for 0 m < n (More is not necessary, for everything repeats modulo n!). Please insert integer values for e and n (terminate your input with the return key):

Please enable Java!

Duke   © de Vries 2001 Duke       back     Home     deutsch