NTL
From MaRDI portal
Software:13393
swMATH638MaRDI QIDQ13393FDOQ13393
Author name not available (Why is that?)
Cited In (only showing first 100 items - show all)
- Parallel Implementation of BDD Enumeration for LWE
- Improved lattice enumeration algorithms by primal and dual reordering methods
- Sato-Tate distributions
- Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance
- Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields
- An implementation of parallel number-theoretic transform using Intel AVX-512 instructions
- On the distribution of the Picard ranks of the reductions of a \(K3\) surface
- Coppersmith's lattices and ``focus groups: an attack on small-exponent RSA
- Improving the algorithms of Berlekamp and Niederreiter for factoring polynomials over finite fields
- Constructing Carmichael numbers through improved subset-product algorithms
- Analysis of DeepBKZ reduction for finding short lattice vectors
- Blind polynomial evaluation and data trading
- Generic bivariate multi-point evaluation, interpolation and modular composition with precomputation
- Self-dual DeepBKZ for finding short lattice vectors
- Dynamic self-dual DeepBKZ lattice reduction with free dimensions and its implementation
- A new polynomial-time variant of LLL with deep insertions for decreasing the squared-sum of Gram-Schmidt lengths
- Polynomials with frobenius galois groups
- A search for Wilson primes
- Arithmetic Software Libraries
- Practical Cryptanalysis of a Public-Key Encryption Scheme Based on New Multivariate Quadratic Assumptions
- Verifiable pattern matching on outsourced texts
- Public Key Cryptography - PKC 2006
- On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL
- Practical fast algorithm for finite field arithmetics using group rings
- Computing in degree \(2^k\)-extensions of finite fields of odd characteristic
- Title not available (Why is that?)
- The rank-based cryptography library
- PAKEs: New Framework, New Techniques and More Efficient Lattice-Based Constructions in the Standard Model
- Lattice-based algorithms for number partitioning in the hard phase
- Verifiable Pattern Matching on Outsourced Texts
- Fast polynomial inversion for post quantum QC-MDPC cryptography
- An improvement of multi-exponentiation with encrypted bases argument: smaller and faster
- The point decomposition problem over hyperelliptic curves, Toward efficient computation of discrete logarithms in even characteristic
- Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\)
- Sparse polynomial arithmetic with the BPAS library
- Explicit Hard Instances of the Shortest Vector Problem
- Block-Krylov techniques in the context of sparse-FGLM algorithms
- Generating Large Instances of the Gong-Harn Cryptosystem
- An Experimental Study of Kannan’s Embedding Technique for the Search LWE Problem
- Cryptanalysis of the Knapsack Generator
- Predicting truncated multiple recursive generators with unknown parameters
- Key Agreement from Close Secrets over Unsecured Channels
- Handbook of Floating-Point Arithmetic
- Security Analysis of Multilinear Maps over the Integers
- Flattening NTRU for evaluation key free homomorphic encryption
- Software Speed Records for Lattice-Based Signatures
- Solving the search-LWE problem over projected lattices
- \textsf{Catalic}: delegated PSI cardinality with applications to contact tracing
- Cryptanalysis of a Homomorphic Encryption Scheme Over Integers
- Functional encryption for cubic polynomials and implementation
- Parallelization of triangular decompositions: techniques and implementation
- A polynomial-time algorithm for solving the hidden subset sum problem
- Advances in Cryptology – CRYPTO 2004
- Computing Generator in Cyclotomic Integer Rings
- When Stream Cipher Analysis Meets Public-Key Cryptography
- A Primal Barvinok Algorithm Based on Irrational Decompositions
- Computing quadratic function fields with high 3-rank via cubic field tabulation
- Authenticated hash tables based on cryptographic accumulators
- A framework for generating some discrete sets with disjoint components by using uniform distributions
- Rigorous and Efficient Short Lattice Vectors Enumeration
- Taking roots over high extensions of finite fields
- On constant-time QC-MDPC decoders with negligible failure rate
- Advances in Cryptology - EUROCRYPT 2004
- 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
- Kedlaya's Algorithm in Larger Characteristic
- Algorithmic Number Theory
- On computing the entropy of braids
- An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks
- NFLlib: NTT-Based Fast Lattice Library
- Genus 2 point counting over prime fields
- Lower order terms in the full moment conjecture for the Riemann zeta function
- Fair and distributed peer-to-peer allocation of a common, refillable resource
- Faster Multiplication in GF(2)[x]
- Algorithmic detection of hypercircles
- Fast arithmetics in Artin-Schreier towers over finite fields
- The 2-Adic CM Method for Genus 2 Curves with Application to Cryptography
- Lattice Reformulation Cuts
- Practical Divide-and-Conquer Algorithms for Polynomial Arithmetic
- Constructing elliptic curves over finite fields using double eta-quotients
- Variants of Mersenne Twister Suitable for Graphic Processors
- Computing the endomorphism ring of an ordinary elliptic curve over a finite field
- Fast computation of Hermite normal forms of random integer matrices
- A hybrid method for quantum global optimization
- Predicting Lattice Reduction
- Fast modular algorithms for squarefree factorization and Hermite integration
- An algebraic attack on the improved summation generator with 2-bit memory
- Deterministic polynomial-time equivalence of computing the RSA secret key and factoring
- Lattice polly cracker cryptosystems
- Accelerating Pollard's rho algorithm on finite fields
- Impact of Intel's new instruction sets on software implementation of \(GF(2)[x]\) multiplication
- A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
- Polynomials with Restricted Coefficients and Prescribed Noncyclotomic Factors
- Title not available (Why is that?)
- Using modifications to Grover's search algorithm for quantum global optimization
- Deterministic root finding over finite fields using Graeffe transforms
- Homomorphic AES evaluation using the modified LTV scheme
This page was built for software: NTL