Hardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes (Q3452347)

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 6507374
Language Label Description Also known as
default for all languages
No label defined
    English
    Hardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes
    scientific article; zbMATH DE number 6507374

      Statements

      Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes (English)
      0 references
      0 references
      0 references
      11 November 2015
      0 references

      Identifiers