EUROCRYPT 1991: Brighton, UK

Crytanalysis I

• Eli Biham, Adi Shamir:
  Differential Cryptoanalysis of Feal and N-Hash. 1-16
  
• Xuejia Lai, James L. Massey:
  Markov Ciphers and Differentail Cryptanalysis. 17-38
  
• Paul Camion, Jacques Patarin:
  The Knapsack Hash Function proposed at Crypto'89 can be broken. 39-53
  

Cryptanalysis II

• Matthijs J. Coster, Brian A. LaMacchia, Andrew M. Odlyzko:
  An Iproved Low-Denisty Subset Sum Algorithm. 54-67
  
• Valery I. Korzhik, Andrew I. Turkin:
  Cryptoanalysis of McEliece's Public-Key Cryptosystem. 68-70
  
• Peter de Rooij:
  On the Security of the Schnorr Scheme using Preprocessing. 71-80
  

Zero Knowledge and Oblivious Transfer

• Mike Burmester, Yvo Desmedt:
  Broadcast Interactive Proofs (Extended Abstract). 81-95
  
• Tatsuaki Okamoto, David Chaum, Kazuo Ohta:
  Direct Zero Knowledge Proofs of Computational Power in Five Rounds. 96-105
  
• Claude Crépeau, Miklos Santha:
  On the Reversibility of Oblivious Transfer. 106-113
  

Sequences I

• Sibylle Mund:
  Liv-Lempel Complexity for Periodic Sequences and its Cryptographic Application. 114-126
  
• Toshiki Habutsu, Yoshifumi Nishio, Iwao Sasase, Shinsaku Mori:
  A Secret Key Cryptosystem by Iterating a Chaotic Map. 127-140
  
• Bart Preneel, René Govaerts, Joos Vandewalle:
  Boolean Functions Satisfying Higher Order Propagation Criteria. 141-152
  

Sequences II

• Cees J. A. Jansen:
  The Maximum Order Complexity of Sequence Ensembles. 153-159
  
• Jovan Dj. Golic:
  The Number of Output Sequences of a Binary Sequence Generator. 160-167
  
• Zong-Duo Dai, Jun-Hui Yang:
  Linear Complexity of Periodically Repeated Random Sequences. 168-175
  

Sequences III

• Vladimor V. Chepyzhov, Ben J. M. Smeets:
  On A Fast Correlation Attack on Certain Stream Ciphers. 176-185
  
• Willi Meier, Othmar Staffelbach:
  Analysis of Pseudo Random Sequence Generated by Cellular Automata. 186-199
  
• William G. Chambers, Zong-Duo Dai:
  On Binary Sequences from Recursions modulo 2^e Made Non-Linear by the Bit-by-Bit XOR Function. 200-204
  

Signatures

• Yvo Desmedt, Moti Yung:
  Weakness of Undeniable Signature Schemes (Extended Abstract). 205-220
  
• Torben P. Pedersen:
  Distributed Provers with Applications to Undeniable Signatures. 221-242
  
• Atsushi Fujioka, Tatsuaki Okamoto, Kazuo Ohta:
  Interactive Bi-Proof Systems and Undeniable Signature Schemes. 243-256
  
• David Chaum, Eugène van Heyst:
  Group Signatures. 257-265
  

Theory I

• Colin Boyd:
  Enhancing Secrecy by Data Compression: Theoretical and Practical Aspects. 266-280
  
• Claus-Peter Schnorr:
  Factoring Integers and Computing Discrete Logarithms via Diophantine Approximations. 281-293
  
• Klaus Huber:
  Some Considerations concerning the Selection of RSA Moduli. 294-301
  
• Michael Portz:
  On the Use of Interconnection Networks in Cryptography. 302-315
  

Theory II

• Thomas Beth, F. Schaefer:
  Non Supersingular Elliptic Curves for Public Key Cryptosystems. 316-327
  
• François Morain:
  Building Elliptic Curves Modulo Large Primes. 328-336
  
• Hiroki Shizuya, Toshiya Itoh, Kouichi Sakurai:
  On the Complexity of Hyperelliptic Discrete Logarithm Problem. 337-351
  

S-Box Criteria

• M. H. Dawson, Stafford E. Tavares:
  An Expanded Set of S-box Design Criteria Based on Information Theory and its Relation to Differential-Like Attacks. 352-367
  
• Luke O'Connor:
  Enumerating Nondegenerate Permutations. 368-377
  
• Kaisa Nyberg:
  Perfect Nonlinear S-Boxes. 378-386
  

Applications I

• Rainer A. Rueppel:
  A Formal Approach to Security Architectures. 387-398
  
• Patrick Horster, Hans-Joachim Knobloch:
  Discrete Logarithm Based Protocols. 399-408
  
• Tsutomu Matsumoto:
  Human Identification Through Insecure Channel. 409-421
  
• Bruce Goldburg, Ed Dawson, S. Sridharan:
  The Automated Cryptoanalysis of Analog Speech Scramblers. 422-430
  

Applications II

• Babak Sadeghiyan, Josef Pieprzyk:
  A Construction for One Way Hash Functions and Pseudorandom Bit Generators. 431-445
  
• Atsushi Fujioka, Tatsuaki Okamoto, Shoji Miyaguchi:
  ESIGN: An Efficient Digital Signature Implementation for Smard Cards. 446-457
  
• Ueli M. Maurer:
  New Approaches to the Design of Self-Synchronizing Stream Ciphers. 458-471
  
• Josef Pieprzyk, Reihaneh Safavi-Naini:
  Randomized Authentication Systems. 472-481
  

Public Key Cryptography

• Ernst M. Gabidulin, A. V. Paramonov, O. V. Tretjakov:
  Ideals over a Non-Commutative Ring and thier Applications in Cryptology. 482-489
  
• Marc Girault:
  Self-Certified Public Keys. 490-497
  
• Ueli M. Maurer, Yacov Yacobi:
  Non-interactive Public-Key Cryptography. 498-507
  

Short Papers Presented at the "Rump Session"

• Gilles Zémor:
  Hash Functions And Graphs With Large Girths. 508-511
  
• Winfried B. Müller, Alan Oswald:
  Dickson Pseudoprimes and Primality Testing. 512-516
  
• J. K. Gibson:
  Equivalent Goppa Codes and Trapdoors to McEliece's Public Key Cryptosystem. 517-521
  
• Torben P. Pedersen:
  A Threshold Cryptosystem without a Trusted Party (Extended Abstract). 522-526
  
• Miodrag J. Mihaljevic, Jovan Dj. Golic:
  A Comparison of Cryptoanalytic Principles Based on Iterative Error-Correction. 527-531
  
• Eli Biham:
  Cryptoanalysis of the Chaotic-Map Cryptosystem Suggested at EUROCRYPT'91. 532-534
  
• Shimshon Berkovits:
  How To Broadcast A Secret. 535-541
  
• Josef Pieprzyk:
  Probabilistic Analysis of Elementary Randimizers. 542-546
  
• Bart Preneel, David Chaum, Walter Fumy, Cees J. A. Jansen, Peter Landrock, Gert Roelofsen:
  Race Integrity Primitives Evaluation (RIPE): A Status Report. 547-551
  
• Lennart Brynielsson:
  The Information Leakage through a Randomly Generated Function. 552-553
  
• David Chaum:
  Some Weaknesses of "Weaknesses of Undeniable Signatures". 554-556