{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T01:50:34Z","timestamp":1768787434107,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":51,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,11,15]],"date-time":"2023-11-15T00:00:00Z","timestamp":1700006400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,11,15]]},"DOI":"10.1145\/3576915.3623076","type":"proceedings-article","created":{"date-parts":[[2023,11,21]],"date-time":"2023-11-21T12:35:13Z","timestamp":1700570113000},"page":"2606-2620","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["SalsaPicante: A Machine Learning Attack on LWE with Binary Secrets"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-1070-1997","authenticated-orcid":false,"given":"Cathy Yuanchen","family":"Li","sequence":"first","affiliation":[{"name":"Meta AI, Seattle, WA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2498-6399","authenticated-orcid":false,"given":"Jana","family":"Sot\u00e1kov\u00e1","sequence":"additional","affiliation":[{"name":"Meta AI, Seattle, WA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-3346-8226","authenticated-orcid":false,"given":"Emily","family":"Wenger","sequence":"additional","affiliation":[{"name":"The University of Chicago, Chicago, IL, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-8412-4135","authenticated-orcid":false,"given":"Mohamed","family":"Malhou","sequence":"additional","affiliation":[{"name":"Meta AI, Paris, France"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-4600-532X","authenticated-orcid":false,"given":"Evrard","family":"Garcelon","sequence":"additional","affiliation":[{"name":"Meta AI, Paris, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5912-3342","authenticated-orcid":false,"given":"Fran\u00e7ois","family":"Charton","sequence":"additional","affiliation":[{"name":"Meta AI, Paris, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1320-696X","authenticated-orcid":false,"given":"Kristin","family":"Lauter","sequence":"additional","affiliation":[{"name":"Meta AI, Seattle, WA, USA"}]}],"member":"320","published-online":{"date-parts":[[2023,11,21]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Solving rubik's cube with a robot hand","author":"Akkaya I.","year":"2019","unstructured":"Akkaya, I., Andrychowicz, M., Chociej, M., et al. Solving rubik's cube with a robot hand, 2019. https:\/\/arxiv.org\/abs\/1910.07113."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-77287-1_2"},{"key":"e_1_3_2_1_3_1","volume-title":"M. R. On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL. In Proc. of EUROCRYPT","author":"Albrecht","year":"2017","unstructured":"Albrecht, M. R. On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL. In Proc. of EUROCRYPT (2017)."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70694-8_11"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1515\/jmc-2015-0016"},{"key":"e_1_3_2_1_6_1","unstructured":"Avanzi R. Bos J. Ducas L. Kiltz E. Lepoint T. Lyubashevsky V. Schanck J. M. Schwabe P. Seiler G. and Stehl\u00e9 D. CRYSTALS-Kyber (version 3.02) - Submission to round 3 of the NIST post-quantum project. Available at https: \/\/pq-crystals.org\/."},{"key":"e_1_3_2_1_7_1","volume-title":"Proc. of ICLR","author":"Bahdanau D.","year":"2014","unstructured":"Bahdanau, D., Cho, K., and Bengio, Y. Neural machine translation by jointly learning to align and translate. In Proc. of ICLR (2014)."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-23696-0_10"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488680"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58452-8_13"},{"key":"e_1_3_2_1_11_1","volume-title":"Linear algebra with transformers","author":"Charton F.","year":"2021","unstructured":"Charton, F. Linear algebra with transformers, 2021. https:\/\/arxiv.org\/abs\/2112. 01898."},{"key":"e_1_3_2_1_12_1","volume-title":"Paper 2020\/539","author":"Chen H.","year":"2020","unstructured":"Chen, H., Chua, L., Lauter, K., and Song, Y. On the Concrete Security of LWE with Small Secret. Cryptology ePrint Archive, Paper 2020\/539, 2020. https: \/\/eprint.iacr.org\/2020\/539."},{"key":"e_1_3_2_1_13_1","volume-title":"Plus Fourth Round Candidates. US Department of Commerce, NIST","author":"Chen L.","year":"2022","unstructured":"Chen, L., Moody, D., Liu, Y.-K., et al. PQC Standardization Process: Announcing Four Candidates to be Standardized, Plus Fourth Round Candidates. US Department of Commerce, NIST (2022). https:\/\/csrc.nist.gov\/News\/2022\/ pqc-candidates-to-be-standardized-and-round-4."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25385-0_1"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2925425"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70694-8_15"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-98113-0_9"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1179"},{"key":"e_1_3_2_1_19_1","volume-title":"Proc. of ICML","author":"Csord\u00e1s R.","year":"2022","unstructured":"Csord\u00e1s, R., Irie, K., and Schmidhuber, J. The Neural Data Router: Adaptive Control Flow in Transformers Improves Systematic Generalization. In Proc. of ICML (2022)."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3338469.3358940"},{"key":"e_1_3_2_1_21_1","volume-title":"Proc. of ICLR","author":"Dehghani M.","year":"2019","unstructured":"Dehghani, M., Gouws, S., Vinyals, O., Uszkoreit, J., and Kaiser, \u0141. Universal transformers. In Proc. of ICLR (2019)."},{"key":"e_1_3_2_1_22_1","volume-title":"Version: 5.4.4.","year":"2023","unstructured":"development team, T. F. fplll, a lattice reduction library, Version: 5.4.4. Available at https:\/\/github.com\/fplll\/fplll, 2023."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2018.8462506"},{"key":"e_1_3_2_1_24_1","volume-title":"Proc. of ICLR","author":"Dosovitskiy A.","year":"2021","unstructured":"Dosovitskiy, A., Beyer, L., Kolesnikov, A., et al. An image is worth 16x16 words: Transformers for image recognition at scale. In Proc. of ICLR (2021)."},{"key":"e_1_3_2_1_25_1","unstructured":"Ducas L. Kiltz E. Lepoint T. Lyubashevsky V. Schwabe P. Seiler G. and Stehl\u00e9 D. CRYSTALS-Dilithium - Algorithm Specifications and Supporting Documentation (Version 3.1). Available at https:\/\/pq-crystals.org\/."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.12.3.415"},{"key":"e_1_3_2_1_27_1","volume-title":"Proc. of ICLR","author":"Kingma D. P.","year":"2015","unstructured":"Kingma, D. P., and Ba, J. Adam: A method for stochastic optimization. In Proc. of ICLR (2015)."},{"key":"e_1_3_2_1_28_1","volume-title":"Key recovery for lwe in polynomial time. Cryptology ePrint Archive","author":"Laine K.","year":"2015","unstructured":"Laine, K., and Lauter, K. Key recovery for lwe in polynomial time. Cryptology ePrint Archive (2015). https:\/\/eprint.iacr.org\/2015\/176.pdf."},{"key":"e_1_3_2_1_29_1","volume-title":"Proc. of ICLR","author":"Lample G.","year":"2020","unstructured":"Lample, G., and Charton, F. Deep learning for symbolic mathematics. In Proc. of ICLR (2020)."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01457454"},{"key":"e_1_3_2_1_31_1","volume-title":"Salsa verde: a machine learning attack on learning with errors with sparse small secrets","author":"Li C.","year":"2023","unstructured":"Li, C., Sotakova, J., Wenger, E., Allen-Zhu, Z., Charton, F., and Lauter, K. Salsa verde: a machine learning attack on learning with errors with sparse small secrets, 2023. https:\/\/arxiv.org\/abs\/2306.11641."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03356-8_34"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.119"},{"key":"e_1_3_2_1_34_1","unstructured":"Palamas T. Investigating the ability of neural networks to learn simple modular arithmetic."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536461"},{"key":"e_1_3_2_1_36_1","volume-title":"Generative language modeling for automated theorem proving","author":"Polu S.","year":"2020","unstructured":"Polu, S., and Sutskever, I. Generative language modeling for automated theorem proving, 2020. https:\/\/arxiv.org\/abs\/2009.03393."},{"key":"e_1_3_2_1_37_1","volume-title":"Improving language understanding by generative pre-training. OpenAI blog","author":"Radford A.","year":"2018","unstructured":"Radford, A., Narasimhan, K., Salimans, T., and Sutskever, I. Improving language understanding by generative pre-training. OpenAI blog (2018). https:\/\/s3-us-west-2.amazonaws.com\/openai-assets\/research-covers\/ language-unsupervised\/language_understanding_paper.pdf."},{"key":"e_1_3_2_1_38_1","volume-title":"Language models are unsupervised multitask learners. OpenAI blog","author":"Radford A.","year":"2019","unstructured":"Radford, A., Wu, J., Child, R., Luan, D., Amodei, D., Sutskever, I., et al. Language models are unsupervised multitask learners. OpenAI blog (2019). https:\/\/d4mucfpksywv.cloudfront.net\/better-language-models\/language_models_are_unsupervised_multitask_learners.pdf."},{"key":"e_1_3_2_1_39_1","volume-title":"Zero-shot text-to-image generation","author":"Ramesh A.","year":"2021","unstructured":"Ramesh, A., Pavlov, M., Goh, G., Gray, S., Voss, C., Radford, A., Chen, M., and Sutskever, I. Zero-shot text-to-image generation, 2021. https:\/\/arxiv.org\/ abs\/2102.12092."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703440678"},{"key":"e_1_3_2_1_41_1","volume-title":"Cryptography. In Proc. of the ACM Symposium on Theory of Computing","author":"Regev O.","year":"2005","unstructured":"Regev, O. On Lattices, Learning with Errors, Random Linear Codes, and Cryptography. In Proc. of the ACM Symposium on Theory of Computing (2005)."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.21236\/ADA606588"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.134"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCVW.2015.41"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(87)90064-8"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01581144"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-020-03051-4"},{"key":"e_1_3_2_1_48_1","volume-title":"Jan.","author":"Microsoft","year":"2023","unstructured":"Microsoft SEAL (release 4.1). https:\/\/github.com\/Microsoft\/SEAL, Jan. 2023. Microsoft Research, Redmond, WA."},{"key":"e_1_3_2_1_49_1","volume-title":"Proc. of NeurIPS","author":"Vaswani A.","year":"2017","unstructured":"Vaswani, A., Shazeer, N., Parmar, N., et al. Attention is all you need. In Proc. of NeurIPS (2017)."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP40776.2020.9054345"},{"key":"e_1_3_2_1_51_1","volume-title":"Proc. of NeurIPS","author":"Wenger E.","year":"2022","unstructured":"Wenger, E., Chen, M., Charton, F., and Lauter, K. Salsa: Attacking lattice cryptography with transformers. In Proc. of NeurIPS (2022)."}],"event":{"name":"CCS '23: ACM SIGSAC Conference on Computer and Communications Security","location":"Copenhagen Denmark","acronym":"CCS '23","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3576915.3623076","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3576915.3623076","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T01:44:03Z","timestamp":1755740643000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3576915.3623076"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,15]]},"references-count":51,"alternative-id":["10.1145\/3576915.3623076","10.1145\/3576915"],"URL":"https:\/\/doi.org\/10.1145\/3576915.3623076","relation":{},"subject":[],"published":{"date-parts":[[2023,11,15]]},"assertion":[{"value":"2023-11-21","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}