6 problems

Let $\mathbb{E}_{p^2}$ be an entropoid, with $p=2q+1$ a safe prime having $\lambda$ bits, and let $g$ generate $\mathbb{E}^*_{(p-1)^2}$. Let $\mathcal{A}$ be an algorithm for CDERP…

Let $\mathbb{E}_{p^2}$ be an entropoid with $p=2q+1$ a safe prime, and let $g_q$ generate its Sylow $q$-subquasigroup $\mathbb{E}^*_{q^2}$. The Sylow DEDHP hardness conjecture. No…

Let $\mathbb{E}_{p^2}$ be an entropoid and let $g\in\mathbb{E}^*_{(p-1)^2}$ generate its maximal multiplicative subgroupoid. For every even base $\mathfrak{b}=2b_1<b_{\max}$, let…

Let $g$ generate the maximal multiplicative subgroupoid $\mathbb{E}^*_{(p-1)^2}$ of an entropoid, with $p\geq 11$. Define … The Sylow generator conjecture. The element $g_q$ genera…

Let $\mathbb{E}_{p^2}$ be an entropoid defined with a $\lambda$-bit safe prime $p$, and let $g\in\mathbb{E}^*_{(p-1)^2}$. Suppose … … … Then the generator conjecture. The probabili…

Let $\mathbb{E}_{p^2}$ be an entropoid, with $p=2q+1$ a safe prime, and let $g_q$ generate its Sylow $q$-subquasigroup $\mathbb{E}^*_{q^2}$. The DEDHP hardness conjecture. There is…