NTL

swMATH638MaRDI QIDQ13393FDOQ13393

Author name not available (Why is that?)

Described by source

• High performance implementation of factoring multivariate polynomials based on NTL

Cited In (only showing first 100 items - show all)

• 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
• The sum of binomial coefficients and integer factorization
• Title not available (Why is that?)
• Rethinking low genus hyperelliptic Jacobian arithmetic over binary fields: interplay of field arithmetic and explicit formulæ
• Characterization and classification of optimal LCD codes
• Computational schemes for subresultant chains
• On the complexity and parallel implementation of Hensel's lemma and Weierstrass preparation
• Non-standard approaches to integer programming
• Explicit computation of isomorphisms between finite fields
• Column basis reduction and decomposable knapsack problems
• Simultaneous modular reduction and Kronecker substitution for small finite fields
• The better bound of private key in RSA with unbalanced primes
• Utilisation des modules de Drinfeld en cryptologie. (Using Drinfeld modules in cryptology)
• Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures
• Probability method for cryptanalysis of general multivariate modular linear equation
• Faster polynomial multiplication via multipoint Kronecker substitution
• Binary Kloosterman sums with value 4
• Improvement of lattice-based cryptography using CRT
• Divisors in residue classes, constructively
• On division polynomial PIT and supersingularity
• The automorphism conjecture for small sets and series parallel sets
• Polynomials with Height 1 and Prescribed Vanishing at 1
• Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits
• MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity
• Counting Points in Medium Characteristic Using Kedlaya's Algorithm
• Algorithms for structured linear systems solving and their implementation
• On the minimum weights of binary linear complementary dual codes
• Computing discrete logarithms in the Jacobian of high-genus hyperelliptic curves over even characteristic finite fields
• Constructive and destructive use of compilers in elliptic curve cryptography
• A multimodular algorithm for computing Bernoulli numbers
• Cryptanalysis of a quadratic compact knapsack public-key cryptosystem
• Faster integer multiplication using plain vanilla FFT primes
• Double precision rational approximation algorithms for the standard normal first and second order loss functions
• An improved real-quadratic-field-based key exchange procedure
• Ten new primitive binary trinomials
• A cache-friendly truncated FFT
• Lattice-based fault attacks on deterministic signature schemes of ECDSA and EdDSA
• Double precision rational approximation algorithm for the inverse standard normal first order loss function
• Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures
• Cryptanalysis of the GGH cryptosystem
• Cryptographic protocols on real hyperelliptic curves
• Combinatorial and experimental methods for approximate point pattern matching
• Cryptanalysis of Short Exponent RSA with Primes Sharing Least Significant Bits
• TAN classifiers based on decomposable distributions
• Efficient lattice assessment for LCG and GLP parameter searches
• Counting solutions to some polynomial equations over finite fields
• Cryptographic aspects of real hyperelliptic curves
• A relative van Hoeij algorithm over number fields
• Effects of Optimizations for Software Implementations of Small Binary Field Arithmetic
• Faster arithmetic for number-theoretic transforms
• Eta pairing computation on general divisors over hyperelliptic curves \(y^2=x^p - x+d\)
• Gröbner bases for public key cryptography
• Explicit formulas for real hyperelliptic curves of genus 2 in affine representation
• Optimization techniques for small matrix multiplication
• Algorithms and Computation
• A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
• Algorithmic Number Theory
• Implementing exact real arithmetic in python, C++ and C
• Title not available (Why is that?)
• 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
• Software speed records for lattice-based signatures
• Computing generator in cyclotomic integer rings. A subfield algorithm for the principal ideal problem in \(L_{|\varDelta_\mathbb {K}|}\left(\frac{1}{2}\right)\) and application to the cryptanalysis of a FHE scheme
• 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
• Verifiable pattern matching on outsourced texts
• Verifiable pattern matching on outsourced texts
• Public Key Cryptography - PKC 2006
• An experimental study of Kannan's embedding technique for the search LWE problem
• Practical fast algorithm for finite field arithmetics using group rings
• Cryptanalysis of the knapsack generator
• Handbook of floating-point arithmetic
• Computing in degree \(2^k\)-extensions of finite fields of odd characteristic
• Title not available (Why is that?)
• The rank-based cryptography library
• Lattice-based algorithms for number partitioning in the hard phase
• Security analysis of multilinear maps over the integers
• Fast polynomial inversion for post quantum QC-MDPC cryptography
• An improvement of multi-exponentiation with encrypted bases argument: smaller and faster
• On dual lattice attacks against small-secret LWE and parameter choices in HElib and SEAL
• 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
• Practical cryptanalysis of a public-key encryption scheme based on new multivariate quadratic assumptions
• Cryptanalysis of a homomorphic encryption scheme over integers

This page was built for software: NTL