## Advances in Cryptology--CRYPTO '90: ProceedingsThis volume gives the proceedings of Crypto '90, held at the University of California at Santa Barbara, August 11-15, 1990. The conference attracted 227 participants from twenty countries, with attendees from academia, industry, and government. The program provided a balance between the theoretical and the practical aspects of cryptography to meet the needs and diversified interests of the various groups. The selected papers are organized into sections on cryptanalysis, protocols, algebra and number theory, signatures and authentication, secret sharing, key distribution,hash functions, zero-knowledge, randomness, applications, design and analysis, and impromptu talks. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Differential Cryptanalysis of DESlike Cryptosystems invited talk | 2 |

A Statistical Attack of the Feal8 Cryptosystem | 22 |

Quantum Bit Commitment and Coin Tossing Protocols | 49 |

Copyright | |

35 other sections not shown

### Other editions - View all

Advances in Cryptology - CRYPTO '90: Proceedings Alfred J. Menezes,Scott A. Vanstone Limited preview - 2003 |

Advances in Cryptology - CRYPTO '90: Proceedings Alfred J. Menezes,Scott A. Vanstone No preview available - 1991 |

### Common terms and phrases

accepts addition algorithm allows applications assume assumption attack bit commitment block bytes called chooses chosen ciphertext circuit communication complexity compute consider constant construct correct corresponding cryptographic cryptosystem defined Definition denote depends described distribution encryption entries equations example exists factor final function give given hash functions implementation independent input integer interactive known least Lemma length logarithm matrix method Micali Note obtain operations original output pairs participants performed permutation plaintext players polynomial possible practical present prime probabilistic probability problem Proc Proceedings proof system protocol prove random receiver requires respectively result round S-box satisfies scheme secret secure sends sequence shared signature simulator stage statistical Step string Table Theorem University verifier zero-knowledge