The even-base min-entropy formula conjecture for entropoid power shapes

About 5 years old · traced to

Let Ep2\mathbb{E}_{p^2} be an entropoid and let g∈E(p−1)2∗g\in\mathbb{E}^*_{(p-1)^2} generate its maximal multiplicative subgroupoid. For every even base b=2b1<bmax⁡\mathfrak{b}=2b_1<b_{\max}, let n(b,i)=max⁡nijn(\mathfrak{b},i)=\max n_{ij}. The even-base min-entropy conjecture.

n(b,i)=(b−1)((b−1)i−1−(b−2)i−1),n(\mathfrak{b},i)=(\mathfrak{b}-1)\left((\mathfrak{b}-1)^{i-1}-(\mathfrak{b}-2)^{i-1}\right),

and consequently

H∞(ξi)=1−(b−2b−1)i−1.H_{\infty}(\xi_i)=1-\left(\frac{\mathfrak{b}-2}{\mathfrak{b}-1}\right)^{i-1}.

The formula formalizes the observed even-versus-odd base pattern in the distribution of bracketing shapes; the paper reports it as an observed conjectural relation rather than proving it.

References

Primary source

Danilo Gligoroski, “Entropoid Based Cryptography”, arXiv:2104.05598 (2021).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.