Abstract is missing.
- Differential Cryptoanalysis of Feal and N-HashEli Biham, Adi Shamir. 1-16 [doi]
- Markov Ciphers and Differentail CryptanalysisXuejia Lai, James L. Massey. 17-38 [doi]
- The Knapsack Hash Function proposed at Crypto 89 can be brokenPaul Camion, Jacques Patarin. 39-53 [doi]
- An Iproved Low-Denisty Subset Sum AlgorithmMatthijs J. Coster, Brian A. LaMacchia, Andrew M. Odlyzko. 54-67 [doi]
- Cryptoanalysis of McEliece s Public-Key CryptosystemValery I. Korzhik, Andrew I. Turkin. 68-70 [doi]
- On the Security of the Schnorr Scheme using PreprocessingPeter de Rooij. 71-80 [doi]
- Broadcast Interactive Proofs (Extended Abstract)Mike Burmester, Yvo Desmedt. 81-95 [doi]
- Direct Zero Knowledge Proofs of Computational Power in Five RoundsTatsuaki Okamoto, David Chaum, Kazuo Ohta. 96-105 [doi]
- On the Reversibility of Oblivious TransferClaude Crépeau, Miklos Santha. 106-113 [doi]
- Liv-Lempel Complexity for Periodic Sequences and its Cryptographic ApplicationSibylle Mund. 114-126 [doi]
- A Secret Key Cryptosystem by Iterating a Chaotic MapToshiki Habutsu, Yoshifumi Nishio, Iwao Sasase, Shinsaku Mori. 127-140 [doi]
- Boolean Functions Satisfying Higher Order Propagation CriteriaBart Preneel, René Govaerts, Joos Vandewalle. 141-152 [doi]
- The Maximum Order Complexity of Sequence EnsemblesCees J. A. Jansen. 153-159 [doi]
- The Number of Output Sequences of a Binary Sequence GeneratorJovan Dj. Golic. 160-167 [doi]
- Linear Complexity of Periodically Repeated Random SequencesZong-Duo Dai, Jun-Hui Yang. 168-175 [doi]
- On A Fast Correlation Attack on Certain Stream CiphersVladimor V. Chepyzhov, Ben J. M. Smeets. 176-185 [doi]
- Analysis of Pseudo Random Sequence Generated by Cellular AutomataWilli Meier, Othmar Staffelbach. 186-199 [doi]
- On Binary Sequences from Recursions modulo 2:::e::: Made Non-Linear by the Bit-by-Bit XOR FunctionWilliam G. Chambers, Zong-Duo Dai. 200-204 [doi]
- Weakness of Undeniable Signature Schemes (Extended Abstract)Yvo Desmedt, Moti Yung. 205-220 [doi]
- Distributed Provers with Applications to Undeniable SignaturesTorben P. Pedersen. 221-242 [doi]
- Interactive Bi-Proof Systems and Undeniable Signature SchemesAtsushi Fujioka, Tatsuaki Okamoto, Kazuo Ohta. 243-256 [doi]
- Group SignaturesDavid Chaum, Eugène van Heyst. 257-265 [doi]
- Enhancing Secrecy by Data Compression: Theoretical and Practical AspectsColin Boyd. 266-280 [doi]
- Factoring Integers and Computing Discrete Logarithms via Diophantine ApproximationsClaus-Peter Schnorr. 281-293 [doi]
- Some Considerations concerning the Selection of RSA ModuliKlaus Huber. 294-301 [doi]
- Non Supersingular Elliptic Curves for Public Key CryptosystemsThomas Beth, F. Schaefer. 316-327 [doi]
- Building Elliptic Curves Modulo Large PrimesFrançois Morain. 328-336 [doi]
- On the Complexity of Hyperelliptic Discrete Logarithm ProblemHiroki Shizuya, Toshiya Itoh, Kouichi Sakurai. 337-351 [doi]
- Enumerating Nondegenerate PermutationsLuke O Connor. 368-377 [doi]
- Perfect Nonlinear S-BoxesKaisa Nyberg. 378-386 [doi]
- Discrete Logarithm Based ProtocolsPatrick Horster, Hans-Joachim Knobloch. 399-408 [doi]
- Human Identification Through Insecure ChannelTsutomu Matsumoto. 409-421 [doi]
- The Automated Cryptoanalysis of Analog Speech ScramblersBruce Goldburg, Ed Dawson, S. Sridharan. 422-430 [doi]
- A Construction for One Way Hash Functions and Pseudorandom Bit GeneratorsBabak Sadeghiyan, Josef Pieprzyk. 431-445 [doi]
- ESIGN: An Efficient Digital Signature Implementation for Smard CardsAtsushi Fujioka, Tatsuaki Okamoto, Shoji Miyaguchi. 446-457 [doi]
- New Approaches to the Design of Self-Synchronizing Stream CiphersUeli M. Maurer. 458-471 [doi]
- Randomized Authentication SystemsJosef Pieprzyk, Reihaneh Safavi-Naini. 472-481 [doi]
- Ideals over a Non-Commutative Ring and thier Applications in CryptologyErnst M. Gabidulin, A. V. Paramonov, O. V. Tretjakov. 482-489 [doi]
- Self-Certified Public KeysMarc Girault. 490-497 [doi]
- Non-interactive Public-Key CryptographyUeli M. Maurer, Yacov Yacobi. 498-507 [doi]
- A Threshold Cryptosystem without a Trusted Party (Extended Abstract)Torben P. Pedersen. 522-526 [doi]
- A Comparison of Cryptoanalytic Principles Based on Iterative Error-CorrectionMiodrag J. Mihaljevic, Jovan Dj. Golic. 527-531 [doi]
- How To Broadcast A SecretShimshon Berkovits. 535-541 [doi]
- Probabilistic Analysis of Elementary RandimizersJosef Pieprzyk. 542-546 [doi]
- Race Integrity Primitives Evaluation (RIPE): A Status ReportBart Preneel, David Chaum, Walter Fumy, Cees J. A. Jansen, Peter Landrock, Gert Roelofsen. 547-551 [doi]
- Some Weaknesses of Weaknesses of Undeniable Signatures David Chaum. 554-556 [doi]