|
flintlib.github.io
|
15–19 June 2026: FLINT workshop in Bordeaux
|
|
sagemath.org
|
Sage
|
|
github.com
|
Nemo
|
|
pypi.org
|
Python-flint
|
|
hackage.haskell.org
|
Flint2
|
|
github.com
|
HFlint
|
|
singular.uni-kl.de
|
Singular
|
|
www2.macaulay2.com
|
Macaulay2
|
|
hcrypt.com
|
Scarab library
|
|
oscar-system.org
|
OSCAR
|
|
research.coe.drexel.edu
|
chmlib
|
|
arblib.org
|
Arb
|
|
fredrikj.net
|
Calcium
|
|
andy.novocin.com
|
Practical divide-and-conquer algorithms for polynomial arithmetic
|
|
arxiv.org
|
Efficient implementation of the Hardy-Ramanujan-Rademacher formula
|
|
arxiv.org
|
A fast algorithm for reversion of power series
|
|
springer.com
|
An introduction to FLINT (pp. 88-91)
|
|
arxiv.org
|
Arb: Efficient
Arbitrary-Precision Midpoint-Radius Interval Arithmetic
|
|
fredrikj.net
|
FLINT 2 benchmarking
|
|
risc.jku.at
|
Fast special function computations with FLINT
|
|
math.fsu.edu
|
Practical polynomial factoring in polynomial time
|
|
issac-symposium.org
|
Algorithms for finite field arithmetic (ISSAC 2015)
|
|
arxiv.org
|
Parallel sparse interpolation using small primes (PASCO 2015)
|
|
arxiv.org
|
Modular SIMD arithmetic in Mathemagix
|
|
arxiv.org
|
There are no two non-real conjugates of a Pisot number with the same imaginary part
|
|
saga-network.eu
|
Fast arithmetic for matrices and polynomials in Mathemagix
|
|
cs.berkeley.edu
|
Can you save time in multiplying polynomials by encoding them as
integers?
|
|
usna.edu
|
Algorithm implementations in a software library
|
|
eprint.iacr.org
|
Practical Cryptanalysis of ISO/IEC 9796-2 and EMV Signatures
|
|
doi.org
|
A cache-friendly truncated FFT
|
|
hindawi.com
|
Techniques for Performance Improvement of Integer Multiplication in Cryptographic
Applications
|
|
eudml.org
|
Relaxed algorithms for p-adic numbers
|
|
erocal.org
|
Nullspace computation over rational function fields for symbolic summation
|
|
arxiv.org
|
Experimental evidence for Maeda's conjecture on modular
forms
|
|
arxiv.org
|
Fast polynomial evaluation and composition
|
|
arxiv.org
|
HLinear: Exact Dense Linear
Algebra in Haskell
|
|
link.springer.com
|
Complete
addition law for Montgomery curves
|
|
hal.inria.fr
|
SPASS-SATT A CDCL(LA)
Solver
|
|
link.springer.com
|
Sparse
polynomial arithmetic with the BPAS library
|
|
link.springer.com
|
Function-Hiding
Inner Product Encryption Is Practical
|
|
link.springer.com
|
An
Efficient Abstract Domain for Not Necessarily Closed Polyhedra
|
|
link.springer.com
|
Short,
Invertible Elements in Partially Splitting Cyclotomic Rings and Applications
to Lattice-Based Zero-Knowledge Proofs
|
|
link.springer.com
|
Implementing
Candidate Graded Encoding Schemes from Ideal Lattices
|
|
dl.acm.org
|
Handbook of finite
fields
|
|
emis.de
|
Hyper-Algebras of
Vector-Valued Modular Forms
|
|
dl.acm.org
|
Evaluation of
expression templates in C++14
|
|
inspirehep.net
|
Rings: an efficient
Java/Scala library for polynomial rings
|
|
sciencedirect.com
|
Reconstructing
rational functions with FireFly
|
|
ams.org
|
No
two non-real conjugates of a Pisot number have the same imaginary part
|
|
sciencedirect.com
|
Generating
subfields
|
|
csd.uwo.ca
|
Dense
Arithmetic over Finite Fields with the CUMODP Library
|
|
scitepress.org
|
Privacy Preserving
Data Classification using Inner-product Functional Encryption
|
|
hindawi.com
|
Improved
Construction for Inner Product Functional Encryption
|
|
www2.mathematik.tu-darmstadt.de
|
Short
proof of Rademacher's formula for partitions
|
|
sciencedirect.com
|
Exterior
powers of the adjoint representation and the Weyl ring of E8
|
|
arxiv.org
|
Beyond the black box
|
|
dl.gi.de
|
ANTIC:
Algebraic Number Theory in C
|
|
cs.potsdam.edu
|
Poster about parallel factorisation
|
|
informatik.uni-bremen.de
|
Talk : Sage for Mathematical and Cryptographic Research
|
|
math.uci.edu
|
Talk : Sage for Number Theorists
|
|
bpaslib.org
|
Basic Polynomial Algebra Subprograms
|
|
orms.mfo.de
|
Oberwolfach References on Mathematical Software.
|
|
wstein.org
|
Talk: Sage : What is on the Horizon - William Stein
|
|
www2.warwick.ac.uk
|
Poster about Factoring Algorithms over Finite Fields
|
|
modular.math.washington.edu
|
Grant Proposal
|
|
numbertheory.org
|
Number Theory Web - Number theory ftp sites/calculator programs/archives
|
|
algo.inria.fr
|
Talk : Fast Integer Multiplication with Schoenhage-Strassen's Algorithm
|
|
en.wikipedia.org
|
Wikipedia Article : Fast Library for Number Theory.
|
|
www2.warwick.ac.uk
|
Poster about Efficiently computing Bernoulli numbers using FLINT
|
|
williamstein.org
|
Grant Proposal
|
|
www2.warwick.ac.uk
|
Poster about Implementing Middle Product in FLINT
|
|
www2.warwick.ac.uk
|
Poster about p-adic Arithmetic
|
|
mate.dm.uba.ar
|
Programas utiles para Mathematica
|
|
prunel.ccsd.cnrs.fr
|
Implementation of new polynomial factoring algorithm
|
|
math.boisestate.edu
|
Methods and implementations for integer factorization (slides)
|
|
stringpedia.bsmithers.co.uk
|
Using the FLINT FFT for (string) pattern matching
|
|
cims.nyu.edu
|
The zn_poly library
|
|
mathematik.uni-kl.de
|
Factory library
|
|
arc.vt.edu
|
Virginia Tech's Advanced
Research Computing
|
|
citeseer.ist.psu.edu
|
Bernstein - Composing power series, especially over ring with small characteristic
|
|
cr.yp.to
|
Kaltofen and Shoup - Probabilistic algorithm for factoring univariate polynomials over a finite field
|
|
citeseer.ist.psu.edu
|
Victor Shoup - A discussion of various factoring algorithms over finite fields
|
|
citeseerx.ist.psu.edu
|
Joris van der Hoeven - Relaxed Multiplication Using the Middle Product
|
|
citeseerx.ist.psu.edu
|
Joris van der Hoeven - New algorithms for relaxed multiplication
|
|
citeseerx.ist.psu.edu
|
Joris van der Hoeven - Relax but don't be too lazy
|
|
perso.ens-lyon.fr
|
Damien Stehle - A very detailed paper describing the many tricks for speeding up LLL in floating point
|
|
scholar.lib.vt.edu
|
A thesis on the general number field sieve
|
|
cr.yp.to
|
Dan Bernstein - A detailed paper describing the algebra of every known multiprecision multiplication algorithm including many FFT tricks
|
|
cr.yp.to
|
Dan Bernstein - A detailed paper describing a very many algorithms for real, padic and multiprecision arithmetic
|
|
primes.utm.edu
|
A very useful page on primality proving
|
|
algo.inria.fr
|
Arnold Schonhage - A paper describing some clever tricks for polynomial division
|
|
ams.org
|
Sam Wagstaff, Jason Gower - Very useful paper on SQUFOF and various heuristics associated with it
|
|
math.uiuc.edu
|
Eric Landquist - Excellent paper by an acquaintance of mine, on the quadratic sieve
|
|
computing.llnl.gov
|
Tutorial on using OpenMP
|
|
springerlink.com
|
Old article on doing exact rational arithmetic with "finite segment" p-adic arithmetic. Better for division than multimodular arithmetic.
|
|
islab.oregonstate.edu
|
Another paper on Hensel codes and finite segment p-adic arithmetic, but not much different to the above.
|
|
ieeexplore.ieee.org
|
A further paper on Hensel codes and finite segment p-adic arithmetic, correcting numerous errors in previous work on the subject.
|
|
ieeexplore.ieee.org
|
Yet another very old paper on Hensel codes, this time with applications to matrix algebra over Q.
|
|
azillionmonkeys.com
|
Paul Hsieh - Excellent description of various algorithms for computing floating point and integer square roots efficiently.
|
|
infsec.cs.uni-sb.de
|
Michael Backes - Masters thesis on univariate polynomial factorisation.
|
MediaWiki
nginx