Advances in Cryptology
Crypto '85
Edited by Hugh C. Williams
- Breaking the Ong-Schnorr-Shamir signature scheme for quadratic number fields, Estes, D., Adleman, L. M., Kompella, K., McCurley, K. S. and Miller, G. L.
- Another birthday attack, Coppersmith, D.
- Attacks on some RSA signatures, de Jonge, W. and Chaum, D.
- An attack on a signature scheme proposed by Okamoto and Shiraishi, Brickell, E. F. and DeLaurentis, J. M.
- A secure subliminal channel (?), Simmons, G. J.
- Unconditionally secure authentication schemes and practical and theoretical consequences, Desmedt, Y.
- On the security of ping-pong protocols when implemented using the RSA, Even, S., Goldreich, O. and Shamir, A.
- A secure poker protocol that minimizes the effect of player coalitions, Crépeau, C.
- A framework for the study of cryptographic protocols, Berger, R., Kannan, S. and Peralta, R.
- Cheating at mental poker, Coppersmith, D.
- Security for the DoD transmission control protocol, Diffie, W.
- Symmetric public-key encryption, Galil, Z., Haber, S. and Yung, M.
- Software protection: myth or reality?, Gosler, J. R.
- Public protection of software, Herzberg, A. and Pinter, S.
- Fingerprinting long forgiving messages, Blakley, G. R., Meadows, C. and Purdy, G. B.
- Cryptanalysis of DES with a reduced number of rounds, Chaum, D. and Evertse, J. H.
- Is DES a pure cipher? (Results of more cycling experiments on DES), Kaliski, B. S., Rivest, R. L. and Sherman, A. T.
- A layered approach to the design of private key cryptosystems, Moore, T. E. and Tavares, S. E.
- Lifetimes of keys in cryptographic key management systems, Okamoto, E. and Nakamura, K.
- Correlation immunity and the summation generator, Rueppel, R. A.
- Design of combiners to prevent divide and conquer attacks, Siegenthaler, T.
- On the security of DES, Shamir, A.
- Information theory without the finiteness assumption, II unfolding the DES, Blakley, G. R.
- Analysis of a public key approach based on polynomial substitution, Fell, H. and Diffie, W.
- Developing an RSA chip, Kochanski, M.
- An M3 public-key encryption scheme, Williams, H. C.
- Trapdoor rings and their use in cryptography, Varadharajan, V.
- On computing logarithms over finite fields, ElGamal, T.
- On using RSA with low exponent in a public key network, Hastad, J.
- Lenstra's factorisation method based on elliptic curves, Stephens, N. M.
- Use of elliptic curves in cryptography, Miller, V. S.
- Cryptography with cellular automata, Wolfram, S.
- Efficient parallel pseudo-random number generation, Reif, J. H. and Tygar, J. D.
- How to construct pseudo-random permutations from pseudo-random functions, Luby, M. and Rackoff, C.
- The bit security of modular squaring given partial factorization of the modulos, Chor, B., Goldreich, O. and Goldwasser, S.
- Some cryptographic aspects of womcodes, Godlewski, P. and Cohen, G. D.
- How to reduce your enemy's information, Bennett, C. H., Brassard, G. and Robert, J. M.
- Encrypting problem instances: Or ... can you take advantage of someone without having to trust him?, Feigenbaum, J.
- Divergence bounds on key equivocation and error probability in cryptanalysis, van Tilburg, J. and Boekee, D. E.
- A chosen text attack on the RSA cryptosystem and some discrete logarithm schemes, Desmedt, Y. and Odlyzko, A. M.
- On the design of S-boxes, Webster, A. F. and Tavares, S. E.
- The real reason for Rivest's phenomenon, Coppersmith, D.
- The importance of "good" key scheduling schemes (how to make a secure DES scheme with < 48 bits keys?), Quisquater, J. J., Desmedt, Y. and Davio, M.
- Access control at the Netherlands postal and telecommunications services, Haemers, W.
Copyright © 1998, Springer-Verlag.