# Category:Post-quantum cryptography

Here is a list of articles in the Post-quantum cryptography category of the Computing portal that unifies foundations of mathematics and computations using computers.

This is a category for asymmetric cryptosystems that are secure from quantum computers. More specifically, algorithms that cannot be solved by quantum computers in polynomial time.

## Subcategories

This category has the following 2 subcategories, out of 2 total.

## Pages in category "Post-quantum cryptography"

The following 28 pages are in this category, out of 28 total.

- Post-quantum cryptography
*(computing)*

### B

- BLISS signature scheme
*(computing)*

### G

- GGH signature scheme
*(computing)* - Grover's algorithm
*(computing)*

### H

- Hash-based cryptography
*(computing)*

### I

- Ideal lattice
*(computing)* - Ideal lattice cryptography
*(computing)* - IEEE P1363
*(computing)*

### L

- Lattice-based cryptography
*(computing)* - Lattice problem
*(computing)* - Lattice reduction
*(computing)* - Learning with errors
*(computing)*

### M

- McEliece cryptosystem
*(computing)* - Merkle signature scheme
*(computing)* - Multivariate cryptography
*(computing)*

### N

- NewHope
*(computing)* - Niederreiter cryptosystem
*(computing)* - NTRU
*(computing)* - NTRUEncrypt
*(computing)* - NTRUSign
*(computing)*

### P

- Post-Quantum Cryptography Standardization
*(computing)*

### R

- Ring learning with errors
*(computing)* - Ring learning with errors key exchange
*(computing)* - Ring learning with errors signature
*(computing)*

### S

- Shor's algorithm
*(computing)* - Short integer solution problem
*(computing)*

### U

- Unbalanced Oil and Vinegar
*(computing)* - Unbalanced oil and vinegar scheme
*(computing)*