{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:19:59Z","timestamp":1750220399904,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,11,26]],"date-time":"2021-11-26T00:00:00Z","timestamp":1637884800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Guangxi Science and Technology Major Project","award":["AA18118025"],"award-info":[{"award-number":["AA18118025"]}]},{"name":"Guangxi Key Laboratory of Trusted Software Project","award":["KX202056"],"award-info":[{"award-number":["KX202056"]}]},{"name":"the Natural Science Foundation of Guangxi","award":["2019GXNSFGA245004"],"award-info":[{"award-number":["2019GXNSFGA245004"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,11,26]]},"DOI":"10.1145\/3503047.3503069","type":"proceedings-article","created":{"date-parts":[[2022,1,19]],"date-time":"2022-01-19T23:32:54Z","timestamp":1642635174000},"page":"1-6","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A Frequency-first Heuristic for Shortest Linear Programs"],"prefix":"10.1145","author":[{"given":"Hua","family":"Jiang","sequence":"first","affiliation":[{"name":"School of Computer and Information Security, Guilin University of Electronic Technology, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heng","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Computer and Information Security, Guilin University of Electronic Technology, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huijiao","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer and Information Security, Guilin University of Electronic Technology, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer and Information Security, Guilin University of Electronic Technology, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,1,19]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"2019","article-title":"Research on lightweight shape preserving encryption algorithm for digital type","volume":"0","author":"Botao Liu","year":"2019","unstructured":"Botao Liu , Changgen Peng, Ruixue Wu , Hongfa Ding, Mingming Xie . 2019 . Research on lightweight shape preserving encryption algorithm for digital type . Journal of computer research and development (07),1488-1497.http:\/\/doi:CNKI:SUN:JFYZ. 0 . 2019 - 2007 -012. Botao Liu, Changgen Peng, Ruixue Wu, Hongfa Ding, Mingming Xie. 2019. Research on lightweight shape preserving encryption algorithm for digital type. Journal of computer research and development (07),1488-1497.http:\/\/doi:CNKI:SUN:JFYZ.0.2019-07-012.","journal-title":"Journal of computer research and development (07),1488-1497.http:\/\/doi:CNKI:SUN:JFYZ."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.46586\/tosc.v2020.i2.120-145"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.46586\/tches.v2019.i4.91-125"},{"key":"e_1_3_2_1_4_1","volume-title":"FSE","author":"Stoffelen K.","year":"2016","unstructured":"Stoffelen K. 2016 . Optimizing S-Box Implementations for Several Criteria Using SAT Solvers. In: Peyrin T. (eds) Fast Software Encryption . FSE 2016. Lecture Notes in Computer Science, vol 9783. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-662-52993-5_8 10.1007\/978-3-662-52993-5_8 Stoffelen K. 2016. Optimizing S-Box Implementations for Several Criteria Using SAT Solvers. In: Peyrin T. (eds) Fast Software Encryption. FSE 2016. Lecture Notes in Computer Science, vol 9783. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-662-52993-5_8"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.46586\/tosc.v2017.i4.130-168"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.1997.613165"},{"key":"e_1_3_2_1_7_1","volume-title":"SEA","author":"Boyar J.","year":"2010","unstructured":"Boyar J. , Peralta R. ( 2010 ) A New Combinational Logic Minimization Technique with Applications to Cryptology. In: Festa P. (eds) Experimental Algorithms . SEA 2010. Lecture Notes in Computer Science, vol 6049. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-642-13193-6_16 10.1007\/978-3-642-13193-6_16 Boyar J., Peralta R. (2010) A New Combinational Logic Minimization Technique with Applications to Cryptology. In: Festa P. (eds) Experimental Algorithms. SEA 2010. Lecture Notes in Computer Science, vol 6049. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-642-13193-6_16"},{"key":"e_1_3_2_1_8_1","volume-title":"FCT","author":"Boyar J.","year":"2013","unstructured":"Boyar J. , Find M.G. ( 2013 ) Cancellation-Free Circuits in Unbounded and Bounded Depth. In: G\u0105sieniec L., Wolter F. (eds) Fundamentals of Computation Theory . FCT 2013. Lecture Notes in Computer Science, vol 8070. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-642-40164-0_17 10.1007\/978-3-642-40164-0_17 Boyar J., Find M.G. (2013) Cancellation-Free Circuits in Unbounded and Bounded Depth. In: G\u0105sieniec L., Wolter F. (eds) Fundamentals of Computation Theory. FCT 2013. Lecture Notes in Computer Science, vol 8070. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-642-40164-0_17"},{"key":"e_1_3_2_1_9_1","volume-title":"MFCS","author":"Boyar J.","year":"2008","unstructured":"Boyar J. , Matthews P. , Peralta R. ( 2008 ) On the Shortest Linear Straight-Line Program for Computing Linear Forms. In: Ochma\u0144ski E., Tyszkiewicz J. (eds) Mathematical Foundations of Computer Science 2008 . MFCS 2008. Lecture Notes in Computer Science, vol 5162. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-540-85238-4_13 10.1007\/978-3-540-85238-4_13 Boyar J., Matthews P., Peralta R. (2008) On the Shortest Linear Straight-Line Program for Computing Linear Forms. In: Ochma\u0144ski E., Tyszkiewicz J. (eds) Mathematical Foundations of Computer Science 2008. MFCS 2008. Lecture Notes in Computer Science, vol 5162. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-540-85238-4_13"},{"key":"e_1_3_2_1_10_1","volume-title":"IWSEC","author":"Banik S.","year":"2019","unstructured":"Banik S. , Funabiki Y. , Isobe T. ( 2019 ) More Results on Shortest Linear Programs. In: Attrapadung N., Yagi T. (eds) Advances in Information and Computer Security . IWSEC 2019. Lecture Notes in Computer Science, vol 11689. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-030-26834-3_7 10.1007\/978-3-030-26834-3_7 Banik S., Funabiki Y., Isobe T. (2019) More Results on Shortest Linear Programs. In: Attrapadung N., Yagi T. (eds) Advances in Information and Computer Security. IWSEC 2019. Lecture Notes in Computer Science, vol 11689. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-030-26834-3_7"},{"key":"e_1_3_2_1_11_1","unstructured":"Sajadieh M Mousavi M.2020. A New Approach for the Implementation of Binary Matrices Using SLP Applications. IACR Cryptol. ePrint Arch https:\/\/eprint.iacr.org\/2020\/032  Sajadieh M Mousavi M.2020. A New Approach for the Implementation of Binary Matrices Using SLP Applications. IACR Cryptol. ePrint Arch https:\/\/eprint.iacr.org\/2020\/032"},{"key":"e_1_3_2_1_12_1","first-page":"833","article-title":"AES MixColumn with 92 XOR gates","volume":"2019","author":"Maximov A.","year":"2019","unstructured":"Maximov A. 2019 . AES MixColumn with 92 XOR gates . IACR Cryptology ePrint Archive , 2019 : 833 . https:\/\/eprint.iacr.org\/2019\/833 Maximov A.2019. AES MixColumn with 92 XOR gates. IACR Cryptology ePrint Archive, 2019:833. https:\/\/eprint.iacr.org\/2019\/833","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.46586\/tches.v2018.i2.298-336"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.46586\/tches.v2020.i1.203-230"},{"key":"e_1_3_2_1_15_1","volume-title":"Logic Minimization Techniques with Applications to Cryptology. J Cryptol 26, 280\u2013312","author":"Boyar J.","year":"2013","unstructured":"Boyar , J. , Matthews , P. & Peralta , R. Logic Minimization Techniques with Applications to Cryptology. J Cryptol 26, 280\u2013312 ( 2013 ). https:\/\/doi.org\/10.1007\/s00145-012-9124-7 10.1007\/s00145-012-9124-7 Boyar, J., Matthews, P. & Peralta, R. Logic Minimization Techniques with Applications to Cryptology. J Cryptol 26, 280\u2013312 (2013). https:\/\/doi.org\/10.1007\/s00145-012-9124-7"},{"issue":"05","key":"e_1_3_2_1_16_1","first-page":"1045","article-title":"RAIN: A Lightweight block cipher Algorithm for Hardware, Software and Threshold Implementation","volume":"58","author":"Cao Meichun","year":"2019","unstructured":"Cao Meichun , Zhang Wenying, Chen Yanqin , Xing Zhaohui, Wu Lei . 2019 . RAIN: A Lightweight block cipher Algorithm for Hardware, Software and Threshold Implementation . Journal of Computer Research and Development , 58 ( 05 ): 1045 - 1055 .https:\/\/ doi:CNKI:SUN:JFYZ.0.2021-05-013 Cao Meichun, Zhang Wenying, Chen Yanqin, Xing Zhaohui, Wu Lei.2019. RAIN: A Lightweight block cipher Algorithm for Hardware, Software and Threshold Implementation. Journal of Computer Research and Development,58(05):1045-1055.https:\/\/ doi:CNKI:SUN:JFYZ.0.2021-05-013","journal-title":"Journal of Computer Research and Development"},{"key":"e_1_3_2_1_17_1","volume-title":"CHES","author":"Khoo K.","year":"2014","unstructured":"Khoo K. , Peyrin T. , Poschmann A.Y. , Yap H. ( 2014 ) FOAM: Searching for Hardware-Optimal SPN Structures and Components with a Fair Comparison. In: Batina L., Robshaw M. (eds) Cryptographic Hardware and Embedded Systems \u2013 CHES 2014 . CHES 2014. Lecture Notes in Computer Science, vol 8731. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-662-44709-3_24 10.1007\/978-3-662-44709-3_24 Khoo K., Peyrin T., Poschmann A.Y., Yap H. (2014) FOAM: Searching for Hardware-Optimal SPN Structures and Components with a Fair Comparison. In: Batina L., Robshaw M. (eds) Cryptographic Hardware and Embedded Systems \u2013 CHES 2014. CHES 2014. Lecture Notes in Computer Science, vol 8731. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-662-44709-3_24"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.46586\/tosc.v2017.i4.188-211"},{"key":"e_1_3_2_1_19_1","volume-title":"Improved upper bounds for the expected circuit complexity of dense systems of linear equations over gf (2). Information Processing Letters, 137(SEP.), 1-5. https:\/\/doi.org\/10.1016\/j.ipl.2018.04","author":"Visconti A.","year":"2018","unstructured":"[ 1 ] Visconti , A. , Schiavo , C. V. , & Peralta , R. ( 2018 ). Improved upper bounds for the expected circuit complexity of dense systems of linear equations over gf (2). Information Processing Letters, 137(SEP.), 1-5. https:\/\/doi.org\/10.1016\/j.ipl.2018.04 10.1016\/j.ipl.2018.04 [1] Visconti, A., Schiavo, C. V., & Peralta, R. (2018). Improved upper bounds for the expected circuit complexity of dense systems of linear equations over gf (2). Information Processing Letters, 137(SEP.), 1-5. https:\/\/doi.org\/10.1016\/j.ipl.2018.04"}],"event":{"name":"AISS 2021: 2021 3rd International Conference on Advanced Information Science and System","acronym":"AISS 2021","location":"Sanya China"},"container-title":["Proceedings of the 3rd International Conference on Advanced Information Science and System"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3503047.3503069","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3503047.3503069","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:18:49Z","timestamp":1750191529000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3503047.3503069"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,26]]},"references-count":19,"alternative-id":["10.1145\/3503047.3503069","10.1145\/3503047"],"URL":"https:\/\/doi.org\/10.1145\/3503047.3503069","relation":{},"subject":[],"published":{"date-parts":[[2021,11,26]]},"assertion":[{"value":"2022-01-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}