Publications from Journal of Cryptology, 1992

Page	Title
3-28	Experimental Quantum Cryptography
29-39	An Interactive Identification Scheme Based on Discrete Logarithms and Factoring
41-52	Which New RSA-Signatures Can be Computed from Certain Given RSA-Signatures?
53-66	Conditionally-Perfect Secrecy and a Provably-Secure Randomized Cipher
67-86	Correlation Properties of Combiners with Memory in Stream Ciphers
89-105	A Universal Statistical Test for Random Bit Generators
107-131	Counting Binary Functions with Certain Cryptographic Properties
133-137	Some Remarks on the Security of the Identification Scheme Based on Permuted Kernels
139-150	A Cubic RSA Code Equivalent to Factorization
153-166	Some Improved Bounds on the Information Rate of Perfect Secret Sharing Schemes
167-183	Algebraic Properties of Cryptosystem PGM
185-191	Strongly Ideal Secret Sharing Schemes
193-207	Binary Sequences Derived from ML-Sequences over Rings, I: Periods of Minimal Polynomials