Skip to main content

All Questions

Filter by
Sorted by
Tagged with
6 votes
1 answer
441 views

Minimum number of operations necessary to arrive at any configuration

Let $k \geq 2$ and $N_1, N_2, ..., N_k$ be positive integers. Let $S=\{(a_1,a_2,...,a_k) \in \mathbb{Z}^k:1 \leq a_i \leq N_i\}$ and $A=\{1,2,...,\prod_{i=1}^{k} N_{i}\}$. Given a bijective map $f:...
jack's user avatar
  • 3,153
0 votes
0 answers
141 views

State of the art on attempts to solve the elliptic curve discrete logarithm problem through transfering the problem to a weaker curve

Let an elliptic curve $E$, and 2 points on such curve $P$ and $O$ the methods I’m talking about consist in creating a weaker elliptic curve $F$ and mapping $P$ and $O$ to $F$ while successfully ...
user2284570's user avatar