Deconstructing the Welch Equation Using $p$-adic Methods

TL;DR

This paper employs $p$-adic techniques to analyze the solutions of the Welch equation, which is relevant to cryptography, providing insights into its solution structure and potential vulnerabilities.

Contribution

It introduces a $p$-adic analytical framework to count solutions of the Welch equation modulo prime powers, enhancing understanding of its cryptographic properties.

Findings

Counted solutions to the Welch equation using $p$-adic methods

Identified patterns that could be exploited in cryptographic systems

Applied Hensel's lemma and Chinese Remainder Theorem in analysis

Abstract

The Welch map $x \rightarrow g^{x-1+c}$ is similar to the discrete exponential map $x \rightarrow g^x$, which is used in many cryptographic applications including the ElGamal signature scheme. This paper analyzes the number of solutions to the Welch equation: $g^{x-1+c} \equiv x \pmod{p^e}$ where $p$ is a prime and $g$ is a unit modulo $p$, and looks at other patterns of the equation that could possibly be exploited in a similar cryptographic system. Since the equation is modulo $p^e$, where $p$ is a prime number, $p$-adic methods of analysis are used in counting the number of solutions modulo $p^e$. These methods include: $p$-adic interpolation, Hensel's lemma and Chinese Remainder Theorem.