Efficient computation modulo a shared secret with application to the generation of shared safe-prime products (Q4409134)

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 1942435
Language Label Description Also known as
default for all languages
No label defined
    English
    Efficient computation modulo a shared secret with application to the generation of shared safe-prime products
    scientific article; zbMATH DE number 1942435

      Statements

      0 references
      0 references
      0 references
      30 June 2003
      0 references
      RSA
      0 references
      safe primes
      0 references
      threshold cryptography
      0 references
      distributed primality test
      0 references
      Efficient computation modulo a shared secret with application to the generation of shared safe-prime products (English)
      0 references

      Identifiers