Advances in Cryptology
Proceedings of Crypto '83
Edited by David Chaum
- Knapsack public key cryptosystems and Diophantine approximation, Lagarias, J. C.
- Solving low density knapsacks, Brickell, E. F.
- Evaluation of the Adleman attack on multiply iterated knapsack cryptosystems, Brickell, E. F., Lagarias, J. C. and Odlyzko, A. M.
- On the power of cascade ciphers, Even, S. and Goldreich, O.
- The prisoner's problem and the subliminal channel, Simmons, G. J.
- An overview of factoring, Williams, H. C.
- New ideas for factoring large integers, Pomerance, C., Smith, J. W. and Wagstaff, S. S. Jr.
- Factoring numbers of the Massively Parallel Computer, Wunderlich, M. C.
- Factorization using the Quadratic Sieve algorithm, Davis, J. A. and Holdridge, D. B.
- Signatures through approximate representations by quadratic forms, Ong, H. and Schnorr, C. P.
- A simple protocol for signing contracts, Goldreich, O.
- Reducibility among protocols, Blum, M., Vazirani, U. V. and Vazirani, V. V.
- How to exchange half a bit, Tedrick, T.
- Blind signature system, Chaum, D.
- A layered broadcast cryptographic system, Spencer, M. E. and Tavares, S. E.
- Analytical characteristics of the DES, Davio, M., Desmedt, Y., Fosseprez, M., Govaerts, R., Hulsbosch, J., Neutjens, P., Piret, P., Quisquater, J. J., Vandewalle, J. and Wouters, P.
- Producing a oneway hash function from DES, Winternitz, R. S.
- On the security of compressed encodings, Akl, S. G.
- Field encryption and authentication., Denning, D. E.
- Shift register synthesis (modulo m)., Reeds, J. A. and Sloane, N. J. A.
- Probabilistic analysis and performance modelling of the "Swedish" algorithm and modifications, Sachs, J. E. and Berkovits, S.
- A subexponential time algorithm for computing discrete logarithms over GF(p2), ElGamal, T.
- Permutation polynomials in RSA cryptosystems, Lidl, R. and Mueller, W. B.
- Some results on the information theoretic analysis of cryptosystems, Juergensen, H. and Matthews, D. E.
- Improving the security of exponential key exchange, Fam, B. W.
- RSA bits are 0.732 + epsilon secure, Vazirani, U. V. and Vazirani, V. V.
- Use of the "signature token" to create a negotiable document, Davies, D. W.
- Electronic wallet, Even, S. and Goldreich, O.
- Design concepts for tamper responding systems, Chaum, D.
Copyright © 1998, Springer-Verlag.