{
  "id": "2006.04281",
  "version": "v1",
  "published": "2020-06-07T22:13:35.000Z",
  "updated": "2020-06-07T22:13:35.000Z",
  "title": "Commitment Schemes and Diophantine Equations",
  "authors": [
    "Jose Felipe Voloch"
  ],
  "comment": "Invited talk at ANTS XIV",
  "categories": [
    "math.NT",
    "cs.CR"
  ],
  "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2020-06-07T22:13:35.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "diophantine equations",
      "commitment schemes",
      "cryptography"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}