Commitment Schemes and Diophantine Equations

2020/06/07 by Voloch, Jose Felipe
#Cryptography and Security (cs.CR) #FOS: Computer and information sciences #FOS: Mathematics #Number Theory (math.NT)

paper · doi:10.48550/arxiv.2006.04281

Abstract

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.

Related

• A systematic approach to Diophantine equations: open problems
• Security Features of an Asymmetric Cryptosystem based on the Diophantine Equation Hard Problem
• A systematic approach to Diophantine equations: two thousand solved examples
• How to Solve Diophantine Equations
• Diophantine equations: a systematic approach