REVIEW 2 cited by
The Mathematical Foundation of Post-Quantum Cryptography
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
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.
Forward citations
Cited by 2 Pith papers
-
The Tammes Problem in $\mathbb{R}^{n}$ and Linear Programming Method
A sufficient condition for optimality in the Tammes problem is formulated from the Delsarte bound and demonstrated on the icosahedron and the 600-cell.
-
Some Mathematical Problems Behind Lattice-Based Cryptography
A survey that frames the security of lattice-based post-quantum cryptography as classical geometry-of-numbers problems: SVP/CVP, ball packing and covering, and quadratic forms.
Discussion (0). Continue with ORCID to comment.