Search
International Association for Cryptologic Research
What's new
Archive
Paper awards
Videos
Authors
Coauthors
By year
By venue
All Committees
Most Committees
Report errors
About
Publications of Eurocrypt 1991
Page
Title
1-16
Differential Cryptanalysis of Feal and N-Hash
17-38
Markov Ciphers and Differentail Cryptanalysis
39-53
The Knapsack Hash Function proposed at Crypto'89 can be broken
54-67
An Iproved Low-Denisty Subset Sum Algorithm
68-70
Cryptoanalysis of McEliece's Public-Key Cryptosystem
71-80
On the Security of the Schnorr Scheme using Preprocessing
81-95
Broadcast Interactive Proofs (Extended Abstract)
96-105
Direct Zero Knowledge Proofs of Computational Power in Five Rounds
106-113
On the Reversibility of Oblivious Transfer
114-126
Liv-Lempel Complexity for Periodic Sequences and its Cryptographic Application
127-140
A Secret Key Cryptosystem by Iterating a Chaotic Map
141-152
Boolean Functions Satisfying Higher Order Propagation Criteria
153-159
The Maximum Order Complexity of Sequence Ensembles
160-167
The Number of Output Sequences of a Binary Sequence Generator
168-175
Linear Complexity of Periodically Repeated Random Sequences
176-185
On A Fast Correlation Attack on Certain Stream Ciphers
186-199
Analysis of Pseudo Random Sequence Generated by Cellular Automata
200-204
On Binary Sequences from Recursions modulo 2
^{e}
Made Non-Linear by the Bit-by-Bit XOR Function
205-220
Weakness of Undeniable Signature Schemes (Extended Abstract)
221-242
Distributed Provers with Applications to Undeniable Signatures
243-256
Interactive Bi-Proof Systems and Undeniable Signature Schemes
257-265
Group Signatures
266-280
Enhancing Secrecy by Data Compression: Theoretical and Practical Aspects
281-293
Factoring Integers and Computing Discrete Logarithms via Diophantine Approximations
294-301
Some Considerations concerning the Selection of RSA Moduli
302-315
On the Use of Interconnection Networks in Cryptography
316-327
Non Supersingular Elliptic Curves for Public Key Cryptosystems
328-336
Building Elliptic Curves Modulo Large Primes
337-351
On the Complexity of Hyperelliptic Discrete Logarithm Problem
352-367
An Expanded Set of S-box Design Criteria Based on Information Theory and its Relation to Differential-Like Attacks
368-377
Enumerating Nondegenerate Permutations
378-386
Perfect Nonlinear S-Boxes
387-398
A Formal Approach to Security Architectures
399-408
Discrete Logarithm Based Protocols
409-421
Human Identification Through Insecure Channel
422-430
The Automated Cryptoanalysis of Analog Speech Scramblers
431-445
A Construction for One Way Hash Functions and Pseudorandom Bit Generators
446-457
ESIGN: An Efficient Digital Signature Implementation for Smard Cards
458-471
New Approaches to the Design of Self-Synchronizing Stream Ciphers
472-481
Randomized Authentication Systems
482-489
Ideals over a Non-Commutative Ring and thier Applications in Cryptology
490-497
Self-Certified Public Keys
498-507
Non-interactive Public-Key Cryptography
508-511
Hash Functions And Graphs With Large Girths
512-516
Dickson Pseudoprimes and Primality Testing
517-521
Equivalent Goppa Codes and Trapdoors to McEliece's Public Key Cryptosystem
522-526
A Threshold Cryptosystem without a Trusted Party (Extended Abstract)
527-531
A Comparison of Cryptoanalytic Principles Based on Iterative Error-Correction
532-534
Cryptanalysis of the Chaotic-Map Cryptosystem Suggested at EUROCRYPT'91
535-541
How To Broadcast A Secret
542-546
Probabilistic Analysis of Elementary Randimizers
547-551
Race Integrity Primitives Evaluation (RIPE): A Status Report
552-553
The Information Leakage through a Randomly Generated Function
554-556
Some Weaknesses of "Weaknesses of Undeniable Signatures"