Deconstructing the Welch equation using p-adic methods

MaRDI QIDQ4691568zbMATH OpenFDO

Authors Abigail Mann, Adelyn Yeoh

Publication date 24 October 2018

Full work available at URL https://arxiv.org/abs/1608.05880, https://scholar.rose-hulman.edu/rhumj/vol16/iss1/1

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Abstract: The Welch map $xightarrow{g}^{x-1+c}$ is similar to the discrete exponential map $xightarrow{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}equivxpmod{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.

Recommendations

• scientific article; zbMATH DE number 4037758
• Progress in Cryptology - INDOCRYPT 2004
• COUNTING FIXED POINTS, TWO-CYCLES, AND COLLISIONS OF THE DISCRETE EXPONENTIAL FUNCTION USING p-ADIC METHODS
• Counting fixed points and rooted closed walks of the singular map \(x \mapsto x^{x^n}\) modulo powers of a prime
• scientific article; zbMATH DE number 1424171

Cited in

(1)

• COUNTING FIXED POINTS, TWO-CYCLES, AND COLLISIONS OF THE DISCRETE EXPONENTIAL FUNCTION USING p-ADIC METHODS

This page was built for publication: Deconstructing the Welch equation using \(p\)-adic methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4691568)