No label defined (Q3754041)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3991578
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3991578

      Statements

      1986
      0 references
      CFRAC
      0 references
      QS
      0 references
      ECM
      0 references
      primality testing
      0 references
      continued fraction method
      0 references
      quadratic sieve method
      0 references
      algorithms
      0 references
      factoring large integers
      0 references
      processor
      0 references
      Lenstra's elliptic curve algorithm
      0 references
      Pollard's p-1 algorithm
      0 references
      running times
      0 references
      This is a good survey on factoring and primality testing with many interesting comments. ''Sections 2 and 3 describe two of the fastest general integer factoring algorithms, the continued fraction method and the quadratic sieve method. These are the two algorithms we considered in 1981 when we made our plans to build the first special processor for factoring large integers. In section 4 we present this processor, which uses the continued fraction algorithm, and mention another processor now being designed to factor numbers via the quadratic sieve algorithm. Section 6 describes Lenstra's elliptic curve algorithm. As a prelude to his method, in Section 5 we discuss briefly Pollar's p-1 algorithm, which is older but closely related to Lenstra's method. Section 7 summarizes the running times of the four factoring algorithms. Section 8 describes a special computer for the elliptic curve method.'' (From the introduction.) [For the entire collection see Zbl 0605.00005.]
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references