Pages that link to "Item:Q3748330"
From MaRDI portal
The following pages link to Speeding the Pollard and Elliptic Curve Methods of Factorization (Q3748330):
Displayed 50 items.
- Arithmetic on abelian and Kummer varieties (Q268484) (← links)
- Fast cryptography in genus 2 (Q271578) (← links)
- Memory-saving computation of the pairing final exponentiation on BN curves (Q285907) (← links)
- The \(\mathbb Q\)-curve construction for endomorphism-accelerated elliptic curves (Q321311) (← links)
- Scalar recoding and regular \(2^w\)-ary right-to-left EC scalar multiplication algorithm (Q396590) (← links)
- New fault attacks using Jacobi symbol and application to regular right-to-left algorithms (Q407590) (← links)
- Isomorphism classes of Edwards curves over finite fields (Q413563) (← links)
- Two kinds of division polynomials for twisted Edwards curves (Q429775) (← links)
- Fault detection and a differential fault analysis countermeasure for the Montgomery power ladder in elliptic curve cryptography (Q445404) (← links)
- Endomorphisms for faster elliptic curve cryptography on a large class of curves (Q451123) (← links)
- Using symmetries in the index calculus for elliptic curves discrete logarithm (Q484325) (← links)
- An optimal representation for the trace zero subgroup (Q521853) (← links)
- A parallel version of the continued fraction integer factoring algorithm (Q547503) (← links)
- Toric forms of elliptic curves and their arithmetic (Q548601) (← links)
- Traces of the group law on the Kummer surface of a curve of genus 2 in characteristic 2 (Q626948) (← links)
- Prime factorization using square root approximation (Q639053) (← links)
- Fault-based attack on Montgomery's ladder algorithm (Q656523) (← links)
- A chosen message attack on Demytko's elliptic curve cryptosystem (Q676832) (← links)
- Toward a theory of Pollard's rho method (Q752762) (← links)
- High-speed Curve25519 on 8-bit, 16-bit, and 32-bit microcontrollers (Q887435) (← links)
- The distributions of individual bits in the output of multiplicative operations (Q892279) (← links)
- Horizontal collision correlation attack on elliptic curves (Q892284) (← links)
- Solving structured linear systems with large displacement rank (Q954988) (← links)
- Computing pairings using \(x\)-coordinates only (Q1009121) (← links)
- Elliptic curve cryptosystems and their implementation (Q1312102) (← links)
- Quantum lattice enumeration and tweaking discrete pruning (Q1633464) (← links)
- On the hardness of the computational ring-LWR problem and its applications (Q1633465) (← links)
- On the statistical leak of the GGH13 multilinear map and some variants (Q1633467) (← links)
- Attacking embedded ECC implementations through CMOV side channels (Q1698620) (← links)
- Lattice attacks against elliptic-curve signatures with blinded scalar multiplication (Q1698621) (← links)
- Fast, uniform scalar multiplication for genus 2 Jacobians with fast Kummers (Q1698663) (← links)
- Towards practical key exchange from ordinary isogeny graphs (Q1710681) (← links)
- CSIDH: an efficient post-quantum commutative group action (Q1710683) (← links)
- Computing supersingular isogenies on Kummer surfaces (Q1710684) (← links)
- Connecting Legendre with Kummer and Edwards (Q1726008) (← links)
- Choosing and generating parameters for pairing implementation on BN curves (Q1745896) (← links)
- Side-channel attacks on quantum-resistant supersingular isogeny Diffie-Hellman (Q1746954) (← links)
- How to (pre-)compute a ladder -- improving the performance of X25519 and X448 (Q1746965) (← links)
- Efficient post-quantum undeniable signature on 64-bit ARM (Q1746974) (← links)
- Metrics on the sets of nonsupersingular elliptic curves in simplified Weierstrass form over finite fields of characteristic two (Q1751377) (← links)
- Factoring with the quadratic sieve on large vector computers (Q1825224) (← links)
- Some computational problems of cryptographic significance concerning elliptic curves over rings (Q1854282) (← links)
- An example of elliptic curve over \(\mathbb{Q}\) with rank equal to 15. (Q1869647) (← links)
- Speeding up elliptic curve discrete logarithm computations with point halving (Q1943980) (← links)
- On the representation of the number of integral points of an elliptic curve modulo a prime number (Q2017998) (← links)
- Equidistribution among cosets of elliptic curve points in intervals (Q2023315) (← links)
- Isogenies on twisted Hessian curves (Q2040559) (← links)
- The complete cost of cofactor \(h=1\) (Q2179402) (← links)
- Recovering secrets from prefix-dependent leakage (Q2191199) (← links)
- Speeding up regular elliptic curve scalar multiplication without precomputation (Q2210646) (← links)