Advances in Cryptology
EuroCrypt '91
Edited by Donald W. Davies
- Differential cryptanalysis of Feal and N-Hash, Biham, E. and Shamir, A.
- Markov ciphers and differential cryptanalysis, Lai, X. and Massey, J. L.
- The knapsack hash function proposed at Crypto'89 can be broken, Camion, P. and Patarin, J.
- An improved low-density subset sum algorithm, Coster, M. J., LaMacchia, B. A., Odlyzko, A. M. and Schnorr, C. P.
- Cryptanalysis of McEliece's Public-Key Cryptosystem, Korzhik, Valery I. and Turkin, Andrey I.
- On the security of the Schnorr scheme using preprocessing, Rooij, P. de
- Broadcast interactive proofs, Burmester, M. V. D. and Desmedt, Y.
- Direct zero knowledge proofs of computational power in five rounds, Okamoto, T., Chaum, D. and Ohta, K.
- On the reversibility of oblivious transfer, Crépeau, C. and Santha, M.
- Ziv-Lempel complexity for periodic sequences and its cryptographic application, Mund, S.
- A secret key cryptosystem by iterating a chaotic map, Habutsu, T., Nishio, Y., Sasase, Iwao and Mori, S.
- Boolean functions satisfying higher order propagation criteria, Preneel, B., Govaerts, R. and Vandewalle, J.
- The maximum order complexity of sequence ensembles, Jansen, C. J. A.
- The number of output sequences of a binary sequence generator, Golic, J. D.
- Linear complexity of periodically repeated random sequences, Dai, Z. and Yang, J.-H.
- On a fast correlation attack on certain stream ciphers, Chepyzhov, V. and Smeets, B.
- Analysis of pseudo random sequences generated by cellular automata, Meier, W. and Staffelbach, O.
- On binary sequences from recursions "modulo 2e" made non-linear by the bit-by-bit "xor" function, Chambers, W. G.
- Weaknesses of undeniable signature schemes, Desmedt, Y. and Yung, M.
- Distributed provers with applications to undeniable signatures, Pedersen, T. P.
- Interactive bi-proof systems and undeniable signature schemes, Fujioka, A., Okamoto, T. and Ohta, K.
- Group signatures, Chaum, D. and Heyst, E. van
- Enhancing secrecy by data compression: Theoretical and practical aspects, Boyd, C.
- Factoring integers and computing discrete logarithms via diophantine approximation, Schnorr, C. P.
- Some considerations concerning the selection of RSA moduli, Huber, K.
- On the use of interconnection networks in cryptography, Portz, M.
- Non supersingular elliptic curves for public key cryptosystems, Beth, T. and Schaefer, F.
- Building cyclic elliptic curves modulo large primes, Morain, F.
- On the complexity of hyperelliptic discrete logarithm problem, Shizuya, H.
- An expanded set of S-box design criteria based on information theory and its relation to differential-like attacks, Dawson, M. H. and Tavares, S. E.
- Enumerating nondegenerate permutations, O'Connor, L.
- Perfect nonlinear S-boxes, Nyberg, K.
- A formal approach to security architectures, Rueppel, R. A.
- Discrete logarithm based protocols, Horster, P. and Knobloch, H.-J.
- Human identification through insecure channel, Matsumoto, T. and Imai, H.
- The Automated Cryptanalysis of Analog Speech Scramblers, Goldburg, B., Dawson, E. and Sridharan, S.
- A construction for one-way hash functions and pseudorandom bit generators, Sadeghiyan, B. and Pieprzyk, J.
- ESIGN: An efficient digital signature implementation for smart cards, Fujioka, A., Okamoto, T. and Miyaguchi, S.
- New approaches to the design of self-synchronizing stream ciphers, Maurer, U. M.
- Randomized authentication systems, Pieprzyk, J. and Safavi-Naini, R.
- Ideals over a non-commutative ring and their application in cryptology, Gabidulin, E. M., Paramonov, A. V. and Tretjakov, O. V.
- Self-certified public keys, Girault, M.
- Non-interative public-key cryptography, Maurer, U. M. and Yacobi, Y.
- Hash functions and graphs with large girths, Zemor, G.
- Dickson pseudoprimes and primality testing, Mueller, W. B. and Oswald, A.
- Equivalent Goppa codes and trapdoors to McEliece's public key cryptosystem, Gibson, J. K.
- A threshold cryptosystem without a trusted party (Extended abstract), Pedersen, T. P.
- A comparison of cryptoanalytic principles based on iterative error-correction, Mihaljevic, M. J. and Golic, J. D.
- Cryptanalysis of the chaotic-map cryptosystem suggested at EUROCRYPT'91, Biham, E.
- How to broadcast a secret, Berkovits, S.
- Probabilistic analysis of elementary randomizers, Pieprzyk, J.
- Race Integrity Primitives Evaluation, Preneel, B., Chaum, D., Fumy, W., Jansen, C. J. A., Landrock, P. and Roelofsen, G.
- The information leakage through a randomly generated function, Brynielsson, L.
- Some Weaknesses of "Weaknesses of Undeniable Signatures", Chaum, D.
Copyright © 1998, Springer-Verlag.