The following pages link to (Q4273681):
Displaying 16 items.
- Generation of Elements with Small Modular Squares and Provably Fast Integer Factoring Algorithms (Q5202277) (← links)
- Root optimization of polynomials in the number field sieve (Q5264135) (← links)
- Reduction of Huge, Sparse Matrices over Finite Fields Via Created Catastrophes (Q5285856) (← links)
- When e-th Roots Become Easier Than Factoring (Q5387090) (← links)
- Computing algebraic numbers of bounded height (Q5501149) (← links)
- Short Generators Without Quantum Computers: The Case of Multiquadratics (Q5738870) (← links)
- Computation of a 768-Bit Prime Field Discrete Logarithm (Q5738876) (← links)
- Finding smooth integers in short intervals using CRT decoding (Q5894822) (← links)
- Mathematical etudes on quantum computation (Q6049765) (← links)
- Fast norm computation in smooth-degree abelian number fields (Q6142769) (← links)
- Fast multiquadratic S-unit computation and application to the calculation of class groups (Q6165859) (← links)
- Higher-dimensional sieving for the number field sieve algorithms (Q6165871) (← links)
- Quantum computation: algorithms and applications (Q6490574) (← links)
- We are on the same side. Alternative sieving strategies for the number field sieve (Q6604871) (← links)
- Finding orientations of supersingular elliptic curves and quaternion orders (Q6632044) (← links)
- Limits on the power of prime-order groups: separating Q-type from static assumptions (Q6652960) (← links)
