Algorithmic Number Theory

@inproceedings{Leeuwen2000AlgorithmicNT,
  title={Algorithmic Number Theory},
  author={Jan van Leeuwen and Wieb Bosma},
  booktitle={Lecture Notes in Computer Science},
  year={2000}
}
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. 
BETA

Topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 18 REFERENCES

A generalization of Fermat’s last theorem: the Beal conjecture and prize problem

  • R. Daniel Mauldin
  • Notices Amer. Math. Soc., 44(11):1436–1437,
  • 1997
Highly Influential
10 Excerpts

Similar Papers

Loading similar papers…