Cryptography Workshop (EUROCRYPT) 1982: Burg Feuerstein, Germany

Introduction

• Thomas Beth:
  Introduction. 1-30
  

Classical Cryptography

• Friedrich L. Bauer:
  Cryptology - Methods and Maxims. 31-48
  
• Alan G. Konheim:
  Cryptoanalysis of a Kryha Machine. 49-64
  
• H. R. Schuchmann:
  Enigma Variations. 65-68
  

Mathematical Foundations

• N. J. A. Sloane:
  Encrypting by Random Rotations. 71-128
  

Analogue Scrambling Schemes

• H. J. Beker:
  Analog Speech security Systems. 130-146
  
• Klaus Wirl, Peter Hess:
  A voice Scrambling System for Testing and Demonstration. 147-156
  
• Klaus-P. Timmann:
  The Rating of Understanding in Secure Voice Communication Systems. 157-163
  
• László Györfi, István Kerekes:
  Analysis of Multiple Access Channel using Multiple Level FSK. 165-172
  
• Franz Pichler:
  Analog Scrambling by the General Fast Fourier Transform. 173-178
  

Stream Ciphers

• Fred Piper:
  Stream Ciphers. 181-188
  
• S. M. Jennings:
  Multiplexed Sequences: Some Properties of the Minimum Polynomial. 189-206
  
• Tore Herlestam:
  On Using Prime Polynomials in Crypto Generators. 207-216
  

Cryptography in Large Communication Systems

• M. R. Oberman:
  Communication Security in Remote controlled Computer Systems. 219-227
  
• Lothar Horbach:
  Privacy and Data Protection in Medicine. 228-232
  

The Data Encryption Standard

• Ingrid Schaumüller-Bichl:
  Cryptonalysis of the Data Encryption Standard by the Method of Formal Coding. 235-255
  
• J. A. Gordon, H. Retkin:
  Are Big S-Boxes Best? 257-262
  
• Donald W. Davies, Graeme I. P. Parkin:
  The average Cycle size of the Key-Stream in Output Feedback Encipherment. 263-279
  

Authentication Systems

• Marc Davio:
  Jean-Marie Goethals, Jean-Jacques Quisquater: Authentication Procedures. 283-288
  
• P. Schöbe, James L. Massey:
  Fast Authentication in a Trapdoor - Knapsack Public Key Cryptosystem. 289-306
  

The Merkle - Hellman - Scheme

• Ingemar Ingemarsson:
  A new Algorithm for the Solution of the Knapsack Problem. 309-315
  
• R. Eier, Helmut Lagger:
  Trapdoors in Knapsack Cryptosystems. 316-322
  

The Rivest-Shamir-Adleman-Scheme

• Claus-Peter Schnorr:
  Is the RSA Scheme Safe? 325-329
  
• Jürgen Sattler, Claus-Peter Schnorr:
  Ein Effizienzvergleich der Factorisierungsverfahren von Morrison-Brillhart und Schroeppel. 331-351
  
• A. Ecker:
  Finite Semigroups and the RSA-Cryptosystem. 353-369
  
• Maurice Mignotte:
  How to Share a Secret? 371-375