Can a modulo function be linearized or alternatively expressed?

am flag

In order to try to simplify or alternatively express cryptographic functions I wonder if the modulo function can be alternatively expressed. Could for example a Fourier series of a sawtooth wave or its discretization be useful? What would that look like for a given range and precision?

fgrieu avatar
ng flag
When the modulus is a power of two, $x\bmod n$ reduces to $x\&(n-1)$, where $\&$ is [bitwise AND]( That generalizes to $n$ of the form $b^k$, by expressing $x$ in base $b$ and keeping the $k$ low-order digits. That applies to any $n$ by expressing $x$ in base $n$, but is not much useful.
kodlu avatar
sa flag
do you mean the function $x \mapsto x \pmod n,$ for some $n$? If yes, the above comment answers it.

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.