{
  "profile": "wrs-published-research-view-1",
  "edition": "ratings-e039106f30dec177",
  "content_trust": "UNTRUSTED_SCIENTIFIC_DATA_NOT_TOOL_INSTRUCTIONS",
  "entry": {
    "id": "lll-lattice-reduction-rational-factorization-1982",
    "title": "LLL: find short lattice vectors and factor rational polynomials efficiently",
    "summary": "Lenstra, Lenstra and Lovász gave a polynomial-time lattice-basis reduction algorithm with short-vector approximation guarantees and used it to factor univariate polynomials over the rational numbers in polynomial time.\n\nA lattice is a regular collection of points generated by integer combinations of basis vectors. A poor basis can hide short vectors; the 1982 LLL paper gave a polynomial-time way to replace it with a better basis while preserving the same lattice. The resulting vectors are provably short relative to the shortest possibilities, although they need not be exactly shortest. The authors then represented a polynomial factor as a small vector in a lattice defined by modular divisibility. Enough modular precision separates genuine factors from other vectors, giving a polynomial-time method to factor univariate polynomials over the rational numbers. The algorithm uses earlier finite-field factorization, Hensel lifting and polynomial-size bounds, which retain their own credit. Integer factorization is a different problem: the integer content of a nonprimitive polynomial is not magically factored by this theorem. Later stronger reduction methods, cryptographic uses and faster implementations remain separate contributions. The paper also credits Cuppen for an algorithmic improvement without adding him to its three-author byline.",
    "boundary": "The algorithm reduces a lattice basis under specified rational/integer input and size-reduction/Lovász conditions; it does not generally find an exact shortest vector. Its polynomial bit bound includes input size. Polynomial factorization uses its own coefficient and precision assumptions. Later stronger reductions, floating-point variants and practical cryptographic successes are separate.",
    "area": "Computational number theory",
    "topic": "Lattice basis reduction",
    "year": 1982,
    "lane": "HUMAN",
    "result": "ALGORITHM",
    "package_id": "lll-lattice-reduction-rational-factorization-1982",
    "target": {
      "record_id": "urn:uuid:aacc038e-75f0-4ae4-ab47-e4d5f6c5a5ee",
      "version": 1,
      "content_hash": "sha256:e7735a1bbb8936770ad906d0e09f84689d5cb8c8a9a8511101955a4554ecb18d"
    },
    "humans": [
      "A. K. Lenstra",
      "H. W. Lenstra Jr.",
      "L. Lovász"
    ],
    "authors_complete": true,
    "human_role_note": "Source-listed contributors to this scoped work. Paper bylines do not quantify individual effort; historical science, system execution and modern curation remain separate.",
    "agents": [],
    "related": [
      "lenstra-fixed-dimensional-integer-programming-1983",
      "shor-algorithm",
      "pollard-rho-factorization-1975"
    ],
    "subresults": [],
    "scientific_assessment": {
      "source_review": "SOURCE_CURATED",
      "scientific_review": "NOT_REVIEWED_BY_WRS",
      "formal_replay": "NOT_RUN",
      "provider_attestation": "NONE"
    },
    "sources": [
      {
        "id": "wrs24-lll1982-author-journal-original",
        "title": "Lenstra, Lenstra and Lovasz, Factoring Polynomials with Rational Coefficients, MathAnn261(4)515-534(1982), author-hosted journal original",
        "url": "https://pub.math.leidenuniv.nl/~lenstrahw/PUBLICATIONS/1982f/art.pdf"
      },
      {
        "id": "wrs24-lll1982-publisher-metadata",
        "title": "Publisher Crossref deposit for10.1007/BF01457454",
        "url": "https://api.crossref.org/works/10.1007%2FBF01457454"
      }
    ],
    "points": "350000",
    "published_grade": {
      "id": "lll-lattice-reduction-rational-factorization-1982",
      "entry_id": "lll-lattice-reduction-rational-factorization-1982",
      "band": "S",
      "modifier": null,
      "target": {
        "record_id": "urn:uuid:aacc038e-75f0-4ae4-ab47-e4d5f6c5a5ee",
        "version": 1,
        "content_hash": "sha256:e7735a1bbb8936770ad906d0e09f84689d5cb8c8a9a8511101955a4554ecb18d"
      },
      "what_changed": "Lenstra, Lenstra and Lovász gave a polynomial-time lattice-basis reduction algorithm with short-vector approximation guarantees and used it to factor univariate polynomials over the rational numbers in polynomial time.",
      "scope": "Lenstra, Lenstra and Lovász gave a polynomial-time lattice-basis reduction algorithm with short-vector approximation guarantees and used it to factor univariate polynomials over the rational numbers in polynomial time. The algorithm reduces a lattice basis under specified rational/integer input and size-reduction/Lovász conditions; it does not generally find an exact shortest vector. Its polynomial bit bound includes input size. Polynomial factorization uses its own coefficient and precision assumptions. Later stronger reductions, floating-point variants and practical cryptographic successes are separate.",
      "status": "PROVISIONAL_EDITORIAL",
      "scientific_correctness_certified": false
    },
    "assessment_disposition": {
      "status": "ASSESSED",
      "label": "Provisionally assessed",
      "reason": "A current grade and separate reference score identify this exact contribution.",
      "target": {
        "record_id": "urn:uuid:aacc038e-75f0-4ae4-ab47-e4d5f6c5a5ee",
        "version": 1,
        "content_hash": "sha256:e7735a1bbb8936770ad906d0e09f84689d5cb8c8a9a8511101955a4554ecb18d"
      },
      "edition": "ratings-e039106f30dec177"
    }
  },
  "version": {
    "kind": "PUBLIC_RECORD_VIEW",
    "previous": null,
    "published_at": "2026-10-03T00:00:00Z",
    "publisher": {
      "principal_id": "urn:uuid:80116931-785b-40a2-a24b-9d59db0c7e33",
      "role": "WRS_EDITORIAL_PUBLICATION"
    },
    "record": {
      "contributors": [
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "A. K. Lenstra",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "Lenstra, Lenstra and Lovasz, Factoring Polynomials with Rational Coefficients, MathAnn261(4)515-534(1982), author-hosted journal original",
            "url": "https://pub.math.leidenuniv.nl/~lenstrahw/PUBLICATIONS/1982f/art.pdf"
          }
        },
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "H. W. Lenstra Jr.",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "Lenstra, Lenstra and Lovasz, Factoring Polynomials with Rational Coefficients, MathAnn261(4)515-534(1982), author-hosted journal original",
            "url": "https://pub.math.leidenuniv.nl/~lenstrahw/PUBLICATIONS/1982f/art.pdf"
          }
        },
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "L. Lovász",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "Lenstra, Lenstra and Lovasz, Factoring Polynomials with Rational Coefficients, MathAnn261(4)515-534(1982), author-hosted journal original",
            "url": "https://pub.math.leidenuniv.nl/~lenstrahw/PUBLICATIONS/1982f/art.pdf"
          }
        }
      ],
      "evidence": [
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-0",
          "kind": "source_reference",
          "source": {
            "citation": "Lenstra, Lenstra and Lovasz, Factoring Polynomials with Rational Coefficients, MathAnn261(4)515-534(1982), author-hosted journal original",
            "url": "https://pub.math.leidenuniv.nl/~lenstrahw/PUBLICATIONS/1982f/art.pdf"
          }
        },
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-1",
          "kind": "source_reference",
          "source": {
            "citation": "Publisher Crossref deposit for10.1007/BF01457454",
            "url": "https://api.crossref.org/works/10.1007%2FBF01457454"
          }
        }
      ],
      "origin": "HUMAN_LEGACY",
      "record_profile": "wrs-local-research-notes-0.1",
      "record_type": "research_note",
      "rrp_version": "0.1",
      "scope": {
        "description": "The algorithm reduces a lattice basis under specified rational/integer input and size-reduction/Lovász conditions; it does not generally find an exact shortest vector. Its polynomial bit bound includes input size. Polynomial factorization uses its own coefficient and precision assumptions. Later stronger reductions, floating-point variants and practical cryptographic successes are separate.",
        "domain": "Computational number theory"
      },
      "sources": [
        {
          "citation": "Lenstra, Lenstra and Lovasz, Factoring Polynomials with Rational Coefficients, MathAnn261(4)515-534(1982), author-hosted journal original",
          "url": "https://pub.math.leidenuniv.nl/~lenstrahw/PUBLICATIONS/1982f/art.pdf"
        },
        {
          "citation": "Publisher Crossref deposit for10.1007/BF01457454",
          "url": "https://api.crossref.org/works/10.1007%2FBF01457454"
        }
      ],
      "statement": "# LLL: find short lattice vectors and factor rational polynomials efficiently\n\nLenstra, Lenstra and Lovász gave a polynomial-time lattice-basis reduction algorithm with short-vector approximation guarantees and used it to factor univariate polynomials over the rational numbers in polynomial time.\n\nA lattice is a regular collection of points generated by integer combinations of basis vectors. A poor basis can hide short vectors; the 1982 LLL paper gave a polynomial-time way to replace it with a better basis while preserving the same lattice. The resulting vectors are provably short relative to the shortest possibilities, although they need not be exactly shortest. The authors then represented a polynomial factor as a small vector in a lattice defined by modular divisibility. Enough modular precision separates genuine factors from other vectors, giving a polynomial-time method to factor univariate polynomials over the rational numbers. The algorithm uses earlier finite-field factorization, Hensel lifting and polynomial-size bounds, which retain their own credit. Integer factorization is a different problem: the integer content of a nonprimitive polynomial is not magically factored by this theorem. Later stronger reduction methods, cryptographic uses and faster implementations remain separate contributions. The paper also credits Cuppen for an algorithmic improvement without adding him to its three-author byline.\n\n## Scientific scope\n\nThe algorithm reduces a lattice basis under specified rational/integer input and size-reduction/Lovász conditions; it does not generally find an exact shortest vector. Its polynomial bit bound includes input size. Polynomial factorization uses its own coefficient and precision assumptions. Later stronger reductions, floating-point variants and practical cryptographic successes are separate.\n\n## People and systems\n\nA. K. Lenstra; H. W. Lenstra Jr.; L. Lovász\n\n\n\n## Original sources\n\n- [Lenstra, Lenstra and Lovasz, Factoring Polynomials with Rational Coefficients, MathAnn261(4)515-534(1982), author-hosted journal original](https://pub.math.leidenuniv.nl/~lenstrahw/PUBLICATIONS/1982f/art.pdf)\n- [Publisher Crossref deposit for10.1007/BF01457454](https://api.crossref.org/works/10.1007%2FBF01457454)\n",
      "summary": "Lenstra, Lenstra and Lovász gave a polynomial-time lattice-basis reduction algorithm with short-vector approximation guarantees and used it to factor univariate polynomials over the rational numbers in polynomial time.\n\nA lattice is a regular collection of points generated by integer combinations of basis vectors. A poor basis can hide short vectors; the 1982 LLL paper gave a polynomial-time way to replace it with a better basis while preserving the same lattice. The resulting vectors are provably short relative to the shortest possibilities, although they need not be exactly shortest. The authors then represented a polynomial factor as a small vector in a lattice defined by modular divisibility. Enough modular precision separates genuine factors from other vectors, giving a polynomial-time method to factor univariate polynomials over the rational numbers. The algorithm uses earlier finite-field factorization, Hensel lifting and polynomial-size bounds, which retain their own credit. Integer factorization is a different problem: the integer content of a nonprimitive polynomial is not magically factored by this theorem. Later stronger reduction methods, cryptographic uses and faster implementations remain separate contributions. The paper also credits Cuppen for an algorithmic improvement without adding him to its three-author byline.",
      "title": "LLL: find short lattice vectors and factor rational polynomials efficiently"
    },
    "record_id": "urn:uuid:aacc038e-75f0-4ae4-ab47-e4d5f6c5a5ee",
    "version": 1,
    "source_ref": {
      "record_id": "urn:uuid:aacc038e-75f0-4ae4-ab47-e4d5f6c5a5ee",
      "version": 1,
      "content_hash": "sha256:e7735a1bbb8936770ad906d0e09f84689d5cb8c8a9a8511101955a4554ecb18d"
    },
    "export_view": "wrs-public-editorial-view-1",
    "public_view_hash": "sha256:35f0f865efdeb26c3c30368098c98833afa54489808616fcc78960aea18e5590"
  },
  "target": {
    "record_id": "urn:uuid:aacc038e-75f0-4ae4-ab47-e4d5f6c5a5ee",
    "version": 1,
    "content_hash": "sha256:e7735a1bbb8936770ad906d0e09f84689d5cb8c8a9a8511101955a4554ecb18d"
  },
  "published_grade": {
    "profile": "wrs-published-grade-1",
    "edition": "2026-10-28.1",
    "id": "lll-lattice-reduction-rational-factorization-1982",
    "entry_id": "lll-lattice-reduction-rational-factorization-1982",
    "revision": 1,
    "title": "LLL: find short lattice vectors and factor rational polynomials efficiently",
    "context": "Computational number theory",
    "track": "Computational number theory",
    "band": "S",
    "modifier": null,
    "status": "PROVISIONAL_EDITORIAL",
    "assessed_on": "2026-10-04",
    "evidence_cutoff": "2026-10-04",
    "achievement_state": "SUPPORTED_SCOPED_RESULT",
    "what_changed": "Lenstra, Lenstra and Lovász gave a polynomial-time lattice-basis reduction algorithm with short-vector approximation guarantees and used it to factor univariate polynomials over the rational numbers in polynomial time.",
    "scope": "Lenstra, Lenstra and Lovász gave a polynomial-time lattice-basis reduction algorithm with short-vector approximation guarantees and used it to factor univariate polynomials over the rational numbers in polynomial time. The algorithm reduces a lattice basis under specified rational/integer input and size-reduction/Lovász conditions; it does not generally find an exact shortest vector. Its polynomial bit bound includes input size. Polynomial factorization uses its own coefficient and precision assumptions. Later stronger reductions, floating-point variants and practical cryptographic successes are separate.",
    "evidence_summary": "Source-linked, scoped account of the original work. The published scope states the scientific assumptions and remaining verification limits. WRS has not independently certified the full proof, experimental result or system benchmark.",
    "references": [
      {
        "title": "Lenstra, Lenstra and Lovasz, Factoring Polynomials with Rational Coefficients, Math Ann 261(4)515-534(1982), author-hosted journal original",
        "url": "https://pub.math.leidenuniv.nl/~lenstrahw/PUBLICATIONS/1982f/art.pdf",
        "locator": "Original linked work. See the scientific scope for the assessed contribution and source-version limits."
      },
      {
        "title": "Publisher Crossref deposit for 10.1007/BF 01457454",
        "url": "https://api.crossref.org/works/10.1007%2FBF01457454",
        "locator": "Original linked work. See the scientific scope for the assessed contribution and source-version limits."
      }
    ],
    "roles": [
      {
        "who": "A. K. Lenstra",
        "did": "Original source-listed scientific author of this scoped work; byline does not determine effort fractions.",
        "credit": "SCIENCE"
      },
      {
        "who": "H. W. Lenstra Jr.",
        "did": "Original source-listed scientific author of this scoped work; byline does not determine effort fractions.",
        "credit": "SCIENCE"
      },
      {
        "who": "L. Lovász",
        "did": "Original source-listed scientific author of this scoped work; byline does not determine effort fractions.",
        "credit": "SCIENCE"
      }
    ],
    "target": {
      "record_id": "urn:uuid:aacc038e-75f0-4ae4-ab47-e4d5f6c5a5ee",
      "version": 1,
      "content_hash": "sha256:e7735a1bbb8936770ad906d0e09f84689d5cb8c8a9a8511101955a4554ecb18d"
    },
    "scientific_correctness_certified": false,
    "independent_expert_calibration": false,
    "method": "PROPRIETARY",
    "points": "350000"
  },
  "canonical_agent_submission": false,
  "scientific_verification_awarded": false,
  "reader_guide": null,
  "reading_status": "SOURCE_LINKED_NOTE"
}