The following pages link to (Q4250816):
Displayed 30 items.
- Fast cryptography in genus 2 (Q271578) (← links)
- Improved algorithm for the isogeny problem for ordinary elliptic curves (Q360194) (← links)
- An efficient collision detection method for computing discrete logarithms with Pollard's rho (Q411043) (← links)
- Accelerating Pollard's rho algorithm on finite fields (Q431795) (← links)
- Improved Pollard rho method for computing discrete logarithms over finite extension fields (Q442714) (← links)
- Endomorphisms for faster elliptic curve cryptography on a large class of curves (Q451123) (← links)
- Computing elliptic curve discrete logarithms with the negation map (Q454851) (← links)
- Computational hardness of IFP and ECDLP (Q505664) (← links)
- On index calculus algorithms for subfield curves (Q832332) (← links)
- Recent progress on the elliptic curve discrete logarithm problem (Q908041) (← links)
- A note on the \(x\)-coordinate of points on an elliptic curve in characteristic two (Q1607127) (← links)
- Koblitz curve cryptosystems (Q1779327) (← links)
- Speeding up elliptic curve discrete logarithm computations with point halving (Q1943980) (← links)
- Improved classical cryptanalysis of SIKE in practice (Q2055705) (← links)
- Koblitz curves over quadratic fields (Q2318090) (← links)
- Cycle structure of iterating Rédei functions (Q2397505) (← links)
- Computing elliptic curve discrete logarithms with improved baby-step giant-step algorithm (Q2408279) (← links)
- A variant of the Galbraith-Ruprai algorithm for discrete logarithms with improved complexity (Q2414928) (← links)
- Elliptic curve cryptography: the serpentine course of a paradigm shift (Q2430981) (← links)
- On the heuristic of approximating polynomials over finite fields by random mappings (Q2828372) (← links)
- Rédei Actions on Finite Fields and Multiplication Map in Cyclic Group (Q2944456) (← links)
- Modified Gaudry-Schost algorithm for the two-dimensional discrete logarithm problem (Q3383117) (← links)
- Speeding Up the Pollard Rho Method on Prime Fields (Q3600392) (← links)
- Exponentiation in Pairing-Friendly Groups Using Homomorphisms (Q3600506) (← links)
- Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves (Q3627455) (← links)
- Improving the parallelized Pollard lambda search on anomalous binary curves (Q4501048) (← links)
- (Q4993552) (← links)
- ON THE COMPLEXITY OF DISCRETE LOGARITHM PROBLEM IN AN INTERVAL IN A FINITE CYCLIC GROUP WITH EFFICIENT INVERSION (Q5150693) (← links)
- О сложности двупараметрической задачи дискретного логарифмирования в конечной циклической группе с эффективным автоморфизмом (Q5152389) (← links)
- A Result on the Distribution of Quadratic Residues with Applications to Elliptic Curve Cryptography (Q5458200) (← links)