The following pages link to NTL (Q13393):
Displaying 50 items.
- Computing quadratic function fields with high 3-rank via cubic field tabulation (Q261672) (← links)
- Authenticated hash tables based on cryptographic accumulators (Q262258) (← links)
- Deterministic root finding over finite fields using Graeffe transforms (Q300881) (← links)
- Homomorphic AES evaluation using the modified LTV scheme (Q310240) (← links)
- Practical cryptanalysis of ISO 9796-2 and EMV signatures (Q315558) (← links)
- The \(\mathbb Q\)-curve construction for endomorphism-accelerated elliptic curves (Q321311) (← links)
- Genus 2 point counting over prime fields (Q412199) (← links)
- Algorithmic detection of hypercircles (Q417959) (← links)
- Fast arithmetics in Artin-Schreier towers over finite fields (Q420745) (← links)
- A hybrid method for quantum global optimization (Q427367) (← links)
- Accelerating Pollard's rho algorithm on finite fields (Q431795) (← links)
- Impact of Intel's new instruction sets on software implementation of \(GF(2)[x]\) multiplication (Q436584) (← links)
- ETRU: NTRU over the Eisenstein integers (Q488263) (← links)
- A simple and fast online power series multiplication and its analysis (Q492037) (← links)
- Optimization techniques for small matrix multiplication (Q533859) (← links)
- Simultaneous modular reduction and Kronecker substitution for small finite fields (Q540334) (← links)
- The \texttt{modpn} library: bringing fast polynomial arithmetic into \texttt{Maple} (Q540337) (← links)
- Cryptanalysis of the GGH cryptosystem (Q626951) (← links)
- Cryptographic protocols on real hyperelliptic curves (Q629756) (← links)
- Lattice polly cracker cryptosystems (Q633081) (← links)
- How to implement a modular form (Q651876) (← links)
- Homotopy techniques for multiplication modulo triangular sets (Q651881) (← links)
- Explicit formulas for real hyperelliptic curves of genus 2 in affine representation (Q660084) (← links)
- Non-standard approaches to integer programming (Q697562) (← links)
- Explicit computation of isomorphisms between finite fields (Q700165) (← links)
- Factoring polynomials and the knapsack problem (Q701105) (← links)
- Gtybalt-a free computer algebra system (Q709443) (← links)
- An effective branch-and-bound algorithm for convex quadratic integer programming (Q715081) (← links)
- Implementing exact real arithmetic in python, C++ and C (Q817863) (← links)
- Characterization and classification of optimal LCD codes (Q831153) (← links)
- Computational schemes for subresultant chains (Q831961) (← links)
- On the complexity and parallel implementation of Hensel's lemma and Weierstrass preparation (Q831966) (← links)
- Column basis reduction and decomposable knapsack problems (Q834182) (← links)
- An algebraic attack on the improved summation generator with 2-bit memory (Q834989) (← links)
- Faster polynomial multiplication via multipoint Kronecker substitution (Q840717) (← links)
- Probability method for cryptanalysis of general multivariate modular linear equation (Q848370) (← links)
- Deterministic polynomial-time equivalence of computing the RSA secret key and factoring (Q882779) (← links)
- Fair and distributed peer-to-peer allocation of a common, refillable resource (Q897403) (← links)
- Lower order terms in the full moment conjecture for the Riemann zeta function (Q927705) (← links)
- Eta pairing computation on general divisors over hyperelliptic curves \(y^2=x^p - x+d\) (Q932799) (← links)
- On computing the entropy of braids (Q952228) (← links)
- A framework for generating some discrete sets with disjoint components by using uniform distributions (Q952451) (← links)
- Efficient verification of Tunnell's criterion (Q957686) (← links)
- Fast computation of Hermite normal forms of random integer matrices (Q984852) (← links)
- Using modifications to Grover's search algorithm for quantum global optimization (Q992656) (← links)
- Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits (Q1009176) (← links)
- Constructive and destructive use of compilers in elliptic curve cryptography (Q1015356) (← links)
- Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures (Q1015359) (← links)
- A cache-friendly truncated FFT (Q1029334) (← links)
- The better bound of private key in RSA with unbalanced primes (Q1406195) (← links)
