Handbook of Applied Cryptography - chap3

Chia sẻ: Van Kent Kent | Ngày: | Loại File: PDF | Số trang:47

0
39
lượt xem
7
download

Handbook of Applied Cryptography - chap3

Mô tả tài liệu
  Download Vui lòng tải xuống để xem tài liệu đầy đủ

The security of many public-key cryptosystems relies on the apparent intractability of the computational problems studied in this chapter. In a cryptographic setting, it is prudent to make the assumption that the adversary is very powerful. Thus, informally speaking, a computational problem is said to be easy or tractable if it can be solved in (expected)1 polynomial time, at least for a non-negligible fraction of all possible inputs. In otherwords, if there is an algorithm which can solve a non-negligible fraction of all instances of a problem in polynomial time, then any cryptosystem whose security is based on that problem must be considered insecure....

Chủ đề:
Lưu

Nội dung Text: Handbook of Applied Cryptography - chap3

Đồng bộ tài khoản