View Single Post
Old 2020-08-06, 20:42   #26
bsquared's Avatar
Feb 2007

25·3·5·7 Posts

I see that you are finding a short addition chain using the x^(2^k) elements that will be computed anyway during the test. That's a very nice approach. As mentioned, the short addition chain problem is hard, so I was looking at how other known methods compared. I had thought that exponent recoding gave a larger benefit but after looking closer it is not much better than a standard sliding window. Both of those known methods are not any better than what you have found (but close).
bsquared is offline   Reply With Quote