Fr. 55.50

Contemporary Cryptology

English · Paperback / Softback

Shipping usually within 1 to 2 weeks (title will be printed to order)

Description

Read more

The aim of this text is to treat selected topics of the subject of contemporary cryptology, structured in five quite independent but related themes:
- efficient distributed computation modulo a shared secret
- multiparty computation
- foundations of modern cryptography
- provable security for public key schemes
- efficient and secure public-key cryptosystems.

List of contents

Efficient Distributed Computation Modulo a Shared Secret.- Multiparty Computation, an Introduction.- Foundations of Modern Cryptography.- Provable Security for Public Key Schemes.- Efficient and Secure Public-Key Cryptosystems.

Summary

The aim of this text is to treat selected topics of the subject of contemporary cryptology, structured in five quite independent but related themes:
- efficient distributed computation modulo a shared secret
- multiparty computation
- foundations of modern cryptography
- provable security for public key schemes
- efficient and secure public-key cryptosystems.

Product details

Authors Dari Catalano, Dario Catalano, Ronal Cramer, Ronald Cramer, Giovanni Di Crescenzo, Ivan Damgard, Ivan et al Damgard, Giovanni Di Crescenzo, David Pointcheval, Tsuyoshi Takagi
Publisher Springer, Basel
 
Languages English
Product format Paperback / Softback
Released 27.07.2005
 
EAN 9783764372941
ISBN 978-3-7643-7294-1
No. of pages 238
Dimensions 173 mm x 15 mm x 240 mm
Weight 435 g
Illustrations IX, 238 p.
Series Advanced Courses in Mathematics - CRM Barcelona
Advanced Courses in Mathematics CRM Barcelona
Advanced Courses in Mathematics - CRM Barcelona
Subject Natural sciences, medicine, IT, technology > IT, data processing > IT

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.

Write a review

Thumbs up or thumbs down? Write your own review.

For messages to CeDe.ch please use the contact form.

The input fields marked * are obligatory

By submitting this form you agree to our data privacy statement.