fplll

{
  "aliases": [],
  "alternatives": [],
  "build_dependencies": [
    "automake"
  ],
  "categories": [],
  "caveats": null,
  "conflicts_with": [],
  "dependencies": [
    "gmp",
    "mpfr"
  ],
  "deprecated": 0,
  "deprecation_reason": null,
  "desc": "Lattice algorithms using floating-point arithmetic",
  "disable_reason": null,
  "disabled": 0,
  "enrichment_fetched_at": "2026-06-20T23:37:47+00:00",
  "first_seen": "2026-06-20T23:34:18+00:00",
  "full_name": "fplll",
  "github_default_branch": "master",
  "github_last_commit_at": "2025-10-15T18:41:26Z",
  "github_readme_excerpt": "# fplll #\n\n[![Build Status](https://github.com/fplll/fplll/workflows/Tests/badge.svg)](https://github.com/fplll/fplll/actions?query=workflow%3ATests) [![codecov](https://codecov.io/gh/fplll/fplll/branch/master/graph/badge.svg)](https://codecov.io/gh/fplll/fplll)\n\n\nfplll contains implementations of several lattice algorithms. The implementation relies on floating-point orthogonalization, and LLL [[LLL82](#LLL82)] is central to the code, hence the name.\n\nIt includes implementations of floating-point LLL reduction algorithms [[NS09](#NS09),[MSV09](#MSV09)], offering different speed/guarantees ratios. It contains a \u0027wrapper\u0027 choosing the estimated best sequence of variants in order to provide a guaranteed output as fast as possible [[S09](#S09)]. In the case of the wrapper, the succession of variants is oblivious to the user. \n\nIt includes an implementation of the BKZ reduction algorithm [[SE94](#SE94)], including the BKZ-2.0 [[CN11](#CN11)] improvements (extreme enumeration pruning, pre-processing of blocks, early termination). Additionally, Slide reduction [[GN08](#GN08)] and self dual BKZ [[MW16](#MW16)] are supported. \n\nIt also includes a floating-point implementation of the Kannan-Fincke-Pohst algorithm [[K83](#K83),[FP85](#FP85)] that finds a shortest non-zero lattice vector. Finally, it contains a variant of the enumeration algorithm that computes a lattice vector closest to a given vector belonging to the real span of the lattice.\n\nfplll is distributed under the [GNU Lesser General Public License](COPYING) (either version 2.1 of the License, or, at your option, any later version) as published by the Free Software Foundation.\n\n## How to cite ##\n\n\t@unpublished{fplll,\n\t    author = {The {FPLLL} development team},\n\t    title = {{fplll}, a lattice reduction library, {Version}: 5.5.0},\n\t    year = 2023,\n\t    note = {Available at \\url{https://github.com/fplll/fplll}},\n\t    url = {https://github.com/fplll/fplll}\n\t}\n\n\n# Table of contents #\n\n  * [fplll](#fplll)\n    * [How",
  "github_repo": "fplll/fplll",
  "github_stars": 405,
  "github_topics": [
    "lattice-based-crypto",
    "lattice-reduction",
    "mathematics"
  ],
  "homepage": "https://github.com/fplll/fplll",
  "homepage_og_description": null,
  "homepage_og_image": null,
  "homepage_title": null,
  "installs_30d": 37,
  "installs_365d": 385,
  "installs_90d": 91,
  "keg_only": 0,
  "keg_only_reason": null,
  "last_seen": "2026-06-20T23:34:18+00:00",
  "license": "LGPL-2.1-or-later",
  "llm_generated_at": null,
  "llm_model": null,
  "name": "fplll",
  "oldnames": [],
  "one_liner": null,
  "optional_dependencies": [],
  "rank_30d": 5375,
  "rank_365d": 5708,
  "rank_90d": 5820,
  "raw_hash": "76f674f249bb3fd3",
  "recommended_dependencies": [],
  "revision": 0,
  "ruby_source_path": "Formula/f/fplll.rb",
  "tap": "homebrew/core",
  "test_dependencies": [
    "pkgconf"
  ],
  "uses_from_macos": [],
  "version_head": null,
  "version_stable": "5.5.0",
  "versioned_formulae": [],
  "why_use_this": null
}