Pages that link to "Item:Q3748330"
From MaRDI portal
The following pages link to Speeding the Pollard and Elliptic Curve Methods of Factorization (Q3748330):
Displaying 50 items.
- Improved classical cryptanalysis of SIKE in practice (Q2055705) (← links)
- Simplified isogeny formulas on twisted Jacobi quartic curves (Q2066406) (← links)
- Modular curves over number fields and ECM (Q2100579) (← links)
- Delegating supersingular isogenies over \(\mathbb{F}_{p^2}\) with cryptographic applications (Q2104421) (← links)
- Full key recovery side-channel attack against ephemeral SIKE on the cortex-M4 (Q2145305) (← links)
- Resistance of isogeny-based cryptographic implementations to a fault attack (Q2145308) (← links)
- Efficient hardware implementations for elliptic curve cryptography over Curve448 (Q2152030) (← 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)
- Kummer for genus one over prime-order fields (Q2303455) (← links)
- Eliptic curves in post-quantum cryptography (Q2315804) (← links)
- Cracking the problem with 33 (Q2316144) (← links)
- Koblitz curves over quadratic fields (Q2318090) (← links)
- Elliptic curves with large torsion and positive rank over number fields of small degree and ECM factorization (Q2392056) (← links)
- Jacobian coordinates on genus 2 curves (Q2397457) (← links)
- Computing elliptic curve discrete logarithms with improved baby-step giant-step algorithm (Q2408279) (← links)
- Fast algorithms for computing isogenies between ordinary elliptic curves in small characteristic (Q2430987) (← links)
- Arithmetic of the level four theta model of elliptic curves (Q2516923) (← links)
- \( L_1\)-norm ball for CSIDH: optimal strategy for choosing the secret key space (Q2685697) (← links)
- Differential addition on binary elliptic curves (Q2689349) (← links)
- B-SIDH: supersingular isogeny Diffie-Hellman using twisted torsion (Q2692391) (← links)
- Exploiting Collisions in Addition Chain-Based Exponentiation Algorithms Using a Single Trace (Q2790057) (← links)
- Classifications of Elliptic Fibrations of a Singular K3 Surface (Q2799949) (← links)
- Ultra High-Performance ASIC Implementation of SM2 with SPA Resistance (Q2801770) (← links)
- Point Decomposition Problem in Binary Elliptic Curves (Q2806768) (← links)
- Energy-Efficient Elliptic Curve Cryptography for MSP430-Based Wireless Sensor Nodes (Q2817458) (← links)
- Efficient Algorithms for Supersingular Isogeny Diffie-Hellman (Q2835601) (← links)
- Practical Realisation and Elimination of an ECC-Related Software Bug Attack (Q2890003) (← links)
- Subgroup Security in Pairing-Based Cryptography (Q2946453) (← links)
- Twisted Hessian Curves (Q2946454) (← links)
- Fast Implementation of Curve25519 Using AVX2 (Q2946458) (← links)
- Full-Size High-Security ECC Implementation on MSP430 Microcontrollers (Q2946464) (← links)
- TweetNaCl: A Crypto Library in 100 Tweets (Q2946467) (← links)
- On Symmetric Encryption with Distinguishable Decryption Failures (Q2946887) (← links)
- An Elliptic Curve Cryptographic Processor Using Edwards Curves and the Number Theoretic Transform (Q2947104) (← links)
- Arithmetic of Split Kummer Surfaces: Montgomery Endomorphism of Edwards Products (Q3005593) (← links)
- Memory-Constrained Implementations of Elliptic Curve Cryptography in Co-Z Coordinate Representation (Q3011912) (← links)
- An Analysis of Affine Coordinates for Pairing Computation (Q3059636) (← links)
- Binary Huff Curves (Q3073716) (← links)
- Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies (Q3102781) (← links)
- Square Always Exponentiation (Q3104721) (← links)
- Elliptic Curves and Primality Proving (Q3137447) (← links)
- The Factorization of the Ninth Fermat Number (Q3137471) (← links)
- A Practical Analysis of the Elliptic Curve Factoring Algorithm (Q3137481) (← links)
- Fast Hardware Architectures for Supersingular Isogeny Diffie-Hellman Key Exchange on FPGA (Q3179485) (← links)
- The Jacobian and formal group of a curve of genus 2 over an arbitrary ground field (Q3211451) (← links)
- Methods for Increasing the Resistance of Cryptographic Designs Against Horizontal DPA Attacks (Q3297502) (← links)
- Construction of strong elliptic curves suitable for cryptographic applications (Q3383074) (← links)
- An efficient method against side-channel attacks on ECC (Q3443224) (← links)
