NTL

NTL is a high-performance, portable C++ library providing data structures and algorithms for manipulating signed, arbitrary length integers, and for vectors, matrices, and polynomials over the integers and over finite fields.

This software is also referenced in ORMS.

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 200 articles , 1 standard article )

Showing results 1 to 20 of 200.
Sorted by year (citations)

1 2 3 ... 8 9 10 next

  1. Araya, Makoto; Harada, Masaaki: On the minimum weights of binary linear complementary dual codes (2020)
  2. Doröz, Yarkın; Sunar, Berk: Flattening NTRU for evaluation key free homomorphic encryption (2020)
  3. Hyun, Seung Gyu; Neiger, Vincent; Rahkooy, Hamid; Schost, Éric: Block-Krylov techniques in the context of sparse-FGLM algorithms (2020)
  4. Sun, Hong-Yu; Zhu, Xuan-Yong; Zheng, Qun-Xiong: Predicting truncated multiple recursive generators with unknown parameters (2020)
  5. Yasuda, Masaya: Self-dual DeepBKZ for finding short lattice vectors (2020)
  6. Yasuda, Masaya; Nakamura, Satoshi; Yamaguchi, Junpei: Analysis of DeepBKZ reduction for finding short lattice vectors (2020)
  7. Harvey, David; van der Hoeven, Joris: Faster integer multiplication using plain vanilla FFT primes (2019)
  8. Hyun, Seung Gyu; Neiger, Vincent; Schost, Éric: Implementations of efficient univariate polynomial matrix algorithms and application to bivariate resultants (2019)
  9. Mans, Bernard; Sha, Min; Shparlinski, Igor E.; Sutantyo, Daniel: On functional graphs of quadratic polynomials (2019)
  10. Sutherland, Andrew V.: Sato-Tate distributions (2019)
  11. Yasuda, Masaya; Yamaguchi, Junpei: A new polynomial-time variant of LLL with deep insertions for decreasing the squared-sum of Gram-Schmidt lengths (2019)
  12. Asadi, Mohammadali; Brandt, Alexander; Moir, Robert H. C.; Moreno Maza, Marc: Sparse polynomial arithmetic with the BPAS library (2018)
  13. Catalano, Dario; Di Raimondo, Mario; Faro, Simone: Verifiable pattern matching on outsourced texts (2018)
  14. Doliskani, Javad: On division polynomial PIT and supersingularity (2018)
  15. Faugère, Jean-Charles; Wallet, Alexandre: The point decomposition problem over hyperelliptic curves, Toward efficient computation of discrete logarithms in even characteristic (2018)
  16. Muller, Jean-Michel; Brunie, Nicolas; de Dinechin, Florent; Jeannerod, Claude-Pierre; Joldes, Mioara; Lefèvre, Vincent; Melquiond, Guillaume; Revol, Nathalie; Torres, Serge: Handbook of floating-point arithmetic (2018)
  17. Riquelme, Edgardo; Thériault, Nicolas: Symbolic trisection polynomials for genus 2 curves in odd characteristic (2018)
  18. Wang, Yuntao; Aono, Yoshinori; Takagi, Tsuyoshi: An experimental study of Kannan’s embedding technique for the search LWE problem (2018)
  19. Albrecht, Martin R.: On dual lattice attacks against small-secret LWE and parameter choices in HElib and SEAL (2017)
  20. Biasse, Jean-François; Espitau, Thomas; Fouque, Pierre-Alain; Gélin, Alexandre; Kirchner, Paul: Computing generator in cyclotomic integer rings. A subfield algorithm for the principal ideal problem in (L_|\varDelta_\mathbbK|\left(\frac12\right)) and application to the cryptanalysis of a FHE scheme (2017)

1 2 3 ... 8 9 10 next