Motivated by questions in cryptography, we look for diophantine equations that are hard to solve but for which determining the number of solutions is easy.
A note on the Diophantine equations $x^{2}\pm5^α\cdot p^{n}=y^{n}$
On Transformation properties of hypergeometric motives and Diophantine equations
On the Diophantine Equations $J_n +J_m =L_k$ and $L_n +L_m =J_k$
![QR code for arXiv:2006.04281 [math.NT]](http://oss.arxitics.com/images/favicon.svg)