{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T16:07:45Z","timestamp":1778256465618,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642131929","type":"print"},{"value":"9783642131936","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13193-6_16","type":"book-chapter","created":{"date-parts":[[2010,4,27]],"date-time":"2010-04-27T11:54:59Z","timestamp":1272369299000},"page":"178-189","source":"Crossref","is-referenced-by-count":94,"title":["A New Combinational Logic Minimization Technique with Applications to Cryptology"],"prefix":"10.1007","author":[{"given":"Joan","family":"Boyar","sequence":"first","affiliation":[]},{"given":"Ren\u00e9","family":"Peralta","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-540-85238-4_13","volume-title":"Mathematical Foundations of Computer Science 2008","author":"J. Boyar","year":"2008","unstructured":"Boyar, J., Matthews, P., Peralta, R.: On the shortest linear straight-line program for computing linear forms. In: Ochma\u0144ski, E., Tyszkiewicz, J. (eds.) MFCS 2008. LNCS, vol.\u00a05162, pp. 168\u2013179. Springer, Heidelberg (2008)"},{"issue":"1-3","key":"16_CR2","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/j.tcs.2008.01.030","volume":"396","author":"J. Boyar","year":"2008","unstructured":"Boyar, J., Peralta, R.: Tight bounds for the multiplicative complexity of symmetric functions. Theoretical Computer Science\u00a0396(1-3), 223\u2013246 (2008)","journal-title":"Theoretical Computer Science"},{"key":"16_CR3","unstructured":"Boyar, J., Peralta, R.: New logic minimization techniques with applications to cryptology. Cryptology ePrint Archive, Report 2009\/191 (2009), http:\/\/eprint.iacr.org\/"},{"key":"16_CR4","unstructured":"Boyar, J., Peralta, R.: Patent application number 61089998 filed with the U.S. Patent and Trademark Office. In: A new technique for combinational circuit optimization and a new circuit for the S-Box for AES (2009)"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Canright, D.: A very compact Rijndael S-box. Technical Report NPS-MA-05-001, Naval Postgraduate School (2005)","DOI":"10.21236\/ADA434781"},{"key":"16_CR6","unstructured":"FIPS. Advanced Encryption Standard (AES). National Institute of Standards and Technology (2001)"},{"issue":"3","key":"16_CR7","doi-asserted-by":"crossref","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(2m) using normal bases. Inf. Comput. 78(3), 171\u2013177 (1988)","journal-title":"Inf. Comput."},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-04138-9_1","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2009","author":"E. K\u00e4sper","year":"2009","unstructured":"K\u00e4sper, E., Schwabe, P.: Faster and timing-attack resistant AES-GCM. In: Clavier, C., Gaj, K. (eds.) CHES 2009. LNCS, vol.\u00a05747, pp. 1\u201317. Springer, Heidelberg (2009)"},{"key":"16_CR9","unstructured":"Mastrovito, E.: VLSI architectures for computation in Galois fields. PhD thesis, Link\u00f6ping University, Dept. Electr. Eng., Sweden (1991)"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Paar, C.: Some remarks on efficient inversion in finite fields. In: 1995 IEEE International Symposium on Information Theory, Whistler, B.C. Canada, p. 58 (1995)","DOI":"10.1109\/ISIT.1995.531160"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Paar, C.: Optimized arithmetic for Reed-Solomon encoders. In: IEEE International Symposium on Information Theory, p. 250 (1997)","DOI":"10.1109\/ISIT.1997.613165"},{"key":"16_CR12","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)"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13193-6_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:02:32Z","timestamp":1606186952000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13193-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131929","9783642131936"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13193-6_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}