Cited in
(only showing first 100 items - show all)- Advances in Cryptology – CRYPTO 2004
- scientific article; zbMATH DE number 1852141 (Why is no real title available?)
- Efficient verification of Tunnell's criterion
- A fast, rigorous technique for computing the regulator of a real quadratic field
- The sum of binomial coefficients and integer factorization
- On functional graphs of quadratic polynomials
- Computing quadratic function fields with high 3-rank via cubic field tabulation
- Authenticated hash tables based on cryptographic accumulators
- Computing the number of points on genus 3 hyperelliptic curves of type \(Y^2 = X^7 + aX\) over finite prime fields
- Improved lattice enumeration algorithms by primal and dual reordering methods
- scientific article; zbMATH DE number 2034383 (Why is no real title available?)
- 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
- Implementing Gentry's fully-homomorphic encryption scheme
- Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance
- Symbolic trisection polynomials for genus 2 curves in odd characteristic
- Sato-Tate distributions
- Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields
- Rethinking low genus hyperelliptic Jacobian arithmetic over binary fields: interplay of field arithmetic and explicit formulæ
- When Stream Cipher Analysis Meets Public-Key Cryptography
- A framework for generating some discrete sets with disjoint components by using uniform distributions
- A Primal Barvinok Algorithm Based on Irrational Decompositions
- A design and an implementation of an inverse kinematics computation in robotics using Gröbner bases
- Non-standard approaches to integer programming
- The distance to an irreducible polynomial. II
- On constant-time QC-MDPC decoders with negligible failure rate
- Taking roots over high extensions of finite fields
- Rigorous and Efficient Short Lattice Vectors Enumeration
- Decorating tokens to facilitate recognition of ambiguous language constructs
- Effective lattice point counting in rational convex polytopes
- Explicit computation of isomorphisms between finite fields
- An implementation of parallel number-theoretic transform using Intel AVX-512 instructions
- Advances in Cryptology - EUROCRYPT 2004
- Column basis reduction and decomposable knapsack problems
- On the distribution of the Picard ranks of the reductions of a \(K3\) surface
- Partial Key Exposure Attacks on RSA up to Full Size Exponents
- Simultaneous modular reduction and Kronecker substitution for small finite fields
- On computing the entropy of braids
- Advances in Cryptology - CRYPTO 2003
- Construction of hyperelliptic function fields of high three-rank
- Coppersmith's lattices and ``focus groups: an attack on small-exponent RSA
- Simplification of the Lattice Based Attack of Boneh and Durfee for RSA Cryptoanalysis
- Algorithmic Number Theory
- Kedlaya's Algorithm in Larger Characteristic
- Algorithmic Number Theory
- Improving the algorithms of Berlekamp and Niederreiter for factoring polynomials over finite fields
- Cryptanalysis of NTRU where the private polynomial has one or more consecutive zero coefficients
- The better bound of private key in RSA with unbalanced primes
- Utilisation des modules de Drinfeld en cryptologie. (Using Drinfeld modules in cryptology)
- Practically efficient secure single-commodity multi-market auctions
- Genus 2 point counting over prime fields
- NFLlib: NTT-Based Fast Lattice Library
- Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures
- Code Generation for Polynomial Multiplication
- 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
- Algorithmic detection of hypercircles
- Constructing Carmichael numbers through improved subset-product algorithms
- Fast arithmetics in Artin-Schreier towers over finite fields
- Analysis of DeepBKZ reduction for finding short lattice vectors
- Blind polynomial evaluation and data trading
- Probability method for cryptanalysis of general multivariate modular linear equation
- Faster polynomial multiplication via multipoint Kronecker substitution
- Faster Multiplication in GF(2)[x]
- Faster repeated doublings on binary elliptic curves
- Binary Kloosterman sums with value 4
- The 2-Adic CM Method for Genus 2 Curves with Application to Cryptography
- Algorithm 910: A portable C++ multiple-precision system for special-function calculations
- Constructing elliptic curves over finite fields using double eta-quotients
- Improvement of lattice-based cryptography using CRT
- Self-dual DeepBKZ for finding short lattice vectors
- A hybrid method for quantum global optimization
- Fast computation of Hermite normal forms of random integer matrices
- On division polynomial PIT and supersingularity
- Dynamic self-dual DeepBKZ lattice reduction with free dimensions and its implementation
- Solving very sparse rational systems of equations
- Generic bivariate multi-point evaluation, interpolation and modular composition with precomputation
- Computing the endomorphism ring of an ordinary elliptic curve over a finite field
- Full Lattice Basis Reduction on Graphics Cards
- The automorphism conjecture for small sets and series parallel sets
- Divisors in residue classes, constructively
- Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits
- Software speed records for lattice-based signatures
- An algebraic attack on the improved summation generator with 2-bit memory
- A new polynomial-time variant of LLL with deep insertions for decreasing the squared-sum of Gram-Schmidt lengths
- Polynomials with Height 1 and Prescribed Vanishing at 1
- Deterministic polynomial-time equivalence of computing the RSA secret key and factoring
- Predicting Lattice Reduction
- 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
- Lattice polly cracker cryptosystems
- Fast modular algorithms for squarefree factorization and Hermite integration
- Discrete logarithm problem in GH and XTR scheme
- Accelerating Pollard's rho algorithm on finite fields
- Impact of Intel's new instruction sets on software implementation of \(GF(2)[x]\) multiplication
- Fast convolutions meet Montgomery
- MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity
- Polynomials with frobenius galois groups
- A search for Wilson primes
- Implementations of efficient univariate polynomial matrix algorithms and application to bivariate resultants
This page was built for software: NTL
