NTL
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits
- Constructive and destructive use of compilers in elliptic curve cryptography
- Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures
- A cache-friendly truncated FFT
- FFLAS-FFPACK
- FLINT
- Givaro
- gmp
- gTybalt
- IBM Scratchpad
- LiDIA
- LinBox
- Magma
- Mathemagix
- PARI/GP
- LEDAcrypt
- G6K
- SACLIB
- ALTRAN
- The better bound of private key in RSA with unbalanced primes
- Utilisation des modules de Drinfeld en cryptologie. (Using Drinfeld modules in cryptology)
- iB4e
- McEliece
- MIST
- KASUMI
- HECC
- On division polynomial PIT and supersingularity
- The point decomposition problem over hyperelliptic curves, Toward efficient computation of discrete logarithms in even characteristic
- Verifiable pattern matching on outsourced texts
- Practical fast algorithm for finite field arithmetics using group rings
- TAN classifiers based on decomposable distributions
- Sparse polynomial arithmetic with the BPAS library
- xrc
- modpn
- ELLFF
- Combinatorial and experimental methods for approximate point pattern matching
- ECPP
- Lattice-based algorithms for number partitioning in the hard phase
- CADO-NFS
- Functional encryption for cubic polynomials and implementation
- Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields
- Coppersmith's lattices and ``focus groups: an attack on small-exponent RSA
- Analysis of DeepBKZ reduction for finding short lattice vectors
- BPAS
- Fast polynomial inversion for post quantum QC-MDPC cryptography
- An improvement of multi-exponentiation with encrypted bases argument: smaller and faster
- symamd
- mwrank
- A polynomial-time algorithm for solving the hidden subset sum problem
- Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\)
- Improved lattice enumeration algorithms by primal and dual reordering methods
- An implementation of parallel number-theoretic transform using Intel AVX-512 instructions
- Algorithm 885
- Blind polynomial evaluation and data trading
- Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance
- mpFq
- Solving the search-LWE problem over projected lattices
- HElib
- Lattice-based fault attacks on deterministic signature schemes of ECDSA and EdDSA
- The rank-based cryptography library
- CFS
- On the minimum weights of binary linear complementary dual codes
- PBC Library
- gf2x
- Predicting truncated multiple recursive generators with unknown parameters
- Flattening NTRU for evaluation key free homomorphic encryption
- Self-dual DeepBKZ for finding short lattice vectors
- SPQR_RANK
- COLMOD
- DeepLLL
- PotLLL
- BKZ
- On constant-time QC-MDPC decoders with negligible failure rate
- Dynamic self-dual DeepBKZ lattice reduction with free dimensions and its implementation
- Double precision rational approximation algorithms for the standard normal first and second order loss functions
- Computing in degree \(2^k\)-extensions of finite fields of odd characteristic
- Block-Krylov techniques in the context of sparse-FGLM algorithms
- Q-extension
- A new polynomial-time variant of LLL with deep insertions for decreasing the squared-sum of Gram-Schmidt lengths
- NesSomos
- SWIFFT
- NTRU
- ETRU
- MaTRU
- NTRUSign
- Polynomial evaluation and interpolation on special sets of points
- Cryptanalysis of a quadratic compact knapsack public-key cryptosystem
- Computing the endomorphism ring of an ordinary elliptic curve over a finite field
- Fast algorithms for computing isogenies between ordinary elliptic curves in small characteristic
- Faster arithmetic for number-theoretic transforms
- Double precision rational approximation algorithm for the inverse standard normal first order loss function
- Fast computation of special resultants
- Improving the algorithms of Berlekamp and Niederreiter for factoring polynomials over finite fields
- SoftFloat
- Cryptanalysis of ISO/IEC 9796-1
- Constructing elliptic curves over finite fields using double eta-quotients
- The field descent method
- Fast LLL-type lattice reduction
- The automorphism conjecture for small sets and series parallel sets
- An improved real-quadratic-field-based key exchange procedure
This page was built for software: NTL
