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 49 items.
- Elliptic curve scalar multiplication with x-coordinate (Q3610404) (← links)
- Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves (Q3627455) (← links)
- Cryptanalysis of RSA Using the Ratio of the Primes (Q3637134) (← links)
- Fast Elliptic-Curve Cryptography on the Cell Broadband Engine (Q3637151) (← links)
- Tables of Fibonacci and Lucas factorizations (Q3772275) (← links)
- On the Number of Elliptic Pseudoprimes (Q3807278) (← links)
- Factorization of the tenth Fermat number (Q4221993) (← links)
- On the analogue of the division polynomials for hyperelliptic curves. (Q4279071) (← links)
- Discrete Weighted Transforms and Large-Integer Arithmetic (Q4286602) (← links)
- Finding Suitable Curves for the Elliptic Curve Method of Factorization (Q4293979) (← links)
- New frameworks for Montgomery’s modular multiplication method (Q4452169) (← links)
- Computing isomorphisms and embeddings of finite fields (Q4612574) (← links)
- EPG-representations with Small Grid-Size (Q4625111) (← links)
- Computing isogenies between elliptic curves over $F_{p^n}$ using Couveignes's algorithm (Q4700202) (← links)
- New Cullen Primes (Q4878523) (← links)
- ECM using Edwards curves (Q4912021) (← links)
- Huff’s Model for Elliptic Curves (Q4931652) (← links)
- Three new factors of Fermat numbers (Q4955877) (← links)
- High-performance Implementation of Elliptic Curve Cryptography Using Vector Instructions (Q4960943) (← links)
- Evaluating the Cache Side Channel Attacks Against ECDSA (Q5040404) (← links)
- Small scalar multiplication on Weierstrass curves using division polynomials (Q5042268) (← links)
- Elliptic curve with Optimal mixed Montgomery-Edwards model for low-end devices (Q5046480) (← links)
- Explicit construction of the square-root Vélu's formula on Edwards curves (Q5047146) (← links)
- Online Template Attack on ECDSA: (Q5048978) (← links)
- A Tale of Three Signatures: Practical Attack of ECDSA with wNAF (Q5048983) (← links)
- A New Encoding Algorithm for a Multidimensional Version of the Montgomery Ladder (Q5048986) (← links)
- Elliptic Curve Cryptography: A Software Implementation (Q5050235) (← links)
- Efficient Software Implementation of Laddering Algorithms Over Binary Elliptic Curves (Q5055960) (← links)
- A Secure and Efficient Implementation of the Quotient Digital Signature Algorithm (qDSA) (Q5055968) (← links)
- Key Bit-Dependent Attack on Protected PKC Using a Single Trace (Q5056016) (← links)
- A classification of ECM-friendly families of elliptic curves using modular curves (Q5070546) (← links)
- Radical Isogenies on Montgomery Curves (Q5087267) (← links)
- Compression on the Twisted Jacobi Intersection (Q5158669) (← links)
- Differential Addition on Binary Elliptic Curves (Q5267790) (← links)
- Faster Addition and Doubling on Elliptic Curves (Q5387091) (← links)
- Improved Stage 2 to P ± 1 Factoring Algorithms (Q5387598) (← links)
- Constructing elliptic curves over finite fields with prescribed torsion (Q5389449) (← links)
- Efficient Compression of SIDH Public Keys (Q5738894) (← links)
- High-degree Compression Functions on Alternative Models of Elliptic Curves and their Applications (Q5862340) (← links)
- Prime Factorization without Using Any Approximations (Q5867265) (← links)
- Kummer versus Montgomery Face-off over Prime Order Fields (Q5883706) (← links)
- Diophantine triples and construction of high-rank elliptic curves over \(\mathbb{Q}\) with three nontrivial 2-torsion points (Q5928665) (← links)
- How to construct CSIDH on Edwards curves (Q6063264) (← links)
- A geometric approach to elliptic curves with torsion groups Z/10Z, Z/12Z, Z/14Z, and Z/16Z (Q6065721) (← links)
- Protecting the most significant bits in scalar multiplication algorithms (Q6112010) (← links)
- Time-efficient finite field microarchitecture design for Curve448 and Ed448 on Cortex-M4 (Q6134225) (← links)
- A formula for disaster: a unified approach to elliptic curve special-point-based attacks (Q6157489) (← links)
- Differential fault attack on Montgomery ladder and in the presence of scalar randomization (Q6157592) (← links)
- High-rank elliptic curves with given torsion group and some applications (Q6196943) (← links)