乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:54:57Z","timestamp":1740099297351,"version":"3.37.3"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T00:00:00Z","timestamp":1559433600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100011199","name":"European Research Council","doi-asserted-by":"publisher","award":["H2020- ERC-2014-ADG 669354 CyberCare"],"id":[{"id":"10.13039\/100011199","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","award":["200021- 169084 MAJesty"]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,2]]},"DOI":"10.1145\/3316781.3317893","type":"proceedings-article","created":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T18:07:13Z","timestamp":1558634833000},"page":"1-6","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":28,"title":["Reducing the Multiplicative Complexity in Logic Networks for Cryptography and Security Applications"],"prefix":"10.1145","author":[{"given":"Eleonora","family":"Testa","sequence":"first","affiliation":[{"name":"EPFL, Lausanne, Switzerland"}]},{"given":"Mathias","family":"Soeken","sequence":"additional","affiliation":[{"name":"EPFL, Lausanne, Switzerland"}]},{"given":"Luca","family":"Amar\u00f9","sequence":"additional","affiliation":[{"name":"Synopsys Inc., Sunnyvale, CA, USA"}]},{"given":"Giovanni","family":"De Micheli","sequence":"additional","affiliation":[{"name":"EPFL, Lausanne, Switzerland"}]}],"member":"320","published-online":{"date-parts":[[2019,6,2]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146909.1147048"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2015.2488484"},{"key":"e_1_3_2_1_3_1","first-page":"287","article-title":"A small depth-16 circuit for the AES S-Box","author":"Boyar J.","year":"2012","unstructured":"J. Boyar and R. Peralta , \" A small depth-16 circuit for the AES S-Box ,\" in International Information Security Conference , 2012 , pp. 287 -- 298 . J. Boyar and R. Peralta, \"A small depth-16 circuit for the AES S-Box,\" in International Information Security Conference, 2012, pp. 287--298.","journal-title":"International Information Security Conference"},{"key":"e_1_3_2_1_4_1","first-page":"21","article-title":"The multiplicative complexity of Boolean functions on four and five variables,\" in Lightweight Cryptography for Security and Privacy","author":"Turan S\u00f6nmez M.","year":"2015","unstructured":"M. Turan S\u00f6nmez and R. Peralta , \" The multiplicative complexity of Boolean functions on four and five variables,\" in Lightweight Cryptography for Security and Privacy , Cham , 2015 , pp. 21 -- 33 . M. Turan S\u00f6nmez and R. Peralta, \"The multiplicative complexity of Boolean functions on four and five variables,\" in Lightweight Cryptography for Security and Privacy, Cham, 2015, pp. 21--33.","journal-title":"Cham"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00182-6"},{"key":"e_1_3_2_1_6_1","first-page":"475","article-title":"Solving circuit optimisation problems in cryptography and cryptanalysis","volume":"2011","author":"Courtois N.","year":"2011","unstructured":"N. Courtois , D. Hulme , and T. Mourouzis , \" Solving circuit optimisation problems in cryptography and cryptanalysis ,\" IACR Cryptology ePrint Archive , vol. 2011 , p. 475 , 2011 . N. Courtois, D. Hulme, and T. Mourouzis, \"Solving circuit optimisation problems in cryptography and cryptanalysis,\" IACR Cryptology ePrint Archive, vol. 2011, p. 475, 2011.","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_1_7_1","first-page":"457","article-title":"On the multiplicative complexity of Boolean functions and bitsliced higher-order masking","author":"Goudarzi D.","year":"2016","unstructured":"D. Goudarzi and M. Rivain , \" On the multiplicative complexity of Boolean functions and bitsliced higher-order masking ,\" in International Conference on Cryptographic Hardware and Embedded Systems , 2016 , pp. 457 -- 478 . D. Goudarzi and M. Rivain, \"On the multiplicative complexity of Boolean functions and bitsliced higher-order masking,\" in International Conference on Cryptographic Hardware and Embedded Systems, 2016, pp. 457--478.","journal-title":"International Conference on Cryptographic Hardware and Embedded Systems"},{"key":"e_1_3_2_1_8_1","first-page":"430","article-title":"Ciphers for MPC and FHE","author":"Albrecht M. R.","year":"2015","unstructured":"M. R. Albrecht , C. Rechberger , T. Schneider , T. Tiessen , and M. Zohner , \" Ciphers for MPC and FHE ,\" in Annual International Conference on the Theory and Applications of Cryptographic Techniques , 2015 , pp. 430 -- 454 . M. R. Albrecht, C. Rechberger, T. Schneider, T. Tiessen, and M. Zohner, \"Ciphers for MPC and FHE,\" in Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2015, pp. 430--454.","journal-title":"Annual International Conference on the Theory and Applications of Cryptographic Techniques"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133997"},{"key":"e_1_3_2_1_10_1","first-page":"1069","article-title":"Zkboo: Faster zero-knowledge for boolean circuits","author":"Giacomelli I.","year":"2016","unstructured":"I. Giacomelli , J. Madsen , and C. Orlandi , \" Zkboo: Faster zero-knowledge for boolean circuits ,\" in Security Symposium , 2016 , pp. 1069 -- 1083 . I. Giacomelli, J. Madsen, and C. Orlandi, \"Zkboo: Faster zero-knowledge for boolean circuits,\" in Security Symposium, 2016, pp. 1069--1083.","journal-title":"Security Symposium"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.32"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70583-3_40"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-012-9124-7"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14295-6_5"},{"key":"e_1_3_2_1_16_1","unstructured":"L. G. Amar\u00f9 P.-E. Gaillardon and G. De Micheli \"The EPFL combinational benchmark suite \" in Int'l Workshop on Logic and Synthesis 2015. L. G. Amar\u00f9 P.-E. Gaillardon and G. De Micheli \"The EPFL combinational benchmark suite \" in Int'l Workshop on Logic and Synthesis 2015."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2593069.2593158"},{"key":"e_1_3_2_1_18_1","first-page":"134","volume-title":"International Symposium on","author":"H\u00e1le\u010dek I.","year":"2017","unstructured":"I. H\u00e1le\u010dek , P. Fi\u0161er , and J. Schmidt , \" Are XORs in logic synthesis really necessary?\" in Design and Diagnostics of Electronic Circuits & Systems , International Symposium on , 2017 , pp. 134 -- 139 . I. H\u00e1le\u010dek, P. Fi\u0161er, and J. Schmidt, \"Are XORs in logic synthesis really necessary?\" in Design and Diagnostics of Electronic Circuits & Systems, International Symposium on, 2017, pp. 134--139."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2006.887925"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/275107.275118"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1975.224082"},{"key":"e_1_3_2_1_22_1","first-page":"121","volume-title":"Ed. Academic Press","author":"Lechner R.J.","year":"1971","unstructured":"R.J. Lechner , \"Harmonic analysis of switching functions,\" in Recent Developments in Switching Theory, A. Mukhopadhyay , Ed. Academic Press , 1971 , pp. 121 -- 228 . R.J. Lechner, \"Harmonic analysis of switching functions,\" in Recent Developments in Switching Theory, A. Mukhopadhyay, Ed. Academic Press, 1971, pp. 121--228."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054732"},{"key":"e_1_3_2_1_24_1","first-page":"198","article-title":"A spectral algorithm for ternary function classification","author":"Miller D. M.","year":"2018","unstructured":"D. M. Miller and M. Soeken , \" A spectral algorithm for ternary function classification ,\" in Int'l Symp. on Multiple-Valued Logic , 2018 , pp. 198 -- 203 . D. M. Miller and M. Soeken, \"A spectral algorithm for ternary function classification,\" in Int'l Symp. on Multiple-Valued Logic, 2018, pp. 198--203.","journal-title":"Int'l Symp. on Multiple-Valued Logic"},{"key":"e_1_3_2_1_25_1","first-page":"237","article-title":"An algorithm for linear, affine and spectral classification of Boolean functions","author":"Miller M.","year":"2018","unstructured":"M. Miller and M. Soeken , \" An algorithm for linear, affine and spectral classification of Boolean functions ,\" International Workshop on Boolean Problems , pp. 237 -- 254 , 2018 . M. Miller and M. Soeken, \"An algorithm for linear, affine and spectral classification of Boolean functions,\" International Workshop on Boolean Problems, pp. 237--254, 2018.","journal-title":"International Workshop on Boolean Problems"},{"key":"e_1_3_2_1_27_1","volume-title":"arXiv","author":"Soeken M.","year":"1805","unstructured":"M. Soeken , H. Riener , W. Haaswijk , and G. De Micheli , \"The EPFL logic synthesis libraries,\" May 2018 , arXiv : 1805 .05121. M. Soeken, H. Riener, W. Haaswijk, and G. De Micheli, \"The EPFL logic synthesis libraries,\" May 2018, arXiv:1805.05121."},{"key":"e_1_3_2_1_28_1","first-page":"354","article-title":"Combinational and sequential mapping with priority cuts","author":"Mishchenko A.","year":"2007","unstructured":"A. Mishchenko , S. Cho , S. Chatterjee , and R. K. Brayton , \" Combinational and sequential mapping with priority cuts ,\" in Int'l Conf. on Computer-Aided Design , 2007 , pp. 354 -- 361 . A. Mishchenko, S. Cho, S. Chatterjee, and R. K. Brayton, \"Combinational and sequential mapping with priority cuts,\" in Int'l Conf. on Computer-Aided Design, 2007, pp. 354--361.","journal-title":"Int'l Conf. on Computer-Aided Design"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2006.882484"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2068716.2068720"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.01.030"}],"event":{"name":"DAC '19: The 56th Annual Design Automation Conference 2019","sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEEE-CEDA","SIGBED ACM Special Interest Group on Embedded Systems"],"location":"Las Vegas NV USA","acronym":"DAC '19"},"container-title":["Proceedings of the 56th Annual Design Automation Conference 2019"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3316781.3317893","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T03:36:06Z","timestamp":1672976166000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3316781.3317893"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,2]]},"references-count":30,"alternative-id":["10.1145\/3316781.3317893","10.1145\/3316781"],"URL":"https:\/\/doi.org\/10.1145\/3316781.3317893","relation":{},"subject":[],"published":{"date-parts":[[2019,6,2]]},"assertion":[{"value":"2019-06-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}