On hardness of one-way functions
- 25 March 1988
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 27 (3) , 151-157
- https://doi.org/10.1016/0020-0190(88)90071-3
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- On some natural complete operatorsTheoretical Computer Science, 1985
- A low and a high hierarchy within NPJournal of Computer and System Sciences, 1983
- A note on the complexity of cryptography (Corresp.)IEEE Transactions on Information Theory, 1979
- On Isomorphisms and Density of $NP$ and Other Complete SetsSIAM Journal on Computing, 1977
- Complete sets and the polynomial-time hierarchyTheoretical Computer Science, 1976
- The polynomial-time hierarchyTheoretical Computer Science, 1976
- Relative complexity of checking and evaluatingInformation Processing Letters, 1976
- Every Prime Has a Succinct CertificateSIAM Journal on Computing, 1975