Advances in Cryptology — EUROCRYPT ’89: Workshop on the Theory and Application of Cryptographic Techniques Houthalen, Belgium, April 10–13, 1989 Proceedings

The Adolescence of Public-Key Cryptography....Pages 2-2
A Secure Public-Key Authentication Scheme....Pages 3-15
How to improve signature schemes....Pages 16-22
A Generalization of El Gamal’s Public Key Cryptosystem....Pages 23-28
An Identity-Based Key-Exchange Protocol....Pages 29-37
How to Keep Authenticity Alive in a Computer Network....Pages 38-46
The Use of Fractions in Public-Key Cryptosystems....Pages 47-55
A Practical Protocol for Large Group Oriented Networks....Pages 56-61
Counting Functions Satisfying a Higher Order Strict Avalanche Criterion....Pages 63-74
A Key Distribution System Based On Any One-Way Function....Pages 75-79
Non-linearity of Exponent Permutations....Pages 80-92
Informational Divergence Bounds for Authentication Codes....Pages 93-101
2n-Bit Hash-Functions Using n-Bit Symmetric Block Cipher Algorithms....Pages 102-109
A Simple Technique for Diffusing Cryptoperiods....Pages 110-120
A General Zero-Knowledge Scheme....Pages 122-133
Divertible Zero Knowledge Interactive Proofs and Commutative Random Self-Reducibility....Pages 134-149
Verifiable Disclosure of Secrets and Applications (Abstract)....Pages 150-154
Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies....Pages 155-172
An alternative to the Fiat-Shamir protocol....Pages 173-180
Sorting out zero-knowledge....Pages 181-191
Everything in NP can be argued in perfect zero-knowledge in a bounded number of rounds....Pages 192-195
Zero-Knowledge Proofs of Computational Power....Pages 196-207
More Efficient Match-Making and Satisfiability The Five Card Trick ....Pages 208-217
A Single Chip 1024 Bits RSA Processor....Pages 219-236
Cryptel - The Practical Protection of an Existing Electronic Mail System....Pages 237-242
Technical Security: The Starting Point....Pages 243-248
Security in Open Distributed Processing....Pages 249-266
A European Call for Cryptographic Algorithms: Ripe; Race Integrity Primitives Evaluation....Pages 267-271
Legal Requirements Facing New Signature Technology....Pages 273-287
Online Cash Checks....Pages 288-293
Efficient Offline Electronic Checks....Pages 294-301
Unconditional Sender and Recipient Untraceability in Spite of Active Attacks....Pages 302-319
Detection of Disrupters in the DC Protocol....Pages 320-327
Random Mapping Statistics....Pages 329-354
Factoring by electronic mail....Pages 355-371
Cryptanalysis of Short RSA Secret Exponents....Pages 372-372
How to Break the Direct RSA-Implementation of Mixes....Pages 373-381
An Information-Theoretic Treatment of Homophonic Substitution....Pages 382-394
Cryptanalysis of a Modified Rotor Machine....Pages 395-402
Cryptanalysis of Video Encryption Based on Space-Filling Curves....Pages 403-411
Impossibility and Optimality Results on Constructing Pseudorandom Permutations....Pages 412-422
On the Security of Schnorr’s Pseudo Random Generator....Pages 423-428
How easy is collision search? Application to DES....Pages 429-434
Prepositioned Shared Secret and/or Shared Control Schemes....Pages 436-467
Some Ideal Secret Sharing Schemes....Pages 468-475
Cartesian Authentication Schemes....Pages 476-490
How to Say “No”....Pages 491-496
Key Minimal Authentication Systems for Unconditional Secrecy....Pages 497-501
Parallel Generation of Recurring Sequences....Pages 503-522
Keystream Sequences with a Good Linear Complexity Profile for Every Starting Point....Pages 523-532
On the Complexity of Pseudo-Random Sequences - or: If You Can Describe a Sequence It Can’t be Random....Pages 533-543
Feedforward Functions Defined by de Bruijn Sequences....Pages 544-548
Nonlinearity Criteria for Cryptographic Functions....Pages 549-562
On the Linear Complexity of Feedback Registers....Pages 563-570
Linear Complexity Profiles and Continued Fractions....Pages 571-585
A Fast Correlation Attack on Nonlinearly Feedforward Filtered Shift-Register Sequences....Pages 586-595
On the Complexity and Efficiency of a New Key Exchange System....Pages 597-616
A New Multiple Key Cipher and an Improved Voting Scheme....Pages 617-625
Atkin’s Test: News from the Front....Pages 626-635
Fast Generation of Secure RSA-Moduli with Almost Maximal Diversity....Pages 636-647
Deciphering Bronze Age Scripts of Crete The Case of Linear A....Pages 649-650
Faster Primality Testing....Pages 652-656
Private-Key Algebraic-Code Cryptosystems with High Information Rates....Pages 657-661
Zero-knowledge procedures for confidential access to medical records....Pages 662-664
Full Secure Key Exchange and Authentication with no Previously Shared Secrets....Pages 665-669
Varying Feedback Shift Registers....Pages 670-679
A Cryptanalysis of Step k,m -Cascades....Pages 680-687
Efficient Identification and Signatures for Smart Cards....Pages 688-689
The Dining Cryptographers in the Disco: Unconditional Sender and Recipient Untraceability with Computationally Secure Serviceability....Pages 690-690
Some Conditions on the Linear Complexity Profiles of Certain Binary Sequences....Pages 691-695
On the Design of Permutation P in des Type Cryptosystems....Pages 696-705
A Fast Elliptic Curve Cryptosystem....Pages 706-708