{
  "id": "matyukhin03-prime",
  "categoryId": "dlog-prime-general",
  "paperId": "matyukhin03",
  "date": "2003-12-31",
  "datePrecision": "year",
  "time": {
    "coefficient": 1.9018836118648392,
    "expression": "L_p[1/3, (92+26 sqrt(13))^{1/3}/3]"
  },
  "space": {
    "coefficient": null,
    "expression": "Not extracted from the source"
  },
  "tags": [
    "multiple number fields",
    "theoretical asymptotics"
  ],
  "review": {
    "status": "source-checked"
  },
  "certificate": {
    "status": "not-provided",
    "lean": null
  },
  "notes": "Modification of NFS DLP for prime fields with the same asymptotic heuristic constant as Coppersmith’s integer-factoring algorithm. Precomputation is included; no per-target/fixed-prime amortized cost is substituted.",
  "extra": {
    "coefficientExact": "(92+26 sqrt(13))^{1/3}/3"
  },
  "evidence": {
    "url": "https://www.mathnet.ru/eng/dm184",
    "locator": "Abstract; comparison with Coppersmith bound",
    "sourceVersion": "Version available at the cited URL; bibliographic metadata and stated bound checked on 2026-11-08"
  }
}