A Classical Introduction to Cryptography

Applications for Communications Security

  • Serge Vaudenay

Table of contents

About this book

Introduction

A Classical Introduction to Cryptography:  Applications for Communications Security introduces fundamentals of information and communication security by providing appropriate mathematical concepts to prove or break the security of cryptographic schemes.

This advanced-level textbook covers conventional cryptographic primitives and cryptanalysis of these primitives; basic algebra and number theory for cryptologists; public key cryptography and cryptanalysis of these schemes; and other cryptographic protocols, e.g. secret sharing, zero-knowledge proofs and undeniable signature schemes.

A Classical Introduction to Cryptography: Applications for Communications Security is rich with algorithms, including exhaustive search with time/memory tradeoffs; proofs, such as security proofs for DSA-like signature schemes; and classical attacks such as collision attacks on MD4. Hard-to-find standards, e.g. SSH2 and security in Bluetooth, are also included.

A Classical Introduction to Cryptography:  Applications for Communications Security  is designed for upper-level undergraduate and graduate-level students in computer science. This book is also suitable for researchers and practitioners in industry. A separate exercise/solution booklet is available as well, please go to www.springeronline.com under author: Vaudenay for additional details on how to purchase this booklet.

Keywords

AES Analysis DES Message Authentication Code Number theory RSA Secure Shell Shannon algorithms communication complexity cryptography finite field information privacy

Authors and affiliations

  • Serge Vaudenay
    • 1
  1. 1.Swiss Federal Institute of Technologies (EPFL)Switzerland

Bibliographic information

  • DOI https://doi.org/10.1007/b136373
  • Copyright Information Springer Science+Business Media, Inc. 2006
  • Publisher Name Springer, Boston, MA
  • eBook Packages Computer Science
  • Print ISBN 978-0-387-25464-7
  • Online ISBN 978-0-387-25880-5
  • About this book