Commitment Schemes and Diophantine Equations
arXiv:2006.04281v13 citations
Originality Synthesis-oriented
AI Analysis
This addresses a theoretical problem in cryptography, but it appears incremental as it builds on existing concepts without clear breakthroughs.
The paper tackles the problem of finding diophantine equations that are difficult to solve but easy to count solutions for, motivated by cryptographic applications, but no concrete results or numbers are provided.
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.