COMPLEXITY MEASURES FOR PUBLIC-KEY CRYPTOSYSTEMS.

Annual Symposium on Foundations of Computer Science (Proceedings)

Volumn , Issue , 1984, Pages 495-503

  Grollmann, Joachim ^a   Selman, Alan L ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION THEORY AND ANALYSIS;

COMPLEXITY MEASURES; CRACKING PROBLEMS; NP-HARDNESS; PARTIAL DECISION PROBLEMS; PUBLIC-KEY CRYPTOSYSTEMS;

CRYPTOGRAPHY;

EID: 0021566373     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)