The following pages link to (Q4273681):
Displaying 50 items.
- Solution of polynomial equations in the field of algebraic numbers (Q263314) (← links)
- On sharp transitions in making squares (Q431647) (← links)
- An integrated parallel GNFS algorithm for integer factorization based on linbox montgomery block Lanczos method over \(GF(2)\) (Q604101) (← links)
- One approach to factorization of positive integers (Q647854) (← links)
- Optimal strong primes (Q834990) (← links)
- A review on the isomorphism classes of hyperelliptic curves of genus 2 over finite fields admitting a Weierstrass point (Q850776) (← links)
- On fixed points of permutations. (Q1024810) (← links)
- Factoring integers with elliptic curves (Q1093665) (← links)
- Comparison of the efficiency of the factoring algorithms of Morrison-Brillhart and Schroeppel (Q1172079) (← links)
- Modifications to the number field sieve (Q1310453) (← links)
- Bounds for fixed point free elements in a transitive group and applications to curves over finite fields (Q1380508) (← links)
- Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms (Q1737153) (← links)
- Rigorous analysis of a randomised number field sieve (Q1747213) (← links)
- Approximating rings of integers in number fields (Q1805356) (← links)
- Function field sieve method for discrete logarithms over finite fields (Q1854276) (← links)
- On the oracle complexity of factoring integers (Q1918949) (← links)
- Updating key size estimations for pairings (Q2010589) (← links)
- Short principal ideal problem in multicubic fields (Q2023319) (← links)
- Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment (Q2096516) (← links)
- Computing the endomorphism ring of an ordinary abelian surface over a finite field (Q2420398) (← links)
- Automating algorithm selection: checking for matrix properties that can simplify computations (Q2422701) (← links)
- Splitting quaternion algebras over quadratic number fields (Q2422710) (← links)
- An \(L(1/3)\) discrete logarithm algorithm for low degree curves (Q2429709) (← links)
- Computing the endomorphism ring of an ordinary elliptic curve over a finite field (Q2430982) (← links)
- Resource bounded symmetry of information revisited (Q2575757) (← links)
- Integer factorization as subset-sum problem (Q2700674) (← links)
- A survey on the number field sieve (Q2707574) (← links)
- Using Lucas sequences to factor large integers near group orders. (Q2735219) (← links)
- An Implementation of the Number Field Sieve (Q2785383) (← links)
- Better polynomials for GNFS (Q2792346) (← links)
- Post-Quantum Cryptography: State of the Art (Q2803619) (← links)
- The distribution of solutions to \(XN=N \pmod a\) with an application to factoring integers (Q2855585) (← links)
- Factorization of Square-Free Integers with High Bits Known (Q2876970) (← links)
- A one line factoring algorithm (Q2898887) (← links)
- RSA and Elliptic Curve Least Significant Bit Security (Q2946472) (← links)
- Quantum algorithms for algebraic problems (Q3077033) (← links)
- The Factorization of the Ninth Fermat Number (Q3137471) (← links)
- Square Root Algorithms for the Number Field Sieve (Q3166983) (← links)
- On polynomial selection for the general number field sieve (Q3420245) (← links)
- Running Time Predictions for Factoring Algorithms (Q3502724) (← links)
- The number field sieve for integers of low weight (Q3584792) (← links)
- Algorithms in Algebraic Number Theory (Q4005808) (← links)
- A Rigorous Time Bound for Factoring Integers (Q4019632) (← links)
- New applications of the polynomial method: The cap set conjecture and beyond (Q4562036) (← links)
- Factoring Numbers with Conway’s 150 Method (Q4581730) (← links)
- Integer Factoring Using Small Algebraic Dependencies (Q4608563) (← links)
- Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method (Q4794653) (← links)
- On the coefficients of the polynomial in the number field sieve (Q5046489) (← links)
- Attacking RSA Using an Arbitrary Parameter (Q5048985) (← links)
- A log-log speedup for exponent one-fifth deterministic integer factorisation (Q5070544) (← links)
