{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:36:54Z","timestamp":1766281014436},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030442224"},{"type":"electronic","value":"9783030442231"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-44223-1_16","type":"book-chapter","created":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T19:04:06Z","timestamp":1586459046000},"page":"284-303","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["COSAC: COmpact and Scalable Arbitrary-Centered Discrete Gaussian Sampling over Integers"],"prefix":"10.1007","author":[{"given":"Raymond K.","family":"Zhao","sequence":"first","affiliation":[]},{"given":"Ron","family":"Steinfeld","sequence":"additional","affiliation":[]},{"given":"Amin","family":"Sakzad","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,10]]},"reference":[{"key":"16_CR1","unstructured":"Aumasson, J.P.: Guidelines for low-level cryptography software (2019). \nhttps:\/\/github.com\/veorq\/cryptocoding\n\n. Accessed 28 Jan 2020"},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-662-48797-6_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"S Bai","year":"2015","unstructured":"Bai, S., Langlois, A., Lepoint, T., Stehl\u00e9, D., Steinfeld, R.: Improved security proofs in lattice-based cryptography: using the R\u00e9nyi divergence rather than the statistical distance. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9452, pp. 3\u201324. Springer, Heidelberg (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-662-48797-6_1"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-319-79063-3_13","volume-title":"Post-Quantum Cryptography","author":"P Bert","year":"2018","unstructured":"Bert, P., Fouque, P.-A., Roux-Langlois, A., Sabt, M.: Practical implementation of ring-SIS\/LWE based signature and IBE. In: Lange, T., Steinwandt, R. (eds.) PQCrypto 2018. LNCS, vol. 10786, pp. 271\u2013291. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-79063-3_13"},{"key":"16_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-8643-8","volume-title":"Non-Uniform Random Variate Generation","author":"L Devroye","year":"1986","unstructured":"Devroye, L.: Non-Uniform Random Variate Generation. Springer, New York (1986). \nhttps:\/\/doi.org\/10.1007\/978-1-4613-8643-8"},{"issue":"3","key":"16_CR5","doi-asserted-by":"publisher","first-page":"39103:1","DOI":"10.1007\/s11432-017-9409-7","volume":"62","author":"Y Du","year":"2019","unstructured":"Du, Y., Wei, B., Zhang, H.: A rejection sampling algorithm for off-centered discrete Gaussian distributions over the integers. Sci. China Inf. Sci. 62(3), 39103:1\u201339103:3 (2019)","journal-title":"Sci. China Inf. Sci."},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-642-40041-4_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"L Ducas","year":"2013","unstructured":"Ducas, L., Durmus, A., Lepoint, T., Lyubashevsky, V.: Lattice signatures and bimodal Gaussians. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 40\u201356. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-40041-4_3"},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/978-3-662-45608-8_2","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"L Ducas","year":"2014","unstructured":"Ducas, L., Lyubashevsky, V., Prest, T.: Efficient identity-based encryption over NTRU lattices. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8874, pp. 22\u201341. Springer, Heidelberg (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-662-45608-8_2"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-642-34961-4_26","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"L Ducas","year":"2012","unstructured":"Ducas, L., Nguyen, P.Q.: Faster gaussian lattice sampling using lazy floating-point arithmetic. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 415\u2013432. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-34961-4_26"},{"key":"16_CR9","unstructured":"Fog, A.: VCL C++ vector class library. \nwww.agner.org\/optimize\/vectorclass.pdf\n\n. Accessed 01 Aug 2019"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: STOC, pp. 197\u2013206. ACM (2008)","DOI":"10.1145\/1374376.1374407"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1007\/978-3-319-76581-5_25","volume-title":"Public-Key Cryptography \u2013 PKC 2018","author":"A H\u00fclsing","year":"2018","unstructured":"H\u00fclsing, A., Lange, T., Smeets, K.: Rounded Gaussians. In: Abdalla, M., Dahab, R. (eds.) PKC 2018. LNCS, vol. 10770, pp. 728\u2013757. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-76581-5_25"},{"issue":"1","key":"16_CR12","doi-asserted-by":"publisher","first-page":"3:1","DOI":"10.1145\/2710016","volume":"42","author":"CFF Karney","year":"2016","unstructured":"Karney, C.F.F.: Sampling exactly from the normal distribution. ACM Trans. Math. Softw. 42(1), 3:1\u20133:14 (2016)","journal-title":"ACM Trans. Math. Softw."},{"key":"16_CR13","unstructured":"Knuth, D., Yao, A.: Algorithms and Complexity: New Directions and Recent Results, chap. The complexity of nonuniform random number generation. Academic Press, Cambridge (1976)"},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-61204-1_1","volume-title":"Applied Cryptography and Network Security","author":"C Aguilar-Melchor","year":"2017","unstructured":"Aguilar-Melchor, C., Albrecht, M.R., Ricosset, T.: Sampling from arbitrary centered discrete gaussians for lattice-based cryptography. In: Gollmann, D., Miyaji, A., Kikuchi, H. (eds.) ACNS 2017. LNCS, vol. 10355, pp. 3\u201319. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-61204-1_1"},{"issue":"11","key":"16_CR15","first-page":"1610","volume":"67","author":"CA Melchor","year":"2018","unstructured":"Melchor, C.A., Ricosset, T.: CDT-based Gaussian sampling: From multi to double precision. IEEE Trans. Comput. 67(11), 1610\u20131621 (2018)","journal-title":"IEEE Trans. Comput."},{"key":"16_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1007\/978-3-642-29011-4_41","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"D Micciancio","year":"2012","unstructured":"Micciancio, D., Peikert, C.: Trapdoors for lattices: simpler, tighter, faster, smaller. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 700\u2013718. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-29011-4_41"},{"key":"16_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/978-3-319-63715-0_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"D Micciancio","year":"2017","unstructured":"Micciancio, D., Walter, M.: Gaussian sampling over the integers: efficient, generic, constant-time. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10402, pp. 455\u2013485. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-63715-0_16"},{"key":"16_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-642-14623-7_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"C Peikert","year":"2010","unstructured":"Peikert, C.: An efficient and parallel Gaussian sampler for lattices. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 80\u201397. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-14623-7_5"},{"key":"16_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-319-70694-8_13","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"T Prest","year":"2017","unstructured":"Prest, T.: Sharper bounds in lattice-based cryptography using the R\u00e9nyi divergence. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10624, pp. 347\u2013374. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-70694-8_13"},{"key":"16_CR20","unstructured":"Prest, T., et al.: Falcon: fast-fourier lattice-based compact signatures over NTRU. \nhttps:\/\/falcon-sign.info\/\n\n (2017). Accessed 31 Oct 2018"},{"key":"16_CR21","unstructured":"Prest, T., Ricosset, T., Rossi, M.: Simple, fast and constant-time Gaussian sampling over the integers for Falcon. In: Second PQC Standardization Conference. \nhttps:\/\/csrc.nist.gov\/CSRC\/media\/Events\/Second-PQC-Standardization-Conference\/documents\/accepted-papers\/rossi-simple-fast-constant.pdf\n\n (2019). Accessed 13 Aug 2019"},{"issue":"4","key":"16_CR22","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/1287620.1287622","volume":"39","author":"DB Thomas","year":"2007","unstructured":"Thomas, D.B., Luk, W., Leong, P.H.W., Villasenor, J.D.: Gaussian random number generators. ACM Comput. Surv. 39(4), 11 (2007)","journal-title":"ACM Comput. Surv."},{"key":"16_CR23","unstructured":"von Neumann, J.: Various techniques used in connection with random digits. In: Householder, A., Forsythe, G., Germond, H. (eds.) Monte Carlo Method, pp. 36\u201338 (1951). National Bureau of Standards Applied Mathematics Series, 12, Washington, D.C.: U.S. Government Printing Office"},{"key":"16_CR24","unstructured":"Walter, M.: Private communication (2020). Accessed 29 Jan 2020"},{"key":"16_CR25","unstructured":"Zhang, Z., Chen, C., Hoffstein, J., Whyte, W.: NIST PQ submission: pqNTRUSign a modular lattice signature scheme (2017). \nhttps:\/\/www.onboardsecurity.com\/nist-post-quantum-crypto-submission\n\n. Accessed 01 Aug 2019"},{"issue":"1","key":"16_CR26","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1109\/TC.2019.2940949","volume":"69","author":"RK Zhao","year":"2020","unstructured":"Zhao, R.K., Steinfeld, R., Sakzad, A.: FACCT: fast, compact, and constant-time discrete Gaussian sampler over integers. IEEE Trans. Comput. 69(1), 126\u2013137 (2020)","journal-title":"IEEE Trans. Comput."}],"container-title":["Lecture Notes in Computer Science","Post-Quantum Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-44223-1_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T19:15:25Z","timestamp":1586459725000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-44223-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030442224","9783030442231"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-44223-1_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"10 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PQCrypto","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Post-Quantum Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 April 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 April 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pqcrypto2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pqcrypto2020.inria.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"86","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"34% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}