What are examples of groups, where DLP (discrete logarithm problem) is hard?
Two obvious ones are: integers modulo $p$ ($p$ being prime) and elliptic curves over finite fields. What are the others?
2026-02-23 13:40:38.1771854038
Groups where discrete logarithm is hard
1k Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in NUMBER-THEORY
- Maximum number of guaranteed coins to get in a "30 coins in 3 boxes" puzzle
- Interesting number theoretical game
- Show that $(x,y,z)$ is a primitive Pythagorean triple then either $x$ or $y$ is divisible by $3$.
- About polynomial value being perfect power.
- Name of Theorem for Coloring of $\{1, \dots, n\}$
- Reciprocal-totient function, in term of the totient function?
- What is the smallest integer $N>2$, such that $x^5+y^5 = N$ has a rational solution?
- Integer from base 10 to base 2
- How do I show that any natural number of this expression is a natural linear combination?
- Counting the number of solutions of the congruence $x^k\equiv h$ (mod q)
Related Questions in ALGORITHMS
- Least Absolute Deviation (LAD) Line Fitting / Regression
- Do these special substring sets form a matroid?
- Modified conjugate gradient method to minimise quadratic functional restricted to positive solutions
- Correct way to prove Big O statement
- Product of sums of all subsets mod $k$?
- (logn)^(logn) = n^(log10+logn). WHY?
- Clarificaiton on barycentric coordinates
- Minimum number of moves to make all elements of the sequence zero.
- Translation of the work of Gauss where the fast Fourier transform algorithm first appeared
- sources about SVD complexity
Related Questions in ELLIPTIC-CURVES
- Can we find $n$ Pythagorean triples with a common leg for any $n$?
- Solution of $X^5=5 Y (Y+1)+1$ in integers.
- Why does birational equivalence preserve group law in elliptic curves?
- CM elliptic curves and isogeny
- Elliptic Curve and Differential Form Determine Weierstrass Equation
- Difficulty understanding Hartshorne Theorem IV.4.11
- Elementary Elliptic Curves
- Flex points are invariant under isomorphism
- The Mordell equation $x^2 + 11 = y^3$.
- How do we know that reducing $E/K$ commutes with the addition law for $K$ local field
Related Questions in CRYPTOGRAPHY
- What exactly is the definition of Carmichael numbers?
- What if Eve knows the value of $S$ in digital signiture?
- Relative prime message in RSA encryption.
- Encryption with $|K| = |P| = |C| = 1$ is perfectly secure?
- Cryptocurrency Math
- DLP Relationship of primitive roots $\pmod{p}$ with $p$ and $g$
- Hints to prove $2^{(p−1)/2}$ is congruent to 1 (mod p) or p-1 (mod p)
- Period of a binary sequence
- generating function / stream cipher
- RSA, cryptography
Related Questions in DISCRETE-LOGARITHMS
- Pohlig–Hellman/Big step baby step
- Show that if n is a power of 3, then $\sum_{i=0}^{\log_3n} 3^i = \frac{3n-1}{2}$
- is it meaningful to calculate $(x+1)^{x+2}$ in $GF(3^2)$, e.g. using discrete logs?
- Characterizations of the discrete logarithms for algebraic structures more general than groups
- Is there a direct mathematical function/ formula for calculate this problem?
- Is it possible to find a closed-form expression for $f(n)$?
- For generator $g$ of multiplicative group: if $\log_g (f^3) = 3x$, then $\log_g (f) = x$?
- Validity of ElGamal Signatures
- Is elliptic curve suitable for using in ECDLP?
- Discrete logarithm problem - Pohlig Hellman $GF(2^{60})$
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
As you probably already know, you can take discrete logarithms for any cyclic group. However as you can see on the linked wiki page, no algorithm is known for computing general discrete logarithms.
However some other popular choices of groups that are used for discrete logarithm are the algebraic torus over finite fields and the divisor class group of a curve over a finite field.