Factoring integers and computing discrete logarithms via diophantine approximation (Q4037472)

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 177596
Language Label Description Also known as
default for all languages
No label defined
    English
    Factoring integers and computing discrete logarithms via diophantine approximation
    scientific article; zbMATH DE number 177596

      Statements

      Factoring Integers and Computing Discrete Logarithms via Diophantine Approximation (English)
      0 references
      Factoring integers and computing discrete logarithms via diophantine approximation (English)
      0 references
      18 May 1993
      0 references
      factoring integers via diophantine approximation
      0 references
      algorithm
      0 references
      discrete logarithms
      0 references
      [For the entire collection see Zbl 0756.00008.] The author discusses the factoring of integers \(N\) via diophantine approximations. Those approximations are determined by computing vectors in suitable lattices which are sufficiently close to a given one. He shows that under reasonable assumptions his algorithm terminates though no complexity results or running times are included. In a final section of the paper discrete logarithms in \((\mathbb Z/N\mathbb Z)^\times\) are calculated by a variant of that method.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references