Speeding the Pollard and Elliptic Curve Methods of Factorization
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Computing pairings using x-coordinates only
- Modifikationen des Pollard-Algorithmus
- Elliptic curve cryptosystems and their implementation
- Quantum lattice enumeration and tweaking discrete pruning
- On the hardness of the computational ring-LWR problem and its applications
- On the statistical leak of the GGH13 multilinear map and some variants
- Attacking embedded ECC implementations through CMOV side channels
- Lattice attacks against elliptic-curve signatures with blinded scalar multiplication
- Fast, uniform scalar multiplication for genus 2 Jacobians with fast Kummers
- Towards practical key exchange from ordinary isogeny graphs
- CSIDH: an efficient post-quantum commutative group action
- Computing supersingular isogenies on Kummer surfaces
- Connecting Legendre with Kummer and Edwards
- Choosing and generating parameters for pairing implementation on BN curves
- Side-channel attacks on quantum-resistant supersingular isogeny Diffie-Hellman
- How to (pre-)compute a ladder -- improving the performance of X25519 and X448
- Efficient post-quantum undeniable signature on 64-bit ARM
- Metrics on the sets of nonsupersingular elliptic curves in simplified Weierstrass form over finite fields of characteristic two
- Factoring with the quadratic sieve on large vector computers
- Some computational problems of cryptographic significance concerning elliptic curves over rings
- An example of elliptic curve over \(\mathbb{Q}\) with rank equal to 15.
- Speeding up elliptic curve discrete logarithm computations with point halving
- On the representation of the number of integral points of an elliptic curve modulo a prime number
- Equidistribution among cosets of elliptic curve points in intervals
- Isogenies on twisted Hessian curves
- Faster cofactorization with ECM using mixed representations
- Improved classical cryptanalysis of SIKE in practice
- Simplified isogeny formulas on twisted Jacobi quartic curves
- Modular curves over number fields and ECM
- Delegating supersingular isogenies over \(\mathbb{F}_{p^2}\) with cryptographic applications
- Full key recovery side-channel attack against ephemeral SIKE on the cortex-M4
- Resistance of isogeny-based cryptographic implementations to a fault attack
- Efficient hardware implementations for elliptic curve cryptography over Curve448
- The complete cost of cofactor \(h=1\)
- Recovering secrets from prefix-dependent leakage
- Speeding up regular elliptic curve scalar multiplication without precomputation
- Kummer for genus one over prime-order fields
- Eliptic curves in post-quantum cryptography
- Cracking the problem with 33
- Koblitz curves over quadratic fields
- Elliptic curves with large torsion and positive rank over number fields of small degree and ECM factorization
- Jacobian coordinates on genus 2 curves
- Computing elliptic curve discrete logarithms with improved baby-step giant-step algorithm
- Fast algorithms for computing isogenies between ordinary elliptic curves in small characteristic
- Arithmetic of the level four theta model of elliptic curves
- Arithmetic on abelian and Kummer varieties
- L₁-norm ball for CSIDH: optimal strategy for choosing the secret key space
- Differential addition on binary elliptic curves
- B-SIDH: supersingular isogeny Diffie-Hellman using twisted torsion
- scientific article; zbMATH DE number 1588471 (Why is no real title available?)
- Fast cryptography in genus 2
- Exploiting collisions in addition chain-based exponentiation algorithms using a single trace
- Classifications of Elliptic Fibrations of a Singular K3 Surface
- Ultra high-performance ASIC implementation of SM2 with SPA resistance
- Energy-efficient elliptic curve cryptography for MSP430-based wireless sensor nodes
- Efficient Algorithms for Supersingular Isogeny Diffie-Hellman
- Memory-saving computation of the pairing final exponentiation on BN curves
- Practical realisation and elimination of an ECC-related software bug attack
- Subgroup security in pairing-based cryptography
- Twisted Hessian curves
- Fast implementation of Curve25519 using AVX2
- Full-size high-security ECC implementation on MSP430 microcontrollers
- TweetNaCl: A Crypto Library in 100 Tweets
- On symmetric encryption with distinguishable decryption failures
- An elliptic curve cryptographic processor using Edwards curves and the number theoretic transform
- Arithmetic of split Kummer surfaces: Montgomery endomorphism of Edwards products
- Memory-constrained implementations of elliptic curve cryptography in co-Z coordinate repre\-sentation
- An analysis of affine coordinates for pairing computation
- Binary Huff Curves
- Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
- Square always exponentiation
- Elliptic Curves and Primality Proving
- The Factorization of the Ninth Fermat Number
- A Practical Analysis of the Elliptic Curve Factoring Algorithm
- Fast hardware architectures for supersingular isogeny Diffie-Hellman key exchange on FPGA
- The Jacobian and formal group of a curve of genus 2 over an arbitrary ground field
- The Q-curve construction for endomorphism-accelerated elliptic curves
- Methods for increasing the resistance of cryptographic designs against horizontal DPA attacks
- Construction of strong elliptic curves suitable for cryptographic applications
- Algorithm of factorization based on elliptic curve
- An efficient method against side-channel attacks on ECC
- Generic Cryptanalysis of Combined Countermeasures with Randomized BSD Representations
- Power analysis to ECC using differential power between multiplication and squaring
- Low-weight primes for lightweight elliptic curve cryptography on 8-bit AVR processors
- Decaf: eliminating cofactors through point compression
- An FFT Extension to the P - 1 Factoring Algorithm
- Another Generalization of Wiener’s Attack on RSA
- Twisted Edwards Curves
- Fast Point Multiplication on Elliptic Curves without Precomputation
- Montgomery Ladder for All Genus 2 Curves in Characteristic 2
- Factorization with genus 2 curves
- Twisted Edwards Curves Revisited
- Elliptic curve scalar multiplication with x-coordinate
- Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
- Cryptanalysis of RSA Using the Ratio of the Primes
- Fast Elliptic-Curve Cryptography on the Cell Broadband Engine
- scientific article; zbMATH DE number 3959522 (Why is no real title available?)
- Tables of Fibonacci and Lucas factorizations
- On the Number of Elliptic Pseudoprimes
- scientific article; zbMATH DE number 4087589 (Why is no real title available?)
This page was built for publication: Speeding the Pollard and Elliptic Curve Methods of Factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3748330)
