International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Polynomial time reduction from approximate shortest vector problem to the principle ideal porblem for lattices in cyclotomic rings

Authors:
Hao Chen
Download:
URL: https://eprint.iacr.org/2015/639
Search ePrint
Search Google
BibTeX
@article{eprint-2015-26896,
  title={Polynomial time reduction from approximate shortest vector problem to the principle ideal porblem for lattices in cyclotomic rings},
  journal={IACR Cryptology ePrint Archive},
  volume={2015},
  pages={639},
  url={https://eprint.iacr.org/2015/639},
  author={Hao Chen},
  year=2015
}