Advances in Cryptology — EUROCRYPT ’91: Workshop on the Theory and Application of Cryptographic Techniques Brighton, UK, April 8–11, 1991 Proceedings

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