Pseudorandomness of ring-LWE for any ring and modulus

Chris Peikert, Oded Regev, Noah Stephens-Davidowitz

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We give a polynomial-time quantum reduction from worst-case (ideal) lattice problems directly to decision (Ring-)LWE. This extends to decision all the worst-case hardness results that were previously known for the search version, for the same or even better parameters and with no algebraic restrictions on the modulus or number field. Indeed, our reduction is the first that works for decision Ring-LWE with any number field and any modulus.

Original languageEnglish (US)
Title of host publicationSTOC 2017 - Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing
PublisherAssociation for Computing Machinery
Pages461-473
Number of pages13
VolumePart F128415
ISBN (Electronic)9781450345286
DOIs
StatePublished - Jun 19 2017
Event49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017 - Montreal, Canada
Duration: Jun 19 2017Jun 23 2017

Other

Other49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017
CountryCanada
CityMontreal
Period6/19/176/23/17

Fingerprint

Hardness
Polynomials

Keywords

  • Lattices
  • Learning with errors

ASJC Scopus subject areas

  • Software

Cite this

Peikert, C., Regev, O., & Stephens-Davidowitz, N. (2017). Pseudorandomness of ring-LWE for any ring and modulus. In STOC 2017 - Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (Vol. Part F128415, pp. 461-473). Association for Computing Machinery. https://doi.org/10.1145/3055399.3055489

Pseudorandomness of ring-LWE for any ring and modulus. / Peikert, Chris; Regev, Oded; Stephens-Davidowitz, Noah.

STOC 2017 - Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing. Vol. Part F128415 Association for Computing Machinery, 2017. p. 461-473.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Peikert, C, Regev, O & Stephens-Davidowitz, N 2017, Pseudorandomness of ring-LWE for any ring and modulus. in STOC 2017 - Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing. vol. Part F128415, Association for Computing Machinery, pp. 461-473, 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, Canada, 6/19/17. https://doi.org/10.1145/3055399.3055489
Peikert C, Regev O, Stephens-Davidowitz N. Pseudorandomness of ring-LWE for any ring and modulus. In STOC 2017 - Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing. Vol. Part F128415. Association for Computing Machinery. 2017. p. 461-473 https://doi.org/10.1145/3055399.3055489
Peikert, Chris ; Regev, Oded ; Stephens-Davidowitz, Noah. / Pseudorandomness of ring-LWE for any ring and modulus. STOC 2017 - Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing. Vol. Part F128415 Association for Computing Machinery, 2017. pp. 461-473
@inproceedings{e0a0decf975144f6b14be91250c636fb,
title = "Pseudorandomness of ring-LWE for any ring and modulus",
abstract = "We give a polynomial-time quantum reduction from worst-case (ideal) lattice problems directly to decision (Ring-)LWE. This extends to decision all the worst-case hardness results that were previously known for the search version, for the same or even better parameters and with no algebraic restrictions on the modulus or number field. Indeed, our reduction is the first that works for decision Ring-LWE with any number field and any modulus.",
keywords = "Lattices, Learning with errors",
author = "Chris Peikert and Oded Regev and Noah Stephens-Davidowitz",
year = "2017",
month = "6",
day = "19",
doi = "10.1145/3055399.3055489",
language = "English (US)",
volume = "Part F128415",
pages = "461--473",
booktitle = "STOC 2017 - Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing",
publisher = "Association for Computing Machinery",

}

TY - GEN

T1 - Pseudorandomness of ring-LWE for any ring and modulus

AU - Peikert, Chris

AU - Regev, Oded

AU - Stephens-Davidowitz, Noah

PY - 2017/6/19

Y1 - 2017/6/19

N2 - We give a polynomial-time quantum reduction from worst-case (ideal) lattice problems directly to decision (Ring-)LWE. This extends to decision all the worst-case hardness results that were previously known for the search version, for the same or even better parameters and with no algebraic restrictions on the modulus or number field. Indeed, our reduction is the first that works for decision Ring-LWE with any number field and any modulus.

AB - We give a polynomial-time quantum reduction from worst-case (ideal) lattice problems directly to decision (Ring-)LWE. This extends to decision all the worst-case hardness results that were previously known for the search version, for the same or even better parameters and with no algebraic restrictions on the modulus or number field. Indeed, our reduction is the first that works for decision Ring-LWE with any number field and any modulus.

KW - Lattices

KW - Learning with errors

UR - http://www.scopus.com/inward/record.url?scp=85024384539&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85024384539&partnerID=8YFLogxK

U2 - 10.1145/3055399.3055489

DO - 10.1145/3055399.3055489

M3 - Conference contribution

VL - Part F128415

SP - 461

EP - 473

BT - STOC 2017 - Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing

PB - Association for Computing Machinery

ER -