Pages that link to "Item:Q1310453"
From MaRDI portal
The following pages link to Modifications to the number field sieve (Q1310453):
Displaying 17 items.
- One approach to factorization of positive integers (Q647854) (← links)
- Computation of discrete logarithms in prime fields (Q1179517) (← links)
- Batch RSA (Q1363068) (← links)
- Computing discrete logarithms in \(\mathbb F_{p^6}\) (Q1746956) (← links)
- Rigorous analysis of a randomised number field sieve (Q1747213) (← links)
- New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups (Q1865128) (← links)
- Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields (Q2096515) (← links)
- A survey on the number field sieve (Q2707574) (← links)
- The multiple number field sieve for medium- and high-characteristic finite fields (Q2878838) (← links)
- Square Root Algorithms for the Number Field Sieve (Q3166983) (← links)
- A Rigorous Time Bound for Factoring Integers (Q4019632) (← links)
- Using number fields to compute logarithms in finite fields (Q4955874) (← links)
- Computation of a 30750-bit binary field discrete logarithm (Q4956935) (← links)
- Finding the group structure of elliptic curves over finite fields (Q5717395) (← links)
- Computation of a 768-Bit Prime Field Discrete Logarithm (Q5738876) (← links)
- A Kilobit Hidden SNFS Discrete Logarithm Computation (Q5738878) (← links)
- Quantum generalized least squares method in system identification (Q6566209) (← links)
