Foundations Of Cryptography,Vol- 2 Basic Applications

by Goldreich (Author)

In stock

Delivered in 6-8 working days

Free shipping

Online price: Rs495 Rs480

You save Rs15

Login/Register to add this product to a wishlist.

You will be asked to pay the full amount when your item is delivered. Only cash is accepted for this type of order. Pay Cash on Delivery

Format: Paperback

Synopsis of Foundations Of Cryptography,Vol- 2 Basic Applications

Cryptography Is Concerned With The Conceptualization, Definition And Construction Of Computing Systems That Address Security Concerns. The Design Of Cryptographic Systems Must Be Based On Firm Foundations. Foundations Of Cryptography Presents A Rigorous And Systematic Treatment Of Foundational Issues, Defining Cryptographic Tasks And Solving New Cryptographic Problems Using Existing Tools. The Emphasis Is On The Clarification Of Fundamental Concepts And On Demonstrating The Feasibility Of Solving Several Central Cryptographic Problems, As Opposed To Describing Ad-Hoc Approaches. This Second Volume Contains A Rigorous Treatment Of Three Basic Applications: Encryption, Signatures, And General Cryptographic Protocols. It Builds On The Previous Volume Which Provided A Treatment Of One-Way Functions, Pseudorandomness And Zero-Knowledge Proofs. It Is Suitable For Use In A Graduate Course On Cryptography And As A Reference Book For Experts. The Author Assumes Basic Familiarity With The Design And Analysis Of Algorithms; Some Knowledge Of Complexity Theory And Probability Is Also Useful.

Product details

  • Pages: 448
  • Publisher: Cambridge University Press
  • Published: 29/06/1905
  • Language: English
  • ISBN: 9780521670418

Reviews of Foundations Of Cryptography,Vol- 2 Basic Applications

Read customer reviews on this product. If you have read this book, why not post your own review?

Be the first to review this product

Recently viewed by you

Wishlist (x items)
  • hello
Compare (0 items, 0 selected)
Compare selected Deselect all Remove all

Only items of the same type can be compared.