The Mathematical Foundation of Post-Quantum Cryptography
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913335920820224 |
|---|---|
| author | Zong, Chuanming |
| author_facet | Zong, Chuanming |
| contents | On July 5, 2022, the National Institute of Standards and Technology announced four possible post-quantum cryptography standards, three of them are based on lattice theory and the other one is based on Hash function. It is well-known that the security of the lattice cryptography relies on the hardness of the shortest vector problem (SVP) and the closest vector problem (CVP). In fact, the SVP is a sphere packing problem and the CVP is a sphere covering problem. Furthermore, both SVP and CVP are equivalent to arithmetic problems of positive definite quadratic forms. This paper will briefly introduce the post-quantum cryptography and show its connections with sphere packing, sphere covering, and positive definite quadratic forms. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_19186 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | The Mathematical Foundation of Post-Quantum Cryptography Zong, Chuanming Information Theory Cryptography and Security Metric Geometry Number Theory 94A60, 52C17, 11H31 On July 5, 2022, the National Institute of Standards and Technology announced four possible post-quantum cryptography standards, three of them are based on lattice theory and the other one is based on Hash function. It is well-known that the security of the lattice cryptography relies on the hardness of the shortest vector problem (SVP) and the closest vector problem (CVP). In fact, the SVP is a sphere packing problem and the CVP is a sphere covering problem. Furthermore, both SVP and CVP are equivalent to arithmetic problems of positive definite quadratic forms. This paper will briefly introduce the post-quantum cryptography and show its connections with sphere packing, sphere covering, and positive definite quadratic forms. |
| title | The Mathematical Foundation of Post-Quantum Cryptography |
| topic | Information Theory Cryptography and Security Metric Geometry Number Theory 94A60, 52C17, 11H31 |
| url | https://arxiv.org/abs/2404.19186 |