It is said that the RSA algorithm uses number theory. What parts of number theory does it use? I know it uses modular arithmetic and Euler's totient theorem and function. Is that all?
for my hobby tinkering project, I need a mixing function that takes 32-bit input and has 32-bit output (and will, most likely, run in a 32-bit C environment) and the following property (independent of ...