The following pages link to Thorsten Kleinjung (Q1758890):
Displaying 30 items.
- Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction (Q1758892) (← links)
- Indiscreet logarithms in finite fields of small characteristic (Q1783724) (← links)
- CSI-FiSh: efficient isogeny based signatures through class group computations (Q2181880) (← links)
- (Q2726222) (← links)
- The Tower Number Field Sieve (Q2795965) (← links)
- Quadratic sieving (Q2796022) (← links)
- Universal Security (Q2867253) (← links)
- Breaking ‘128-bit Secure’ Supersingular Binary Curves (Q2874534) (← links)
- Using the Cloud to Determine Key Strengths (Q2876921) (← links)
- Public Keys (Q2914292) (← links)
- (Q2935593) (← links)
- Mersenne Factorization Factory (Q2938854) (← links)
- Finding ECM-friendly curves through a study of Galois properties (Q2949486) (← links)
- On polynomial selection for the general number field sieve (Q3420245) (← links)
- ECC2K-130 on Cell CPUs (Q3558314) (← links)
- Factorization of a 768-Bit RSA Modulus (Q3582763) (← links)
- On the discrete logarithm problem in finite fields of fixed characteristic (Q4604404) (← links)
- ECM at Work (Q4911602) (← links)
- Some applications of the Weil‐Barner explicit formula (Q4921742) (← links)
- On the Use of the Negation Map in the Pollard Rho Method (Q4931641) (← links)
- Computation of a 30750-bit binary field discrete logarithm (Q4956935) (← links)
- Efficient Modular Arithmetic (Q5034410) (← links)
- Parametrizations for Families of ECM-Friendly Curves (Q5119936) (← links)
- A practical analytic method for calculating $\pi (x)$ (Q5270838) (← links)
- A Kilobit Special Number Field Sieve Factorization (Q5387089) (← links)
- Computation of a 768-Bit Prime Field Discrete Logarithm (Q5738876) (← links)
- Cryptanalysis of the generalised Legendre pseudorandom function (Q5853802) (← links)
- Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic (Q5862178) (← links)
- Polynomial Selection for the Number Field Sieve (Q5888180) (← links)
- A new perspective on the powers of two descent for discrete logarithms in finite fields (Q6165875) (← links)
