Analysis and Comparison of Some Integer Factoring Algorithms

Pomerance, C. (1982). Analysis and Comparison of Some Integer Factoring Algorithms. Computational Methods in Number Theory, Part I.

Type

Book chapter

Intellectual base

Review or monograph

Year

1982

Link

https://math.dartmouth.edu/~carlp/PDF/analysiscomparison.pdf

Cited by

1 citation across 1 artifact.

Domain-specific

• L-notation
  • The construction emerged from comparisons among integer-factorization algorithms and was generalized into its standard two-parameter form in the Lenstras’ treatment of algorithms in number theory.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:a9d197dfd5ce · see in the full table