0

Is anyone aware of an in-depth study of algorithms using preprocessing to compute fixed-base exponentiations? Assuming I am willing to do arbitrary computation in the preprocessing phase (but not store an arbitrary amount of data afterward), what is the optimal time/storage tradeoff here?

Note: I have read this page on Wikipedia as well as this answer from 9+ years ago. (However, the link provided there to a paper that may help answer my question no longer works.)

user432944
  • 305
  • 1
  • 8
  • 1
    The link in this answer should be fixed. – fgrieu Aug 07 '23 at 18:43
  • Thank you -- I think that pretty much answers my question, since the paper is exactly what I am looking for and google scholar doesn't show any improvements to that paper – user432944 Aug 07 '23 at 20:27
  • 1
    Don't forget to vote up the earlier question / answer. Besides giving back recognition & higher score on e.g. search engines, it may also gain more interest of other cryptographers; maybe they know a better trick. – Maarten Bodewes Aug 08 '23 at 01:10

0 Answers0