Faster cofactorization with ECM using mixed representations
type: Item
instance of: scholarly article
title: Faster cofactorization with ECM using mixed representations
zbMATH Open document ID: 1483.11264
DOI: 10.1007/978-3-030-45388-6_17
author: Cyril Bouvier
author: Laurent Imbert
publication date: 2021-12-01T00:00:00Z
full work available at URL: 2018-669.pdf
Mathematics Subject Classification ID: 11Y05
Mathematics Subject Classification ID: 11T71
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 14G50
zbMATH DE Number: 7436982
zbMATH Keywords: elliptic curve method
zbMATH Keywords: cofactorization
zbMATH Keywords: double-base representation
zbMATH Keywords: twisted Edwards curve
zbMATH Keywords: Montgomery curve
zbMATH Keywords: CADO-NFS
MaRDI profile type: Publication
OpenAlex ID: W3023398280
cites work: Finding ECM-friendly curves through a study of Galois properties
cites work: Twisted Edwards Curves
cites work: Starfish on Strike
cites work: ECM using Edwards curves
cites work: A complete set of addition laws for incomplete Edwards curves
cites work: ECM at Work
cites work: Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains
cites work: Q4279676
cites work: A normal form for elliptic curves
cites work: Twisted Edwards Curves Revisited
cites work: Fast Modular Arithmetic on the Kalray MPPA-256 Processor for an Energy-Efficient Implementation of ECM
cites work: Factorization of a 768-Bit RSA Modulus
cites work: The development of the number field sieve
cites work: Factoring integers with elliptic curves
cites work: Speeding the Pollard and Elliptic Curve Methods of Factorization
cites work: Elliptic Curve Scalar Multiplication Combining Yao’s Algorithm and Double Bases
cites work: On the Evaluation of Powers
cites work: Algorithmic Number Theory
description: scientific article; zbMATH DE number 7436982