Front matter
1-16
Differential Cryptanalysis of Feal and N-Hash
Eli Biham and Adi Shamir
17-38
Markov Ciphers and Differential Cryptanalysis
Xuejia Lai, James L. Massey and Sean Murphy
39-53
The Knapsack Hash Function proposed at Crypto’89 can be broken
Paul Camion and Jacques Patarin
54-67
An Improved Low-Density Subset Sum Algorithm
M. J. Coster, B. A. LaMacchia, A. M. Odlyzko and C. P. Schnorr
68-70
Cryptanalysis of McEliece’s Public-Key Cryptosystem
Valery I. Korzhik and Andrey I. Turkin
71-80
On the Security of the Schnorr Scheme using Preprocessing
Peter de Rooij
81-95
Broadcast Interactive Proofs
Extended Abstract
Mike Burmester and Yvo Desmedt
96-105
Direct Zero Knowledge Proofs of Computational Power in Five Rounds
Tatsuaki Okamoto, David Chaum and Kazuo Ohta
106-113
On the Reversibility of Oblivious Transfer
Claude Crépeau and Miklós Sántha
114-126
Ziv-Lempel Complexity for Periodic Sequences and its Cryptographic Application
Sibylle Mund
127-140
A Secret Key Cryptosystem by Iterating a Chaotic Map
Toshiki Habutsu, Yoshifumi Nishio, Iwao Sasase and Shinsaku Mori
141-152
Boolean Functions Satisfying Higher Order Propagation Criteria
B. Preneel, René Govaerts and Joos Vandewalle
153-159
The Maximum Order Complexity of Sequence Ensembles
Cees J. A. Jansen
160-167
The Number of Output Sequences of a Binary Sequence Generator
Jovan Dj. Golić
168-175
Linear Complexity of Periodically Repeated Random Sequences
Zong-Duo Dai and Jun-Hui Yang
176-185
On A Fast Correlation Attack on Certain Stream Ciphers
Vladimir Chepyzhov and Ben Smeets
186-199
Analysis of Pseudo Random Sequences Generated by Cellular Automata
Willi Meier and Othmar Staffelbach
200-204
On Binary Sequences from Recursions “modulo 2e” Made Non-Linear by the Bit-By-Bit “XOR” Function
W. G. Chambers and Z. D. Dai
205-220
Weaknesses of Undeniable Signature Schemes
Extended Abstract
Yvo Desmedt and Moti Yung
221-242
Distributed Provers with Applications to Undeniable Signatures
Torben Pryds Pedersen
243-256
Interactive Bi-Proof Systems and Undeniable Signature Schemes
Atsushi Fujioka, Tatsuaki Okamoto and Kazuo Ohta
257-265
Group Signatures
David Chaum and Eugène van Heyst
266-280
Enhancing Secrecy by Data Compression: Theoretical and Practical Aspects
Colin Boyd
281-293
Factoring Integers and Computing Discrete Logarithms via Diophantine Approximation
C. P. Schnorr
294-301
Some Considerations concerning the Selection of RSA Moduli
Klaus Huber
302-315
On the Use of Interconnection Networks in Cryptography
Michael Portz
316-327
Non Supersingular Elliptic Curves for Public Key Cryptosystems
T. Beth and F. Schaefer
328-336
Building Cyclic Elliptic Curves Modulo Large Primes
François Morain
337-351
On the Complexity of Hyperelliptic Discrete Logarithm Problem
Haroka Shizuya, Toshiya Itoh and Kouichi Sakurai
352-367
An Expanded Set of S-box Design Criteria Based on Information Theory and its Relation to Differential-Like Attacks
M. H. Dawson and S. E. Tavares
368-377
Enumerating Nondegenerate Permutations
Luke O’Connor
378-386
Perfect nonlinear S-boxes
Kaisa Nyberg
387-398
A Formal Approach to Security Architectures
Rainer A. Rueppel
399-408
Discrete Logarithm Based Protocols
Patrick Horster and Hans-Joachim Knobloch
409-421
Human Identification Through Insecure Channel
Tsutomu Matsumoto and Hideki Imai
422-430
The Automated Cryptanalysis of Analog Speech Scramblers
B Goldburg, E Dawson and S Sridharan
431-445
A Construction for One Way Hash Functions and Pseudorandom Bit Generators
Babak Sadeghiyan and Josef Pieprzyk
446-457
ESIGN: An Efficient Digital Signature Implementation for Smart Cards
Atsushi Fujioka, Tatsuaki Okamoto and Shoji Miyaguchi
458-471
New Approaches to the Design of Self-Synchronizing Stream Ciphers
Ueli M. Maurer
472-481
Randomized Authentication Systems
Josef Pieprzyk and Reihaneh Safavi-Naini
482-489
Ideals over a Non-Commutative Ring and their Application in Cryptology
E. M. Gabidulin, A. V. Paramonov and O. V. Tretjakov
490-497
Self-certified public keys
Marc Girault
498-507
Non-interactive Public-Key Cryptography
Ueli M. Maurer and Yacov Yacobi
508-511
Hash Functions And Graphs With Large Girths
G. Zémor
512-516
Dickson Pseudoprimes and Primality Testing
Winfried B. Müller and Alan Oswald
517-521
Equivalent Goppa Codes and Trapdoors to McEliece’s Public Key Cryptosystem
J. K. Gibson
522-526
A Threshold Cryptosystem without a Trusted Party
(Extended abstract)
Torben Pryds Pedersen
527-531
A Comparison of Cryptanalytic Principles Based on Iterative Error-Correction
Miodrag J. Mihaljević and Jovan Dj. Golić
532-534
Cryptanalysis of the Chaotic-Map Cryptosystem Suggested at EUROCRYPT’91
Eli Biham
535-541
How To Broadcast A Secret
Shimshon Berkovits
542-546
Probabilistic Analysis of Elementary Randomizers
Josef Pieprzyk
547-551
Race Integrity Primitives Evaluation (RIPE): A status report
B. Preneel, D. Chaum, W. Fumy, C. J. A. Jansen and P. Landrock, et al.
552-553
The Information Leakage through a Randomly Generated Function
Lennart Brynielsson
554-556
Some Weaknesses of “Weaknesses of Undeniable Signatures”
David Chaum