{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,20]],"date-time":"2026-10-20T02:11:28Z","timestamp":1792462288727,"version":"4.5.0"},"publisher-location":"New York, NY, USA","reference-count":51,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T00:00:00Z","timestamp":1497830400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1054495, CNS-1606362, CCF-1320188"],"award-info":[{"award-number":["CCF-1054495, CNS-1606362, CCF-1320188"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["W911NF-15-C-0236"],"award-info":[{"award-number":["W911NF-15-C-0236"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,6,19]]},"DOI":"10.1145\/3055399.3055489","type":"proceedings-article","created":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T20:27:45Z","timestamp":1497558465000},"page":"461-473","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":137,"title":["Pseudorandomness of ring-LWE for any ring and modulus"],"prefix":"10.1145","author":[{"given":"Chris","family":"Peikert","sequence":"first","affiliation":[{"name":"University of Michigan, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Oded","family":"Regev","sequence":"additional","affiliation":[{"name":"New York University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Noah","family":"Stephens-Davidowitz","sequence":"additional","affiliation":[{"name":"New York University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,6,19]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Postquantum Key Exchange - A New Hope. In USENIX Security Symposium. 327\u2013343","author":"Alkim Erdem","year":"2016","unstructured":"Erdem Alkim , L\u00e9o Ducas , Thomas P\u00f6ppelmann , and Peter Schwabe . 2016 . Postquantum Key Exchange - A New Hope. In USENIX Security Symposium. 327\u2013343 . Erdem Alkim, L\u00e9o Ducas, Thomas P\u00f6ppelmann, and Peter Schwabe. 2016. Postquantum Key Exchange - A New Hope. In USENIX Security Symposium. 327\u2013343."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03356-8_35"},{"key":"e_1_3_2_2_3_1","unstructured":"L\u00e1szl\u00f3 Babai. 1986.  L\u00e1szl\u00f3 Babai. 1986."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579403"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01445125"},{"key":"e_1_3_2_2_6_1","unstructured":"Jean-Fran\u00e7ois Biasse and Fang Song. 2016.  Jean-Fran\u00e7ois Biasse and Fang Song. 2016."},{"key":"e_1_3_2_2_7_1","unstructured":"Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields. In SODA. 893\u2013902.  Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields. In SODA. 893\u2013902."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00532234"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978425"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2633600"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488680"},{"key":"e_1_3_2_2_12_1","unstructured":"Zvika Brakerski and Vinod Vaikuntanathan. 2014.  Zvika Brakerski and Vinod Vaikuntanathan. 2014."},{"key":"e_1_3_2_2_13_1","volume-title":"831\u2013871. Preliminary version in FOCS","author":"Homomorphic Efficient Fully","year":"2014","unstructured":"Efficient Fully Homomorphic Encryption from (Standard) LWE. SIAM J. Comput . 43, 2 ( 2014 ), 831\u2013871. Preliminary version in FOCS 2011. Efficient Fully Homomorphic Encryption from (Standard) LWE. SIAM J. Comput. 43, 2 (2014), 831\u2013871. Preliminary version in FOCS 2011."},{"key":"e_1_3_2_2_14_1","unstructured":"Peter Campbell Michael Groves and Dan Shepherd. 2014.  Peter Campbell Michael Groves and Dan Shepherd. 2014."},{"key":"e_1_3_2_2_15_1","volume-title":"ETSI 2nd Quantum-Safe Crypto Workshop. (2014","author":"Soliloquy","year":"2014","unstructured":"Soliloquy : a Cautionary Tale . ETSI 2nd Quantum-Safe Crypto Workshop. (2014 ). Available at http:\/\/docbox.etsi.org\/Workshop\/ 2014 \/201410_CRYPTO\/S07_Systems_and_ Attacks\/S07_Groves_Annex.pdf. Soliloquy: a Cautionary Tale. ETSI 2nd Quantum-Safe Crypto Workshop. (2014). Available at http:\/\/docbox.etsi.org\/Workshop\/2014\/201410_CRYPTO\/S07_Systems_and_ Attacks\/S07_Groves_Annex.pdf."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"crossref","unstructured":"Ronald Cramer L\u00e9o Ducas Chris Peikert and Oded Regev. 2016. Recovering Short Generators of Principal Ideals in Cyclotomic Rings. In EUROCRYPT. 559\u2013 585.  Ronald Cramer L\u00e9o Ducas Chris Peikert and Oded Regev. 2016. Recovering Short Generators of Principal Ideals in Cyclotomic Rings. In EUROCRYPT. 559\u2013 585.","DOI":"10.1007\/978-3-662-49896-5_20"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"crossref","unstructured":"Ronald Cramer L\u00e9o Ducas and Benjamin Wesolowski. 2017. Short Stickelberger Class Relations and application to Ideal-SVP. In EUROCRYPT. To appear.  Ronald Cramer L\u00e9o Ducas and Benjamin Wesolowski. 2017. Short Stickelberger Class Relations and application to Ideal-SVP. In EUROCRYPT. To appear.","DOI":"10.1007\/978-3-319-56620-7_12"},{"key":"e_1_3_2_2_18_1","volume-title":"Lauter","author":"Eisentr\u00e4ger Kirsten","year":"2014","unstructured":"Kirsten Eisentr\u00e4ger , Sean Hallgren , and Kristin E . Lauter . 2014 . Weak Instances of PLWE. In SAC. 183\u2013194. Kirsten Eisentr\u00e4ger, Sean Hallgren, and Kristin E. Lauter. 2014. Weak Instances of PLWE. In SAC. 183\u2013194."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"e_1_3_2_2_20_1","unstructured":"Craig Gentry Chris Peikert and Vinod Vaikuntanathan. 2008.  Craig Gentry Chris Peikert and Vinod Vaikuntanathan. 2008."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374407"},{"key":"e_1_3_2_2_22_1","unstructured":"Craig Gentry Amit Sahai and Brent Waters. 2013.  Craig Gentry Amit Sahai and Brent Waters. 2013."},{"key":"e_1_3_2_2_23_1","unstructured":"Homomorphic Encryption from Learning with Errors: Conceptually-Simpler Asymptotically-Faster Attribute-Based. In CRYPTO. 75\u201392.  Homomorphic Encryption from Learning with Errors: Conceptually-Simpler Asymptotically-Faster Attribute-Based. In CRYPTO. 75\u201392."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488677"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1963.10500830"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-014-9938-4"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01457454"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/11830924_41"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/11787006_13"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535925"},{"key":"e_1_3_2_2_31_1","unstructured":"Daniele Micciancio and Petros Mol. 2011.  Daniele Micciancio and Petros Mol. 2011."},{"key":"e_1_3_2_2_32_1","unstructured":"Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions. In CRYPTO. 465\u2013484.  Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions. In CRYPTO. 465\u2013484."},{"key":"e_1_3_2_2_33_1","unstructured":"Daniele Micciancio and Chris Peikert. 2012.  Daniele Micciancio and Chris Peikert. 2012."},{"key":"e_1_3_2_2_34_1","unstructured":"Trapdoors for Lattices: Simpler Tighter Faster Smaller. In EUROCRYPT. 700\u2013718.  Trapdoors for Lattices: Simpler Tighter Faster Smaller. In EUROCRYPT. 700\u2013718."},{"key":"e_1_3_2_2_35_1","unstructured":"Daniele Micciancio and Oded Regev. 2007.  Daniele Micciancio and Oded Regev. 2007."},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447360"},{"key":"e_1_3_2_2_37_1","unstructured":"Ryan O\u2019Donnell. 2014.  Ryan O\u2019Donnell. 2014."},{"key":"e_1_3_2_2_38_1","volume-title":"Cambridge University Press","author":"Analysis","unstructured":"Analysis of Boolean functions. Cambridge University Press , New York . DOI:https:\/\/ Analysis of Boolean functions. Cambridge University Press, New York. DOI:https:\/\/"},{"key":"e_1_3_2_2_39_1","unstructured":"Ryan O\u2019Donnell. 2014.  Ryan O\u2019Donnell. 2014."},{"key":"e_1_3_2_2_40_1","unstructured":"Analysis of Boolean Functions. Cambridge University Press.   Analysis of Boolean Functions. Cambridge University Press."},{"key":"e_1_3_2_2_41_1","unstructured":"Chris Peikert. 2009.  Chris Peikert. 2009."},{"key":"e_1_3_2_2_42_1","unstructured":"Public-key cryptosystems from the worst-case shortest vector problem. In STOC. 333\u2013342.  Public-key cryptosystems from the worst-case shortest vector problem. In STOC. 333\u2013342."},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"crossref","unstructured":"Chris Peikert. 2010. An Efficient and Parallel Gaussian Sampler for Lattices. In CRYPTO. 80\u201397.   Chris Peikert. 2010. An Efficient and Parallel Gaussian Sampler for Lattices. In CRYPTO. 80\u201397.","DOI":"10.1007\/978-3-642-14623-7_5"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"crossref","unstructured":"Chris Peikert. 2014. Lattice Cryptography for the Internet. In PQCrypto. 197\u2013219.  Chris Peikert. 2014. Lattice Cryptography for the Internet. In PQCrypto. 197\u2013219.","DOI":"10.1007\/978-3-319-11659-4_12"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250860"},{"key":"e_1_3_2_2_46_1","unstructured":"Chris Peikert and Brent Waters. 2011.  Chris Peikert and Brent Waters. 2011."},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1137\/080733954"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/1568318.1568324"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2010.26"},{"key":"e_1_3_2_2_50_1","volume-title":"On class field towers","author":"Roquette Peter","unstructured":"Peter Roquette . 1967. On class field towers . In Algebraic Number Theory, John William Scott Cassels and Albrecht Fr\u00f6hlich (Eds.). Academic Press , 231\u2013249. Peter Roquette. 1967. On class field towers. In Algebraic Number Theory, John William Scott Cassels and Albrecht Fr\u00f6hlich (Eds.). Academic Press, 231\u2013249."},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"crossref","unstructured":"Damien Stehl\u00e9 and Ron Steinfeld. 2011. Making NTRU as Secure as Worst-Case Problems over Ideal Lattices. In EUROCRYPT. 27\u201347.   Damien Stehl\u00e9 and Ron Steinfeld. 2011. Making NTRU as Secure as Worst-Case Problems over Ideal Lattices. In EUROCRYPT. 27\u201347.","DOI":"10.1007\/978-3-642-20465-4_4"}],"event":{"name":"STOC '17: Symposium on Theory of Computing","location":"Montreal Canada","acronym":"STOC '17","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3055399.3055489","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3055399.3055489","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3055399.3055489","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:36:19Z","timestamp":1750217779000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3055399.3055489"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,19]]},"references-count":51,"alternative-id":["10.1145\/3055399.3055489","10.1145\/3055399"],"URL":"https:\/\/doi.org\/10.1145\/3055399.3055489","relation":{},"subject":[],"published":{"date-parts":[[2017,6,19]]},"assertion":[{"value":"2017-06-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}