Score:0

Cryptographic Applications of Composite Modular Exponentiation

bt flag

I've developed an algorithm for fast modular exponentiation modulo composite numbers with known factorization. I'm not very well versed in cryptography, so I'm wondering if any of you know of an application of this algorithm to some cryptosystem. Even if there is no cryptosystem where this can be used, I'm also interested in similar applications, like pseudorandom number generation.

The main issue that arises with doing the classic discrete logarithm with, say, ElGamal, is that solutions modulo a prime $p$ can be lifted up to $\mathbb{Z}_{p^k}^*$. This can then be lifted to a general composite $n=\prod p_i^{e_i}$. This is why I'm looking for something that avoids the possibility of a discrete logarithm to hack it.

Any ideas?

kodlu avatar
sa flag
how do you know the algorithm is better than what's out there to begin with?
TheBestMagician avatar
bt flag
@kodlu I've researched the topic and haven't found anything, but of course you can never be too sure. Besides, this strays a bit from the point of the question.
kodlu avatar
sa flag
fair enough, at least tell us the efficiency of your algorithm and someone here may be able to tell you if it's likely to be of interest
TheBestMagician avatar
bt flag
@kodlu For specific composite $m$ I compute $a^n\pmod{m}$ in $\mathcal{O}(\sqrt{\log m})$ steps, assuming $\gcd(a,m)=1$ and $n$ is on the order of $\phi(m)$.
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.