scientific article; zbMATH DE number 3991578

zbMATH Open0613.10004MaRDI QIDQ3754041FDOQ3754041

Author name not available (Why is that?)

Publication date: 1986

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

zbMATH Keywords

algorithmsprocessorcontinued fraction methodprimality testingECMfactoring large integersrunning timesquadratic sieve methodCFRACLenstra's elliptic curve algorithmPollard's p-1 algorithmQS

Mathematics Subject Classification ID

Factorization (11Y05) Number-theoretic algorithms; complexity (11Y16) Research exposition (monographs, survey articles) pertaining to number theory (11-02) Primality (11Y11)

Cited In (15)

• Using Lucas sequences to factor large integers near group orders.
• Title not available (Why is that?)
• Factoring Large Numbers on a Pocket Calculator
• Title not available (Why is that?)
• Mathematical problems in cryptology
• Title not available (Why is that?)
• Short Notes: Factoring Medium-Sized Integers
• Differential Factoring for Integers
• Title not available (Why is that?)
• An FFT Extension to the P - 1 Factoring Algorithm
• Title not available (Why is that?)
• Title not available (Why is that?)
• Factoring Numbers with Conway’s 150 Method
• Counting the Integers Factorable via Cyclotomic Methods
• Speeding the Pollard and Elliptic Curve Methods of Factorization

   Recommendations

• Factorization of integers 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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 Q3754041)