swMATH638MaRDI QIDQ13393FDOQ13393
Author name not available (Why is that?)
Official website: http://www.shoup.net/ntl/
Cited In (only showing first 100 items - show all)
- Implementing Gentry's fully-homomorphic encryption scheme
- Computing quadratic function fields with high 3-rank via cubic field tabulation
- Authenticated hash tables based on cryptographic accumulators
- On constant-time QC-MDPC decoders with negligible failure rate
- Partial Key Exposure Attacks on RSA up to Full Size Exponents
- Effective lattice point counting in rational convex polytopes
- Advances in Cryptology - CRYPTO 2003
- Construction of hyperelliptic function fields of high three-rank
- Algorithmic Number Theory
- NFLlib: NTT-Based Fast Lattice Library
- Fair and distributed peer-to-peer allocation of a common, refillable resource
- Fast computation of Hermite normal forms of random integer matrices
- Title not available (Why is that?)
- FFLAS-FFPACK
- FLINT
- Givaro
- gmp
- gTybalt
- IBM Scratchpad
- LiDIA
- LinBox
- Magma
- McEliece
- xrc
- ELLFF
- modpn
- ECPP
- CADO-NFS
- Polynomial evaluation and interpolation on special sets of points
- BPAS
- mwrank
- Algorithm 885
- symamd
- mpFq
- HElib
- CFS
- gf2x
- PBC Library
- COLMOD
- BKZ
- DeepLLL
- PotLLL
- SPQR_RANK
- Q-extension
- NesSomos
- ETRU
- MaTRU
- NTRU
- NTRUSign
- SWIFFT
- SoftFloat
- fpLLL
- Echidna
- NFLlib
- CAMPARY
- strongSwan
- zn_poly
- FLIP
- CR-LIBM
- ring-LWE
- Audi
- e_float
- boolfun
- CrypTool
- MatPack
- VBF
- VBFlib
- ADSNARK
- Rings
- fhe
- PSAGE
- doubledouble
- DPE
- Sage++
- PyUnit
- Code Tables
- fpylll
- openf4
- Lgp
- Algorithm 959
- The \texttt{modpn} library: bringing fast polynomial arithmetic into \texttt{Maple}
- ETRU: NTRU over the Eisenstein integers
- Helios
- Fast Library for Number Theory: An Introduction
- Libgcrypt
- Backflip
- msolve
- Database of Polynomial Systems
- SWiM
- Tabulation of cubic function fields via polynomial binary cubic forms
- MultivariatePowerSeries
- Gtybalt-a free computer algebra system
- Algebraic Statistics for Computational Biology
- How to implement a modular form
- The Sage project: unifying free mathematical software to create a viable alternative to Magma, Maple, Mathematica and Matlab
- Experimental data for Goldfeld's conjecture over function fields
- Variants of Mersenne Twister suitable for graphic processors
- Efficient verification of Tunnell's criterion
- A fast, rigorous technique for computing the regulator of a real quadratic field
- On functional graphs of quadratic polynomials
This page was built for software: NTL
