Pages that link to "Item:Q5285942"
From MaRDI portal
The following pages link to Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve (Q5285942):
Displaying 12 items.
- Using number fields to compute logarithms in finite fields (Q4955874) (← links)
- Решение систем линейных уравнений при вычислении логарифмов в конечном простом поле (Q4959032) (← links)
- Number of rational points of elliptic curves (Q5064359) (← links)
- On the cubic sieve method for computing discrete logarithms over prime fields (Q5719250) (← links)
- Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree (Q5738795) (← links)
- Computation of a 768-Bit Prime Field Discrete Logarithm (Q5738876) (← links)
- A Kilobit Hidden SNFS Discrete Logarithm Computation (Q5738878) (← links)
- Public Key Cryptography - PKC 2006 (Q5898943) (← links)
- An optimal distributed discrete log protocol with applications to homomorphic secret sharing (Q5918863) (← links)
- Algebraic curves and cryptography (Q5921638) (← links)
- Fast hashing to \(\mathbb{G}_2\) on pairing-friendly curves with the lack of twists (Q6136710) (← links)
- Cryptanalysis of algebraic verifiable delay functions (Q6652907) (← links)
