scientific article; zbMATH DE number 17387

zbMATH Open0742.11062MaRDI QIDQ3974092FDOQ3974092

Authors: Carl Pomerance 

Publication date: 26 June 1992

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 3959521
• scientific article; zbMATH DE number 3991578
• scientific article; zbMATH DE number 20453
• scientific article; zbMATH DE number 3924865
• Speeding the Pollard and Elliptic Curve Methods of Factorization

zbMATH Keywords

factorizationelliptic curve methodquadratic sieve method

Mathematics Subject Classification ID

Factorization (11Y05) Research exposition (monographs, survey articles) pertaining to number theory (11-02) Factorization; primality (11A51)

Cited In (16)

• Approximating the number of integers free of large prime factors
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An interactive identification scheme based on discrete logarithms and factoring
• Fast generation of prime numbers and secure public-key cryptographic parameters.
• Factoring integers
• Title not available (Why is that?)
• Title not available (Why is that?)
• Finding irreducible and primitive polynomials
• A Practical Analysis of the Elliptic Curve Factoring Algorithm
• Factoring Factor Maps
• Factor Refinement
• Factoring Forms
• Factoring with the quadratic sieve on large vector computers
• Speeding the Pollard and Elliptic Curve Methods of Factorization

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3974092)