{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:17:47Z","timestamp":1725549467589},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540284741"},{"type":"electronic","value":"9783540319405"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11545262_18","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T14:35:35Z","timestamp":1127831735000},"page":"237-249","source":"Crossref","is-referenced-by-count":2,"title":["Comparison of Bit and Word Level Algorithms for Evaluating Unstructured Functions over Finite Rings"],"prefix":"10.1007","author":[{"given":"B.","family":"Sunar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Cyganski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/B978-0-12-417750-5.50008-7","volume-title":"Proceedings of an International Symposium on the Theory of Machines and Computations","author":"A. Borodin","year":"1971","unstructured":"Borodin, A.: Horners Rule is Uniquely Optimal. In: Kohavi, Z., Paz, A. (eds.) Proceedings of an International Symposium on the Theory of Machines and Computations, pp. 45\u201357. Academic Press, London (1971)"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/BF02124750","volume":"5","author":"R.M. Corless","year":"1996","unstructured":"Corless, R.M., Gonnet, G.H., Hare, D.E.G., Jeffrey, D.J., Knuth, D.E.: On the Lambert W Function. Advances in Computational Mathematics\u00a05, 329\u2013359 (1996)","journal-title":"Advances in Computational Mathematics"},{"key":"18_CR3","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1098\/rstl.1819.0023","volume":"109","author":"W.G. Horner","year":"1819","unstructured":"Horner, W.G.: A new method of solving numerical equations of all orders by continuous approximation. Philos. Trans. Roy. Soc. London\u00a0109, 308\u2013335 (1819)","journal-title":"Philos. Trans. Roy. Soc. London"},{"key":"18_CR4","series-title":"Seminumerical Algorithms","volume-title":"The Art of Computer Programming","author":"D.E. Knuth","year":"1981","unstructured":"Knuth, D.E.: The Art of Computer Programming, 2nd edn. Seminumerical Algorithms, vol.\u00a02. Addison-Wesley, Reading (1981)","edition":"2"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Muller, D.E.: Complexity in Electronic Switching Circuits. IRE Transactions on Electronic Circuits\u00a0(5), 15\u201319 (1956)","DOI":"10.1109\/TEC.1956.5219786"},{"key":"18_CR6","unstructured":"NIST FIPS PUB 180-1. Secure Hash Standard. Federal Information Processing Standards, National Bureau of Standards, U.S. Department of Commerce (April 1995)"},{"key":"18_CR7","unstructured":"NIST FIPS PUB 46-3. Data Encryption Standard. Federal Information Processing Standards, National Bureau of Standards, U.S. Department of Commerce (1977)"},{"key":"18_CR8","unstructured":"U.S.\u00a0Department of\u00a0Commerce\/National Institute\u00a0of Standard and Technology. Advanced Encryption Standard (AES) (November 2001)"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Ostrowski, A.M.: On two problems in abstract algebra connected with Horner\u2019s rule, pp. 40\u201348. Academic Press, London (1954); presented to Richard von Mises","DOI":"10.1016\/B978-1-4832-3272-0.50010-7"},{"issue":"1","key":"18_CR10","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1070\/RM1966v021n01ABEH004147","volume":"21","author":"V.Y. Pan","year":"1966","unstructured":"Pan, V.Y.: Methods for Computing Values of Polynomials. Russian Mathematical Surveys\u00a021(1), 105\u2013136 (1966)","journal-title":"Russian Mathematical Surveys"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Rivest, R.L.: RFC 1321: The MD5 Message-Digest Algorithm. Corporation for National Research Initiatives, Internet Engineering Task Force, Network Working Group (April 1992)","DOI":"10.17487\/rfc1321"},{"issue":"1","key":"18_CR12","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 Technical Journal\u00a028(1), 59\u201398 (1949)","journal-title":"Bell System Technical Journal"},{"key":"18_CR13","unstructured":"ETSI\/SAGE Specification. Specification of the 3GPP confidentiality and integrity algorithms; part 2: KASUMI specification. 3GPP TS 35.202, European Telecommunications Standards Institute, Sophia-Antipolis Cedex, France (November 1999) (Draft)"}],"container-title":["Lecture Notes in Computer Science","Cryptographic Hardware and Embedded Systems \u2013 CHES 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11545262_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:18:39Z","timestamp":1605644319000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11545262_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540284741","9783540319405"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11545262_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}