arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2006.04281math.NTcs.CR
收藏

承诺方案与丢番图方程

Commitment Schemes and Diophantine Equations

Jose Felipe Voloch

摘要:

受密码学问题的启发,我们寻找难以求解但很容易确定解的个数的丢番图方程。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑