<--- Back to Details
First PageDocument Content
Cryptography / Computational complexity theory / Knapsack problem / Cipher / Public-key cryptography / Encryption / Symmetric-key algorithm / Key / P versus NP problem / MerkleHellman knapsack cryptosystem / RSA
Date: 2014-11-28 11:05:21
Cryptography
Computational complexity theory
Knapsack problem
Cipher
Public-key cryptography
Encryption
Symmetric-key algorithm
Key
P versus NP problem
MerkleHellman knapsack cryptosystem
RSA

Public Key Cryptography Public Key Cryptography • Symmetric Key: – Same key used for encryption and decrypiton – Same key used for message integrity and validation

Add to Reading List

Source URL: bioinfo.ict.ac.cn

Download Document from Source Website

File Size: 324,05 KB

Share Document on Facebook

Similar Documents

Lecture 19, Thurs March 30: RSA and Shor’s Algorithm Today we’ll see Shor’s algorithm. Given a positive integer ​N​, which we’ll assume for simplicity is a product of two primes |​and , this algorithm lets

Lecture 19, Thurs March 30: RSA and Shor’s Algorithm Today we’ll see Shor’s algorithm. Given a positive integer ​N​, which we’ll assume for simplicity is a product of two primes |​and , this algorithm lets

DocID: 1xVSj - View Document

PDF Document

DocID: 1xRwQ - View Document

PDF Document

DocID: 1xu6k - View Document

PDF Document

DocID: 1x9q3 - View Document

PDF Document

DocID: 1x1dn - View Document