The hardness of the hidden subset sum problem and its cryptographic implications (Q4941845)

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 1418285
Language Label Description Also known as
default for all languages
No label defined
    English
    The hardness of the hidden subset sum problem and its cryptographic implications
    scientific article; zbMATH DE number 1418285

      Statements

      0 references
      0 references
      26 July 2000
      0 references
      discrete-log-based protocols
      0 references
      generating randomly distributed pairs
      0 references
      hidden subset sum problem
      0 references
      security criterion
      0 references
      precomputation schemes
      0 references
      efficient lattice-based attack
      0 references
      pseudo-random generator
      0 references
      discrete Fourier transform
      0 references
      The hardness of the hidden subset sum problem and its cryptographic implications (English)
      0 references

      Identifiers