Advances in Cryptology - EUROCRYPT '91: Workshop on the Theory and Application of Cryptographic Techniques, Brighton, UK, April 8-11, 1991. Proceedings (Lecture Notes in Computer Science)

This proceedings volume contains revised versions of papers presented at an open workshop on modern cryptology held in Brighton, UK, April 1991. The workshop was the latest in a series of workshops on cryptology which began in Santa Barbara in 1981 and was followed by a European counterpart in 1982. Following the tradition of the series, papers were invited in the form of extended abstracts and were reviewed by the programme committee, which selected those to be presented. After the meeting, the full papers were produced which form the main part of the volume. The papers are organized into sections on cryptanalysis, zero knowledge and oblivious transfer, sequences, signatures, theory, S-box criteria, applications, and public key cryptography, and a section containing short "rump session" papers. Differential Cryptanalysis of Feal and N-Hash....Pages 1-16 Markov Ciphers and Differential Cryptanalysis....Pages 17-38 The Knapsack Hash Function proposed at Crypto’89 can be broken....Pages 39-53 An Improved Low-Density Subset Sum Algorithm....Pages 54-67 Cryptanalysis of McEliece’s Public-Key Cryptosystem....Pages 68-70 On the Security of the Schnorr Scheme using Preprocessing....Pages 71-80 Broadcast Interactive Proofs....Pages 81-95 Direct Zero Knowledge Proofs of Computational Power in Five Rounds....Pages 96-105 On the Reversibility of Oblivious Transfer....Pages 106-113 Ziv-Lempel Complexity for Periodic Sequences and its Cryptographic Application....Pages 114-126 A Secret Key Cryptosystem by Iterating a Chaotic Map....Pages 127-140 Boolean Functions Satisfying Higher Order Propagation Criteria....Pages 141-152 The Maximum Order Complexity of Sequence Ensembles....Pages 153-159 The Number of Output Sequences of a Binary Sequence Generator....Pages 160-167 Linear Complexity of Periodically Repeated Random Sequences....Pages 168-175 On A Fast Correlation Attack on Certain Stream Ciphers....Pages 176-185 Analysis of Pseudo Random Sequences Generated by Cellular Automata....Pages 186-199 On Binary Sequences from Recursions “modulo 2 e ” Made Non-Linear by the Bit-By-Bit “XOR” Function....Pages 200-204 Weaknesses of Undeniable Signature Schemes....Pages 205-220 Distributed Provers with Applications to Undeniable Signatures....Pages 221-242 Interactive Bi-Proof Systems and Undeniable Signature Schemes....Pages 243-256 Group Signatures....Pages 257-265 Enhancing Secrecy by Data Compression: Theoretical and Practical Aspects....Pages 266-280 Factoring Integers and Computing Discrete Logarithms via Diophantine Approximation....Pages 281-293 Some Considerations concerning the Selection of RSA Moduli....Pages 294-301 On the Use of Interconnection Networks in Cryptography....Pages 302-315 Non Supersingular Elliptic Curves for Public Key Cryptosystems....Pages 316-327 Building Cyclic Elliptic Curves Modulo Large Primes....Pages 328-336 On the Complexity of Hyperelliptic Discrete Logarithm Problem....Pages 337-351 An Expanded Set of S-box Design Criteria Based on Information Theory and its Relation to Differential-Like Attacks....Pages 352-367 Enumerating Nondegenerate Permutations....Pages 368-377 Perfect nonlinear S-boxes....Pages 378-386 A Formal Approach to Security Architectures....Pages 387-398 Discrete Logarithm Based Protocols....Pages 399-408 Human Identification Through Insecure Channel....Pages 409-421 The Automated Cryptanalysis of Analog Speech Scramblers....Pages 422-430 A Construction for One Way Hash Functions and Pseudorandom Bit Generators....Pages 431-445 ESIGN: An Efficient Digital Signature Implementation for Smart Cards....Pages 446-457 New Approaches to the Design of Self-Synchronizing Stream Ciphers....Pages 458-471 Randomized Authentication Systems....Pages 472-481 Ideals over a Non-Commutative Ring and their Application in Cryptology....Pages 482-489 Self-certified public keys....Pages 490-497 Non-interactive Public-Key Cryptography....Pages 498-507 Hash Functions And Graphs With Large Girths....Pages 508-511 Dickson Pseudoprimes and Primality Testing....Pages 512-516 Equivalent Goppa Codes and Trapdoors to McEliece’s Public Key Cryptosystem....Pages 517-521 A Threshold Cryptosystem without a Trusted Party....Pages 522-526 A Comparison of Cryptanalytic Principles Based on Iterative Error-Correction....Pages 527-531 Cryptanalysis of the Chaotic-Map Cryptosystem Suggested at EUROCRYPT’91....Pages 532-534 How To Broadcast A Secret....Pages 535-541 Probabilistic Analysis of Elementary Randomizers....Pages 542-546 Race Integrity Primitives Evaluation (RIPE): A status report....Pages 547-551 The Information Leakage through a Randomly Generated Function....Pages 552-553 Some Weaknesses of “Weaknesses of Undeniable Signatures”....Pages 554-556 A series of open workshops devoted to modem cryptology began in Santa Barbara, California in 1981 and was followed in 1982 by a European counterpart in Burg Feurstein, Germany. The series has been maintained with summer meetings in Santa Barbara and spring meetings somewhere in Europe. At the 1983 meeting in Santa Barbara the International Association for Cryptologic Research was launched and it now sponsors all the meetings of the series. Following the tradition of the series, papers were invited in the form of extended abstracts and were reviewed by the programme committee, which selected those to be presented. After the meeting, full papers were produced, in some cases with impro- ments and corrections. These papers form the main part of the present volume. They are placed in the same order that they took at the meeting and under the same headings, for ease of reference by those who attended. The classification under these headings was a little arbitary, needing to fit the timing of the day{u2018}s activities, but it makes a workable method of arrangement. Also following tradition, a ?rump session{u2019}{u2019} was held during one evening, under the effective chairmanship of John Gordon. These were short presentations and those present found them to have some real interest, therefore we have taken the unusual step of including short papers contributed by the rump session speakers at the end of this volume, with a necessarily simplified review process This proceedings volume contains papers presented at a workshop on modern cryptology. The contributions are organized into sections on cryptanalysis, zero knowledge and oblivious transfer, sequences, signatures, S-box criteria, public key cryptography and applications.