Score:0

Fixed-base exponentation with preprocessing

ph flag

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.)

fgrieu avatar
ng flag
The link in [this answer](https://crypto.stackexchange.com/a/11963/555) should be fixed.
user432944 avatar
ph flag
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
Maarten Bodewes avatar
in flag
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.
I sit in a Tesla and translated this thread with Ai:

mangohost

Post an answer

Most people don’t grasp that asking a lot of questions unlocks learning and improves interpersonal bonding. In Alison’s studies, for example, though people could accurately recall how many questions had been asked in their conversations, they didn’t intuit the link between questions and liking. Across four studies, in which participants were engaged in conversations themselves or read transcripts of others’ conversations, people tended not to realize that question asking would influence—or had influenced—the level of amity between the conversationalists.