Proceedings of the fourteenth annual ACM symposium on Theory of computing - STOC '82

S. Goldwasser, S. M. (1982). Proceedings of the fourteenth annual ACM symposium on Theory of computing - STOC '82. ACM.

Type

Unclassified

Intellectual base

Unclassified

Year

1982

DOI

10.1145/800070.802212

Link

https://doi.org/10.1145/800070.802212

Cited by

1 citation across 1 artifact.

Domain-specific

• Quadratic residuosity problem
  • … from For an RSA-like product of two unknown odd primes, decide whether a Jacobi-one value has a modular square root without first factoring the modulus. to A security proof states the modulus distribution and precise hardness assumption and does not conflate deciding residuosity with computing a square root..

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:1eb7a0c6be2b · see in the full table