{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T13:19:02Z","timestamp":1769519942184,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,11,6]],"date-time":"2019-11-06T00:00:00Z","timestamp":1572998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"European Union's H2020 Programme","award":["ERC-669891"],"award-info":[{"award-number":["ERC-669891"]}]},{"name":"European Union's H2020 Programme","award":["PROMETHEUS project (grant 780701)"],"award-info":[{"award-number":["PROMETHEUS project (grant 780701)"]}]},{"name":"French Programme d'Investissement d'Avenir under national project","award":["RISQ P14158"],"award-info":[{"award-number":["RISQ P14158"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,11,6]]},"DOI":"10.1145\/3319535.3363223","type":"proceedings-article","created":{"date-parts":[[2019,11,7]],"date-time":"2019-11-07T13:08:32Z","timestamp":1573132112000},"page":"2147-2164","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":38,"title":["GALACTICS"],"prefix":"10.1145","author":[{"given":"Gilles","family":"Barthe","sequence":"first","affiliation":[{"name":"MPI-SP and IMDEA Software Institute, Bochum, Germany"}]},{"given":"Sonia","family":"Bela\u00efd","sequence":"additional","affiliation":[{"name":"CryptoExperts, Paris, France"}]},{"given":"Thomas","family":"Espitau","sequence":"additional","affiliation":[{"name":"Sorbonne Universit\u00e9, PARIS, France"}]},{"given":"Pierre-Alain","family":"Fouque","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de Rennes, Rennes, France"}]},{"given":"M\u00e9lissa","family":"Rossi","sequence":"additional","affiliation":[{"name":"Thales, ENS Paris, CNRS, PSL University, INRIA, Paris, France"}]},{"given":"Mehdi","family":"Tibouchi","sequence":"additional","affiliation":[{"name":"NTT Corporation, Paris, Japan"}]}],"member":"320","published-online":{"date-parts":[[2019,11,6]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Ricardini","author":"Alkim Erdem","year":"2019","unstructured":"Erdem Alkim , Paulo S. L. M. Barreto , Nina Bindel , Patrick Longa , and Jefferson E . Ricardini . 2019 . The lattice-based digital signature scheme qTESLA. Cryptology ePrint Archive, Report 2019\/085. (2019). https:\/\/eprint.iacr.org\/2019\/085. Erdem Alkim, Paulo S. L. M. Barreto, Nina Bindel, Patrick Longa, and Jefferson E. Ricardini. 2019. The lattice-based digital signature scheme qTESLA. Cryptology ePrint Archive, Report 2019\/085. (2019). https:\/\/eprint.iacr.org\/2019\/085."},{"key":"e_1_3_2_2_2_1","volume-title":"Pierre-Alain Fouque, Benjamin Gr\u00e9goire, Pierre-Yves Strub, and R\u00e9becca Zucchini.","author":"Barthe Gilles","year":"2016","unstructured":"Gilles Barthe , Sonia Bela\"id , Franc cois Dupressoir , Pierre-Alain Fouque, Benjamin Gr\u00e9goire, Pierre-Yves Strub, and R\u00e9becca Zucchini. 2016 . Strong Non-Interference and Type-Directed Higher-Order Masking. In ACM CCS 2016, Edgar R. Weippl, Stefan Katzenbeisser, Christopher Kruegel, Andrew C. Myers, and Shai Halevi (Eds.). ACM Press , 116--129. https:\/\/doi.org\/10.1145\/2976749.2978427 10.1145\/2976749.2978427 Gilles Barthe, Sonia Bela\"id, Franc cois Dupressoir, Pierre-Alain Fouque, Benjamin Gr\u00e9goire, Pierre-Yves Strub, and R\u00e9becca Zucchini. 2016. Strong Non-Interference and Type-Directed Higher-Order Masking. In ACM CCS 2016, Edgar R. Weippl, Stefan Katzenbeisser, Christopher Kruegel, Andrew C. Myers, and Shai Halevi (Eds.). ACM Press, 116--129. https:\/\/doi.org\/10.1145\/2976749.2978427"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78375-8_12"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3363223"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"crossref","unstructured":"Gilles Barthes Sonia Bela\u00efd Thomas Espitau M\u00e9lissa Rossi and Mehdi Tibouchi. 2019. GALACTICS implementations. (2019). https:\/\/github.com\/espitau\/GALACTICS  Gilles Barthes Sonia Bela\u00efd Thomas Espitau M\u00e9lissa Rossi and Mehdi Tibouchi. 2019. GALACTICS implementations. (2019). https:\/\/github.com\/espitau\/GALACTICS","DOI":"10.1145\/3319535.3363223"},{"key":"e_1_3_2_2_6_1","volume-title":"Bernstein and VAMPIRE Lab others","author":"Daniel","year":"2016","unstructured":"Daniel J. Bernstein and VAMPIRE Lab others . 2016 . System for Unified Performance Evaluation Related to Cryptographic Operations and Primitives . https:\/\/bench.cr.yp.to\/supercop.html. (2016). Daniel J. Bernstein and VAMPIRE Lab others. 2016. System for Unified Performance Evaluation Related to Cryptographic Operations and Primitives. https:\/\/bench.cr.yp.to\/supercop.html. (2016)."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-03326-2_17"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13389-014-0084-8"},{"key":"e_1_3_2_2_9_1","volume-title":"18th IEEE Symposium on Computer Arithmetic (ARITH 18)","author":"Brisebarre Nicolas","year":"2018","unstructured":"Nicolas Brisebarre and Sylvain Chevillard . 2018 . Efficient polynomial $L^infty$-approximations . 18th IEEE Symposium on Computer Arithmetic (ARITH 18) . IEEE, 169--176. Nicolas Brisebarre and Sylvain Chevillard. 2018. Efficient polynomial $L^infty$-approximations. 18th IEEE Symposium on Computer Arithmetic (ARITH 18). IEEE, 169--176."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53140-2_16"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2399924"},{"key":"e_1_3_2_2_12_1","volume-title":"Sollya: An Environment for the Development of Numerical Codes. In Mathematical Software - ICMS 2010 (Lecture Notes in Computer Science)","author":"Chevillard S.","year":"2010","unstructured":"S. Chevillard , M. Joldecs , and C. Lauter . 2010 . Sollya: An Environment for the Development of Numerical Codes. In Mathematical Software - ICMS 2010 (Lecture Notes in Computer Science) , K. Fukuda, J. van der Hoeven, M. Joswig, and N. Takayama (Eds.), Vol. 6327 . Springer , Heidelberg, Germany , 28--31. S. Chevillard, M. Joldecs, and C. Lauter. 2010. Sollya: An Environment for the Development of Numerical Codes. In Mathematical Software - ICMS 2010 (Lecture Notes in Computer Science), K. Fukuda, J. van der Hoeven, M. Joswig, and N. Takayama (Eds.), Vol. 6327. Springer, Heidelberg, Germany, 28--31."},{"key":"e_1_3_2_2_13_1","volume-title":"Higher-Order Side Channel Security and Mask Refreshing. In FSE 2013 (LNCS ), Shiho Moriai (Ed.)","volume":"8424","author":"Coron Jean-S\u00e9bastien","year":"2014","unstructured":"Jean-S\u00e9bastien Coron , Emmanuel Prouff , Matthieu Rivain , and Thomas Roche . 2014 . Higher-Order Side Channel Security and Mask Refreshing. In FSE 2013 (LNCS ), Shiho Moriai (Ed.) , Vol. 8424 . Springer, Heidelberg, 410--424. https:\/\/doi.org\/10.1007\/978--3--662--43933--3_21 10.1007\/978--3--662--43933--3_21 Jean-S\u00e9bastien Coron, Emmanuel Prouff, Matthieu Rivain, and Thomas Roche. 2014. Higher-Order Side Channel Security and Mask Refreshing. In FSE 2013 (LNCS ), Shiho Moriai (Ed.), Vol. 8424. Springer, Heidelberg, 410--424. https:\/\/doi.org\/10.1007\/978--3--662--43933--3_21"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-55220-5_24"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40041-4_3"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.46586\/tches.v2018.i1.238-268"},{"key":"e_1_3_2_2_19_1","volume-title":"BLISS: Bimodal Lattice Signature Schemes. (June","author":"Ducas L\u00e9","year":"2013","unstructured":"L\u00e9 o Ducas and Tancr\u00e8 de Lepoint . 2013 . BLISS: Bimodal Lattice Signature Schemes. (June 2013). http:\/\/bliss.di.ens.fr\/bliss-06--13--2013.zip (original implementation). L\u00e9 o Ducas and Tancr\u00e8 de Lepoint. 2013. BLISS: Bimodal Lattice Signature Schemes. (June 2013). http:\/\/bliss.di.ens.fr\/bliss-06--13--2013.zip (original implementation)."},{"key":"e_1_3_2_2_20_1","volume-title":"Faster Gaussian Lattice Sampling Using Lazy Floating-Point Arithmetic. In ASIACRYPT 2012 (LNCS ), Xiaoyun Wang and Kazue Sako (Eds.)","volume":"7658","author":"Ducas L\u00e9o","unstructured":"L\u00e9o Ducas and Phong Q. Nguyen . 2012 . Faster Gaussian Lattice Sampling Using Lazy Floating-Point Arithmetic. In ASIACRYPT 2012 (LNCS ), Xiaoyun Wang and Kazue Sako (Eds.) , Vol. 7658 . Springer, Heidelberg, 415--432. https:\/\/doi.org\/10.1007\/978--3--642--34961--4_26 10.1007\/978--3--642--34961--4_26 L\u00e9o Ducas and Phong Q. Nguyen. 2012. Faster Gaussian Lattice Sampling Using Lazy Floating-Point Arithmetic. In ASIACRYPT 2012 (LNCS ), Xiaoyun Wang and Kazue Sako (Eds.), Vol. 7658. Springer, Heidelberg, 415--432. https:\/\/doi.org\/10.1007\/978--3--642--34961--4_26"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2018.2833119"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134028"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2020011"},{"key":"e_1_3_2_2_24_1","volume-title":"Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems. In CHES 2012 (LNCS ), Emmanuel Prouff and Patrick Schaumont (Eds.)","volume":"7428","author":"G\u00fcneysu Tim","year":"2012","unstructured":"Tim G\u00fcneysu , Vadim Lyubashevsky , and Thomas P\u00f6ppelmann . 2012 . Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems. In CHES 2012 (LNCS ), Emmanuel Prouff and Patrick Schaumont (Eds.) , Vol. 7428 . Springer, Heidelberg, 530--547. https:\/\/doi.org\/10.1007\/978--3--642--33027--8_31 10.1007\/978--3--642--33027--8_31 Tim G\u00fcneysu, Vadim Lyubashevsky, and Thomas P\u00f6ppelmann. 2012. Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems. In CHES 2012 (LNCS ), Emmanuel Prouff and Patrick Schaumont (Eds.), Vol. 7428. Springer, Heidelberg, 530--547. https:\/\/doi.org\/10.1007\/978--3--642--33027--8_31"},{"key":"e_1_3_2_2_25_1","volume-title":"Accuracy and Stability of Numerical Algorithms","author":"Higham Nicholas J.","unstructured":"Nicholas J. Higham . 2002. Accuracy and Stability of Numerical Algorithms second ed.). SIAM. Nicholas J. Higham. 2002. Accuracy and Stability of Numerical Algorithms second ed.). SIAM."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74143-5_9"},{"key":"e_1_3_2_2_27_1","volume-title":"PKC","author":"H\u00fclsing Andreas","year":"2018","unstructured":"Andreas H\u00fclsing , Tanja Lange , and Kit Smeets . 2018. Rounded Gaussians - Fast and Secure Constant-Time Sampling for Lattice-Based Crypto . In PKC 2018 , Part II (LNCS ), Michel Abdalla and Ricardo Dahab (Eds.), Vol. 10770 . Springer , Heidelberg, 728--757. https:\/\/doi.org\/10.1007\/978--3--319--76581--5_25 10.1007\/978--3--319--76581--5_25 Andreas H\u00fclsing, Tanja Lange, and Kit Smeets. 2018. Rounded Gaussians - Fast and Secure Constant-Time Sampling for Lattice-Based Crypto. In PKC 2018, Part II (LNCS ), Michel Abdalla and Ricardo Dahab (Eds.), Vol. 10770. Springer, Heidelberg, 728--757. https:\/\/doi.org\/10.1007\/978--3--319--76581--5_25"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45146-4_27"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2018.2814587"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2904918"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10366-7_35"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_43"},{"key":"e_1_3_2_2_33_1","volume-title":"Generic, Constant-Time. In CRYPTO","author":"Micciancio Daniele","year":"2017","unstructured":"Daniele Micciancio and Michael Walter . 2017. Gaussian Sampling over the Integers: Efficient , Generic, Constant-Time. In CRYPTO 2017 , Part II (LNCS ), Jonathan Katz and Hovav Shacham (Eds.), Vol. 10402 . Springer , Heidelberg, 455--485. https:\/\/doi.org\/10.1007\/978--3--319--63715-0_16 10.1007\/978--3--319--63715-0_16 Daniele Micciancio and Michael Walter. 2017. Gaussian Sampling over the Integers: Efficient, Generic, Constant-Time. In CRYPTO 2017, Part II (LNCS ), Jonathan Katz and Hovav Shacham (Eds.), Vol. 10402. Springer, Heidelberg, 455--485. https:\/\/doi.org\/10.1007\/978--3--319--63715-0_16"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134023"},{"key":"e_1_3_2_2_35_1","volume-title":"Enhanced Lattice-Based Signatures on Reconfigurable Hardware. In CHES 2014 (LNCS ), Lejla Batina and Matthew Robshaw (Eds.)","volume":"8731","author":"P\u00f6ppelmann Thomas","year":"2014","unstructured":"Thomas P\u00f6ppelmann , L\u00e9o Ducas , and Tim G\u00fcneysu . 2014 . Enhanced Lattice-Based Signatures on Reconfigurable Hardware. In CHES 2014 (LNCS ), Lejla Batina and Matthew Robshaw (Eds.) , Vol. 8731 . Springer, Heidelberg, 353--370. https:\/\/doi.org\/10.1007\/978--3--662--44709--3_20 10.1007\/978--3--662--44709--3_20 Thomas P\u00f6ppelmann, L\u00e9o Ducas, and Tim G\u00fcneysu. 2014. Enhanced Lattice-Based Signatures on Reconfigurable Hardware. In CHES 2014 (LNCS ), Lejla Batina and Matthew Robshaw (Eds.), Vol. 8731. Springer, Heidelberg, 353--370. https:\/\/doi.org\/10.1007\/978--3--662--44709--3_20"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70694-8_13"},{"key":"e_1_3_2_2_37_1","volume-title":"FALCON: Fast-Fourier Lattice-based Compact Signatures over NTRU. (11","author":"Prest Thomas","year":"2017","unstructured":"Thomas Prest , Pierre-Alain Fouque , Jeffrey Hoffstein , Paul Kirchner , Vadim Lyubashevsky , Thomas Pornin , Thomas Ricosset , Gregor Seiler , William Whyte , and Zhenfei Zhang . 2017 . FALCON: Fast-Fourier Lattice-based Compact Signatures over NTRU. (11 2017). https:\/\/falcon-sign.info. Thomas Prest, Pierre-Alain Fouque, Jeffrey Hoffstein, Paul Kirchner, Vadim Lyubashevsky, Thomas Pornin, Thomas Ricosset, Gregor Seiler, William Whyte, and Zhenfei Zhang. 2017. FALCON: Fast-Fourier Lattice-based Compact Signatures over NTRU. (11 2017). https:\/\/falcon-sign.info."},{"key":"e_1_3_2_2_38_1","volume-title":"DATE","author":"Reparaz Oscar","unstructured":"Oscar Reparaz , Josep Balasch , and Ingrid Verbauwhede . 2017. Dude , is my code constant time? . In DATE , David Atienza and Giorgio Di Natale (Eds.). IEEE , 1697--1702. Oscar Reparaz, Josep Balasch, and Ingrid Verbauwhede. 2017. Dude, is my code constant time?. In DATE, David Atienza and Giorgio Di Natale (Eds.). IEEE, 1697--1702."},{"key":"e_1_3_2_2_39_1","volume-title":"Provably Secure Higher-Order Masking of AES. In CHES 2010 (LNCS ), Stefan Mangard and Franccois-Xavier Standaert (Eds.)","volume":"6225","author":"Rivain Matthieu","year":"2010","unstructured":"Matthieu Rivain and Emmanuel Prouff . 2010 . Provably Secure Higher-Order Masking of AES. In CHES 2010 (LNCS ), Stefan Mangard and Franccois-Xavier Standaert (Eds.) , Vol. 6225 . Springer, Heidelberg, 413--427. https:\/\/doi.org\/10.1007\/978--3--642--15031--9_28 10.1007\/978--3--642--15031--9_28 Matthieu Rivain and Emmanuel Prouff. 2010. Provably Secure Higher-Order Masking of AES. In CHES 2010 (LNCS ), Stefan Mangard and Franccois-Xavier Standaert (Eds.), Vol. 6225. Springer, Heidelberg, 413--427. https:\/\/doi.org\/10.1007\/978--3--642--15031--9_28"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1090\/trans2\/034\/02"},{"key":"e_1_3_2_2_42_1","volume-title":"Proceedings (Lecture Notes in Computer Science), Johannes Buchmann, Abderrahmane Nitaj, and Tajje-eddine Rachidi (Eds.)","volume":"11627","author":"Walter Michael","year":"2019","unstructured":"Michael Walter . 2019 . Progress in Cryptology - AFRICACRYPT 2019 - 11th International Conference on Cryptology in Africa, Rabat, Morocco, July 9--11, 2019 , Proceedings (Lecture Notes in Computer Science), Johannes Buchmann, Abderrahmane Nitaj, and Tajje-eddine Rachidi (Eds.) , Vol. 11627 . Springer, 157--180. Michael Walter. 2019. Progress in Cryptology - AFRICACRYPT 2019 - 11th International Conference on Cryptology in Africa, Rabat, Morocco, July 9--11, 2019, Proceedings (Lecture Notes in Computer Science), Johannes Buchmann, Abderrahmane Nitaj, and Tajje-eddine Rachidi (Eds.), Vol. 11627. Springer, 157--180."},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1515\/jmc-2016-0044"},{"key":"e_1_3_2_2_44_1","volume-title":"FACCT: FAst, Compact, and Constant-Time Discrete Gaussian Sampler over Integers. Cryptology ePrint Archive, Report 2018\/1234.","author":"Zhao Raymond K.","year":"2018","unstructured":"Raymond K. Zhao , Ron Steinfeld , and Amin Sakzad . 2018 . FACCT: FAst, Compact, and Constant-Time Discrete Gaussian Sampler over Integers. Cryptology ePrint Archive, Report 2018\/1234. (2018). https:\/\/eprint.iacr.org\/2018\/1234. Raymond K. Zhao, Ron Steinfeld, and Amin Sakzad. 2018. FACCT: FAst, Compact, and Constant-Time Discrete Gaussian Sampler over Integers. Cryptology ePrint Archive, Report 2018\/1234. (2018). https:\/\/eprint.iacr.org\/2018\/1234."}],"event":{"name":"CCS '19: 2019 ACM SIGSAC Conference on Computer and Communications Security","location":"London United Kingdom","acronym":"CCS '19","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3319535.3363223","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3319535.3363223","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:44:33Z","timestamp":1750203873000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3319535.3363223"}},"subtitle":["Gaussian Sampling for Lattice-Based Constant- Time Implementation of Cryptographic Signatures, Revisited"],"short-title":[],"issued":{"date-parts":[[2019,11,6]]},"references-count":41,"alternative-id":["10.1145\/3319535.3363223","10.1145\/3319535"],"URL":"https:\/\/doi.org\/10.1145\/3319535.3363223","relation":{},"subject":[],"published":{"date-parts":[[2019,11,6]]},"assertion":[{"value":"2019-11-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}