New directions in cryptography
Two kinds of contemporary developments in cryptography are examined. Widening applications of teleprocessing have given rise to a need for new types of cryptographic systems, wh...
Publications
3 shownHiding information and signatures in trapdoor knapsacks
The knapsack problem is an NP-complete combinatorial problem that is strongly believed to be computationally difficult to solve in general. Specific instances of this problem th...
An improved algorithm for computing logarithms overGF(p)and its cryptographic significance (Corresp.)
A cryptographic system is described which is secure if and only if computing logarithms over <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1...
Frequent Co-Authors
Researcher Info
- h-index
- 3
- Publications
- 3
- Citations
- 16,206
- Institution
- Stanford University
External Links
Impact Metrics
h-index
3
h-index: Number of publications with at least h citations each.