A monte carlo method for factorization

@article{Pollard1975AMC,
  title={A monte carlo method for factorization},
  author={J. M. Pollard},
  journal={BIT Numerical Mathematics},
  year={1975},
  volume={15},
  pages={331-334}
}
  • J. M. Pollard
  • Published 1975
  • Mathematics
  • BIT Numerical Mathematics
    • We describe briefly a novel factorization method involving probabilistic ideas. 
    View on Springer
    377 Citations
    Highly Influencial Citations
    11
    Background Citations
    42
    Methods Citations
    100
    Results Citations
    4
    377 Citations
    Citation Type

    Citation Type

    Integer Factoring
    • 53
    • PDF
    On cullen numbers
    • 1
    The Primality of # 1031
    An improved Monte Carlo factorization algorithm
    • 194
    • PDF
    New integer factorizations
    • 6
    • PDF
    Multi-Base Chains for Faster Elliptic Curve Cryptography
    Analysis of cryptographic hash functions.
    On not storing the path of a random walk
    • 2
    Quantum Computational Number Theory
    • S. Yan
    • Computer Science, Mathematics
    • Springer International Publishing
    • 2015
    • 2
    A Detrministic Factorization and Primality Testing Algorithm for Integers of the Form Z Mod 6 = -1

    References

    SHOWING 1-3 OF 3 REFERENCES
    A design for a number theory package with an optimized trial division routine
    • 30
    Theorems on factorization and primality testing
    • 367
    A method of factoring and the factorization of
    • 208
    • PDF