homepage: https://github.com/bkomuves/finite-fields
changelog-type: ''
hash: bf9e6e2102ac458f38133f892ed9f5358819c28e15f3328e2aa07817a70c3a04
test-bench-deps:
  base: '>=4 && <5'
  tasty-quickcheck: -any
  finite-fields: -any
  tasty-hunit: -any
  random: -any
  tasty: -any
  QuickCheck: '>=2'
maintainer: bkomuves (plus) hackage (at) gmail (dot) com
synopsis: Arithmetic in finite fields
changelog: ''
basic-deps:
  base: '>=4 && <5'
  containers: '>=0.5'
  random: -any
  vector: '>=0.12'
all-versions:
- '0.1'
author: Balazs Komuves
latest: '0.1'
description-type: haddock
description: |-
  Implementation of arithmetic in finite fields (prime fields
  and fields of prime power order). Finite fields are
  ubiquitous in algebraic geometry, number theory and cryptography.
  For now the focus is on relatively small fields,
  but algorithms for big fields (required in cryptography)
  may be added later.
license-name: BSD-3-Clause

homepage: https://github.com/bkomuves/finite-fields
changelog-type: ''
hash: 888bfdb99a5adf5972a8dbab9c9c79c6765a78215f2406610aca1873c0236e43
test-bench-deps:
  base: '>=4 && <5'
  containers: '>=0.5'
  tasty-quickcheck: -any
  finite-fields: -any
  random: -any
  tasty: -any
  QuickCheck: '>=2'
maintainer: bkomuves (plus) hackage (at) gmail (dot) com
synopsis: Arithmetic in finite fields
changelog: ''
basic-deps:
  base: '>=4 && <5'
  containers: '>=0.5'
  random: -any
  vector: '>=0.12'
all-versions:
- '0.1'
- '0.2'
author: Balazs Komuves
latest: '0.2'
description-type: haddock
description: |-
  Implementation of arithmetic in finite fields (prime fields
  and fields of prime power order). Finite fields are
  ubiquitous in algebraic geometry, number theory and cryptography.
  For now the focus is on relatively small fields,
  but algorithms for big fields (required in cryptography)
  may be added later.
license-name: BSD-3-Clause

Update from Hackage at 2021-04-22T21:20:43Z
Update from Hackage at 2021-04-22T21:20:43Z
