# Algorithmic Number Theory

@inproceedings{Leeuwen2000AlgorithmicNT, title={Algorithmic Number Theory}, author={Jan van Leeuwen and Wieb Bosma}, booktitle={Lecture Notes in Computer Science}, year={2000} }

- Published in Lecture Notes in Computer Science 2000
DOI:10.1007/10722028

We survey some recent developments in the study of the complexity of certain lattice problems. We focus on the recent progress on complexity results of intractability. We will discuss Ajtai’s worstcase/average-case connections for the shortest vector problem, similar results for the closest vector problem and short basis problem, NP-hardness and non-NP-hardness, transference theorems between primal and dual lattices, and application to secure cryptography.

#### Topics from this paper.

#### Citations

##### Publications citing this paper.

SHOWING 1-4 OF 4 CITATIONS

1 Excerpt

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 18 REFERENCES

Highly Influential

19 Excerpts

Highly Influential

16 Excerpts

Highly Influential

35 Excerpts

Highly Influential

11 Excerpts

Highly Influential

13 Excerpts

Highly Influential

9 Excerpts

Highly Influential

11 Excerpts

Highly Influential

10 Excerpts

Highly Influential

13 Excerpts

Highly Influential

26 Excerpts

#### Similar Papers

Loading similar papers…