Publication:4673626
From MaRDI portal
zbMath1069.68046MaRDI QIDQ4673626
Publication date: 6 May 2005
randomization; cryptography; Kolmogorov complexity; computability theory; complexity theory; public-key cryptosystems; algorithmics; theoretical computer science; Cook's theorem
68Q25: Analysis of algorithms and problem complexity
68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science
94A60: Cryptography
68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
68W20: Randomized algorithms
94A62: Authentication, digital signatures and secret sharing
68Q01: General topics in the theory of computing
