An improved algorithm for computing logarithms over \(\mathrm{GF}(p)\) and its cryptographic significance (Q4154061)

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 3584915
Language Label Description Also known as
default for all languages
No label defined
    English
    An improved algorithm for computing logarithms over \(\mathrm{GF}(p)\) and its cryptographic significance
    scientific article; zbMATH DE number 3584915

      Statements

      An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.) (English)
      0 references
      An improved algorithm for computing logarithms over \(\mathrm{GF}(p)\) and its cryptographic significance (English)
      0 references
      0 references
      0 references
      1978
      0 references
      A cryptographic system which is secure if and only if exponentation (mod \(p)\) is one-way is described. An improved algorithm for computing logarithms over \(\mathrm{GF}(p)\) is then presented. Examples of primes at extremes are given.
      0 references

      Identifiers

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