Efficient cryptographic schemes provably as secure as subset sum
- 1 September 1996
- journal article
- Published by Springer Science and Business Media LLC in Journal of Cryptology
- Vol. 9 (4), 199-216
- https://doi.org/10.1007/bf00189260
Abstract
No abstract availableKeywords
This publication has 42 references indexed in Scilit:
- Minimum disclosure proofs of knowledgeJournal of Computer and System Sciences, 1988
- A knapsack-type public key cryptosystem based on arithmetic in finite fieldsIEEE Transactions on Information Theory, 1988
- Cryptanalysis: a survey of recent resultsProceedings of the IEEE, 1988
- Random oracles separate PSPACE from the polynomial-time hierarchyInformation Processing Letters, 1987
- A Simple Unpredictable Pseudo-Random Number GeneratorSIAM Journal on Computing, 1986
- One-way functions and circuit complexityPublished by Springer Science and Business Media LLC ,1986
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984
- Solving Low Density KnapsacksPublished by Springer Science and Business Media LLC ,1984
- ∑11-Formulae on finite structuresAnnals of Pure and Applied Logic, 1983
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979