25 Mar
2016
25 Mar
'16
4:41 p.m.
On 3/25/16, Warren D Smith <warren.wds@gmail.com> wrote:
I hereby invent a cute (new? old?) idea. It is based on the composition identity for Chebyshev polynomials
It seems my idea was not new: Rudolf Lidl & Winfried B. M"uller: Permutation polynomials in RSA cryptosystems, Crypto 83, pages 293-302. They prove in theorem 2.1 that the power and Dickson/Chebyshev polynomials are the only choices that work for making an RSA system. They do not suggest any reason why the Dickson system would be a good idea.