1. G. R. Blakley, Information theory without the finiteness assumption, I: Cryptosystems as group-theoretic objects. in G. R. Blakley and D. Chaum (editors), Advances in Cryptology, Proceedings of Crypto’ 84, Springer-Verlag, Berlin (1985), 314–338.
2. G. R. Blaldey, Information theory without the finiteness assumption, II: Unfolding the DES. in H. Williams (editor), Advances in Cryptology, Proceedings of Crypto’ 85, Springer-Verlag, Berlin (1986), to appear.
3. G. R. Blakley and C Meadows, Information theory without the finiteness assumption, III: Data compression and codes whose rates exceed unity. Proceedings of the 1986 Cirencester Conference on Cryptography and Coding, IMA, (1987) to appear.
4. E. Brickell, Breaking iterated knapsacks, in G. R. Blakley and D. Chaum (editors), Advances in Cryptology, Proceedings of Crypto’ 84, Springer-Verlag, Berlin (1985), 342–358.
5. G. I. Davida, C. Gilbertson and G. Walter, Analog cryptosystems, in Proceedings of Eurocrypt’ 85, Springer-Verlag, Berlin (1986), to appear, also Technical Report TRCS-84-1. Department of Electrical Engineering and Computer Science, University of Wisconsin, Milwaukee, (1984).