Construct · 1 fields · 1 citations

short integer solution problem: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Cryptography

the problem of finding a short nonzero integer vector in the kernel of a random modular matrix, hard on average if worst-case lattice problems are hard.

In cryptography, short integer solution problem refers to the problem of finding a short nonzero integer vector in the kernel of a random modular matrix, hard on average if worst-case lattice problems are hard. This meaning comes from Ajtai (1996) in Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how short integer solution problem sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

worst-case to average-case reduction1 fields · 1 citationsanchor · a standalone construct kernel4 fields · 5 citationsjingle · one word, four constructs lattice4 fields · 4 citationsjingle · one word, four constructs

References

Ajtai, M. (1996). Generating hard instances of lattice problems (extended abstract). Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96. https://doi.org/10.1145/237814.237838

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct