The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Complexity Measures for Public-Key Cryptosystems
Abstract
A general theory of public-key cryptography is developed that is based on the mathematical framework of complexity theory. Two related approaches are taken to the development of this theory, and these approaches correspond to different but equivalent formulations of the problem of cracking a public-key cryptosystem (PKCS). The first approach is to model the cracking problem as a partial decision problem called a “promise problem.” Every NP-hard promise problem is shown to be uniformly NP-hard, and a number of results and a conjecture about promise problems are shown to be equivalent to separability assertions for sets in NP that are the natural analogues of well-known results in classical recursion theory. The conjecture, if it is true, implies nonexistence of PKCS having NP-hard cracking problems. The second approach represents the cracking problem of a PKCS as a partial computational problem directly. Using this approach, it is shown that one-way functions exist if and only if ${\text{P}} \ne {\text{UP}}$ and that one-way functions with greater cryptographic significance exist if and only if NP contains disjoint P-inseparable sets. The paper concludes with a discussion of almost-everywhere security measures for PKCS.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462
Introduction to automata theory, languages, and computation
(1980) · Computer Languages · doi:10.1016/0096-0551(80)90011-9 · Cited by 6,824
Goldwasser, S., & Micali, S. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90070-9 · Cited by 2,603
How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
Blum, M., & Micali, S. (1984) · SIAM Journal on Computing · doi:10.1137/0213053 · Cited by 1,322
Theory and application of trapdoor functions
Yao, A. C. (1982) · 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982) · doi:10.1109/sfcs.1982.45 · Cited by 968
Hiding information and signatures in trapdoor knapsacks
Merkle, R., & Hellman, M. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055927 · Cited by 827
Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
Baker, T., Gill, J., & Solovay, R. (1975) · SIAM Journal on Computing · doi:10.1137/0204037 · Cited by 738
Riemann's hypothesis and tests for primality
Miller, G. L. (1976) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(76)80043-8 · Cited by 709
Computational Complexity of Probabilistic Turing Machines
Gill, J. (1977) · SIAM Journal on Computing · doi:10.1137/0206049 · Cited by 689
Bennett, C. H., & Gill, J. (1981) · SIAM Journal on Computing · doi:10.1137/0210008 · Cited by 381
Every Prime Has a Succinct Certificate
Pratt, V. R. (1975) · SIAM Journal on Computing · doi:10.1137/0204018 · Cited by 309
The complexity of facets (and some facets of complexity)
Papadimitriou, C. H., & Yannakakis, M. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90068-0 · Cited by 307
Relative complexity of checking and evaluating
Valiant, L. G. (1976) · Information Processing Letters · doi:10.1016/0020-0190(76)90097-1 · Cited by 277
A modification of the RSA public-key encryption procedure (Corresp.)
Williams, H. (1980) · IEEE Transactions on Information Theory · doi:10.1109/tit.1980.1056264 · Cited by 271
An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information
Blum, M., & Goldwasser, S. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-39568-7_23 · Cited by 262
BPP and the polynomial hierarchy
Lautemann, C. (1983) · Information Processing Letters · doi:10.1016/0020-0190(83)90044-3 · Cited by 212
Bi-immune sets for complexity classes
Balcázar, J. L., & Schöning, U. (1985) · Theory of Computing Systems · doi:10.1007/bf01699457 · Cited by 118
A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystem
Adi Shamir, Z. (1982) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1982.5 · Cited by 108
On the generation of cryptographically strong pseudo-random sequences
Adi Shamir, Z. (1981) · Lecture notes in computer science · doi:10.1007/3-540-10843-2_43 · Cited by 103
Relativized Questions Involving Probabilistic Algorithms
Rackoff, C. (1982) · Journal of the ACM · doi:10.1145/322290.322306 · Cited by 84
Some observations on the probabilistic algorithms and NP-hard problems
Ko, K. (1982) · Information Processing Letters · doi:10.1016/0020-0190(82)90139-9 · Cited by 82
On some natural complete operators
Ko, K. (1985) · Theoretical Computer Science · doi:10.1016/0304-3975(85)90085-4 · Cited by 80
Lempel, A. (1979) · ACM Computing Surveys · doi:10.1145/356789.356792 · Cited by 75
A note on the complexity of cryptography (Corresp.)
Brassard, G. (1979) · IEEE Transactions on Information Theory · doi:10.1109/tit.1979.1056010 · Cited by 68
Cryptocomplexity and NP-completeness
Even, S., & Yacobi, Y. (1980) · Lecture notes in computer science · doi:10.1007/3-540-10003-2_71 · Cited by 50
Gilles Brassard, A. (1983) · IEEE Transactions on Information Theory · doi:10.1109/tit.1983.1056754 · Cited by 34
Relativizations of Unambiguous and Random Polynomial Time Classes
Geske, J. G., & Grollmann, J. (1986) · SIAM Journal on Computing · doi:10.1137/0215035 · Cited by 24
Self-citationThe NP-completeness column: An ongoing guide
Johnson, D. S. (1985) · Journal of Algorithms · doi:10.1016/0196-6774(85)90046-x · Cited by 15
Relativizations comparing NP and exponential time
Gasarch, W. I., & Homer, S. T. (1983) · Information and Control · doi:10.1016/s0019-9958(83)80058-8 · Cited by 14
A time-luck tradeoff in relativized cryptography
Brassard, G. (1981) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(81)90034-9 · Cited by 7
A uniform reduction theorem extending a result of J. Grollmann and A. Selman
Regan, K. W. (1986) · Lecture notes in computer science · doi:10.1007/3-540-16761-7_82 · Cited by 3
Cited by
A Catalog of Complexity Classes
JOHNSON, D. S. (1990) · Algorithms and Complexity · doi:10.1016/b978-0-444-88071-0.50007-2 · Cited by 556
Metadata
- Authors
- Grollmann, J., & Selman, A. L.
- Venue
- SIAM Journal on Computing
- Published
- 1988-04
- Volume
- 17
- Issue
- 2
- Pages
- 309-335
- ISSN
- 0097-5397 (ISSN-L)
- 1095-7111
- OpenAlex
- W2085634981
- Cited by
- 282
- References
- 31
- FWCI
- 12.42
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.