{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T08:50:28Z","timestamp":1770886228819,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642304354","type":"print"},{"value":"9783642304361","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30436-1_24","type":"book-chapter","created":{"date-parts":[[2012,6,5]],"date-time":"2012-06-05T16:20:29Z","timestamp":1338913229000},"page":"287-298","source":"Crossref","is-referenced-by-count":75,"title":["A Small Depth-16 Circuit for the AES S-Box"],"prefix":"10.1007","author":[{"given":"Joan","family":"Boyar","sequence":"first","affiliation":[]},{"given":"Ren\u00e9","family":"Peralta","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-642-13193-6_16","volume-title":"Experimental Algorithms","author":"J. Boyar","year":"2010","unstructured":"Boyar, J., Peralta, R.: A New Combinational Logic Minimization Technique with Applications to Cryptology. In: Festa, P. (ed.) SEA 2010. LNCS, vol.\u00a06049, pp. 178\u2013189. Springer, Heidelberg (2010)"},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0304-3975(99)00182-6","volume":"235","author":"J. Boyar","year":"2000","unstructured":"Boyar, J., Peralta, R., Pochuev, D.: On the multiplicative complexity of Boolean functions over the basis (\u2009\u2227\u2009,\u2009\u2295\u2009, 1). Theoretical Computer Science\u00a0235, 43\u201357 (2000)","journal-title":"Theoretical Computer Science"},{"key":"24_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/11545262_32","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2005","author":"D. Canright","year":"2005","unstructured":"Canright, D.: A Very Compact S-Box for AES. In: Rao, J.R., Sunar, B. (eds.) CHES 2005. LNCS, vol.\u00a03659, pp. 441\u2013455. Springer, Heidelberg (2005)"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Canright, D.: A very compact Rijndael S-box. Tech. Rep. NPS-MA-05-001, Naval Postgraduate School (2005)","DOI":"10.21236\/ADA434781"},{"key":"24_CR5","unstructured":"Courtois, N., Hulme, D., Mourouzis, T.: Solving circuit optimisation problems in cryptography and cryptanalysis. IACR Cryptology ePrint Archive 2011, 475 (2011)"},{"key":"24_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-642-14186-7_8","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2010","author":"C. Fuhs","year":"2010","unstructured":"Fuhs, C., Schneider-Kamp, P.: Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT. In: Strichman, O., Szeider, S. (eds.) SAT 2010. LNCS, vol.\u00a06175, pp. 71\u201384. Springer, Heidelberg (2010)"},{"key":"24_CR7","unstructured":"Fuhs, C., Schneider-Kamp, P.: Optimizing the AES S-Box using SAT. In: Proceedings of the 8th International Workshop on the Implementation of Logics (2010)"},{"issue":"3","key":"24_CR8","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0890-5401(88)90024-7","volume":"78","author":"T. Itoh","year":"1988","unstructured":"Itoh, T., Tsujii, S.: A fast algorithm for computing multiplicative inverses in GF(2 m ) using normal bases. Inf. Comput.\u00a078(3), 171\u2013177 (1988)","journal-title":"Inf. Comput."},{"key":"24_CR9","first-page":"120","volume":"1","author":"O.B. Lupanov","year":"1958","unstructured":"Lupanov, O.B.: A method of circuit synthesis. Izvestia V.U.Z. Radiofizika\u00a01, 120\u2013140 (1958)","journal-title":"Izvestia V.U.Z. Radiofizika"},{"key":"24_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/3-540-36400-5_14","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2002","author":"S. Morioka","year":"2003","unstructured":"Morioka, S., Satoh, A.: An Optimized S-Box Circuit Architecture for Low Power AES Design. In: Kaliski Jr., B.S., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2002. LNCS, vol.\u00a02523, pp. 172\u2013186. Springer, Heidelberg (2003)"},{"key":"24_CR11","unstructured":"NIST: Advanced Encryption Standard (AES) (FIPS PUB 197). National Institute of Standards and Technology (November 2001)"},{"key":"24_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-642-15031-9_16","volume-title":"Cryptographic Hardware and Embedded Systems, CHES 2010","author":"Y. Nogami","year":"2010","unstructured":"Nogami, Y., Nekado, K., Toyota, T., Hongo, N., Morikawa, Y.: Mixed Bases for Efficient Inversion in $\\mathbb{F}(((2^2)^2)^2)$ and Conversion Matrices of Subbytes of AES. In: Mangard, S., Standaert, F.-X. (eds.) CHES 2010. LNCS, vol.\u00a06225, pp. 234\u2013247. Springer, Heidelberg (2010)"},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"Paar, C.: Some remarks on efficient inversion in finite fields. In: 1995 IEEE International Symposium on Information Theory, p. 58 (1995)","DOI":"10.1109\/ISIT.1995.531160"},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"Paar, C.: Optimized arithmetic for Reed-Solomon encoders. In: 1997 IEEE International Symposium on Information Theory, p. 250 (1997)","DOI":"10.1109\/ISIT.1997.613165"},{"key":"24_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/3-540-45682-1_15","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"A. Satoh","year":"2001","unstructured":"Satoh, A., Morioka, S., Takano, K., Munetoh, S.: A Compact Rijndael Hardware Architecture with S-Box Optimization. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 239\u2013254. Springer, Heidelberg (2001)"},{"key":"24_CR16","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/j.1538-7305.1949.tb03624.x","volume":"28","author":"C.E. Shannon","year":"1949","unstructured":"Shannon, C.E.: The synthesis of two-terminal switching circuits. Bell System Tech. J.\u00a028, 59\u201398 (1949)","journal-title":"Bell System Tech. J."}],"container-title":["IFIP Advances in Information and Communication Technology","Information Security and Privacy Research"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30436-1_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,29]],"date-time":"2025-03-29T10:09:15Z","timestamp":1743242955000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30436-1_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642304354","9783642304361"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30436-1_24","relation":{},"ISSN":["1868-4238","1861-2288"],"issn-type":[{"value":"1868-4238","type":"print"},{"value":"1861-2288","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}