{
  "id": "blp93-rsa",
  "categoryId": "rsa-classical-heuristic",
  "paperId": "blp93",
  "date": "1993-12-31",
  "datePrecision": "year",
  "time": {
    "coefficient": 1.9229994270765445,
    "expression": "L_N[1/3, (64/9)^{1/3}]"
  },
  "space": {
    "coefficient": null,
    "expression": "Not extracted from the source"
  },
  "tags": [],
  "review": {
    "status": "source-checked"
  },
  "certificate": {
    "status": "not-provided",
    "lean": null
  },
  "notes": "The general-purpose integer factorization bound applies to RSA-type balanced semiprimes as a special case. This is not an additional algorithm or an empirical challenge record.",
  "extra": {
    "coefficientExact": "(64/9)^{1/3}"
  },
  "evidence": {
    "url": "https://www.cs.umd.edu/~gasarch/TOPICS/factoring/1993_Book_TheDevelopmentOfTheNumberField.pdf",
    "locator": "General NFS complexity analysis",
    "sourceVersion": "Version available at the cited URL; bibliographic metadata and stated bound checked on 2026-11-08"
  }
}