{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T12:04:23Z","timestamp":1742385863255},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540462507"},{"type":"electronic","value":"9783540462514"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11889700_18","type":"book-chapter","created":{"date-parts":[[2006,10,9]],"date-time":"2006-10-09T10:13:18Z","timestamp":1160388798000},"page":"196-210","source":"Crossref","is-referenced-by-count":20,"title":["Robust Finite Field Arithmetic for Fault-Tolerant Public-Key Cryptography"],"prefix":"10.1007","author":[{"given":"Gunnar","family":"Gaubatz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Berk","family":"Sunar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/3-540-69053-0_4","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"D. Boneh","year":"1997","unstructured":"Boneh, D., DeMillo, R., Lipton, R.: On the importance of checking cryptographic protocols for faults. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 37\u201351. Springer, Heidelberg (1997)"},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/3-540-36400-5_37","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2002","author":"A. Reyhani-Masoleh","year":"2003","unstructured":"Reyhani-Masoleh, A., Hasan, M.: Error detection in polynomial basis multipliers over binary extension fields. In: Kaliski Jr., B.S., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2002. LNCS, vol.\u00a02523, pp. 515\u2013528. Springer, Heidelberg (2003)"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1145\/1015047.1015054","volume":"3","author":"A. Reyhani-Masoleh","year":"2004","unstructured":"Reyhani-Masoleh, A., Hasan, M.: Towards fault-tolerant cryptographic computations over finite fields. ACM Transactions on Embedded Computing Systems\u00a03, 593\u2013613 (2004)","journal-title":"ACM Transactions on Embedded Computing Systems"},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"1306","DOI":"10.1109\/TC.2002.1047755","volume":"51","author":"H. Wu","year":"2002","unstructured":"Wu, H., Hasan, M., Blake, I., Gao, S.: Finite field multiplier using redundant representation. IEEE Transactions on Computers\u00a051, 1306\u20131316 (2002)","journal-title":"IEEE Transactions on Computers"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/3-540-46766-1_26","volume-title":"Advances in Cryptology - CRYPTO 1991","author":"C. Walter","year":"1992","unstructured":"Walter, C.: Faster modular multiplication by operand scaling. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 313\u2013323. Springer, Heidelberg (1992)"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-540-28632-5_7","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2004","author":"E. \u00d6zt\u00fcrk","year":"2004","unstructured":"\u00d6zt\u00fcrk, E., Sunar, B., Sava\u015f, E.: Low-power elliptic curve cryptography using scaled modular arithmetic. In: Joye, M., Quisquater, J.-J. (eds.) CHES 2004. LNCS, vol.\u00a03156, pp. 92\u2013106. Springer, Heidelberg (2004)"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s00145-001-0011-x","volume":"15","author":"P. Gaudry","year":"2002","unstructured":"Gaudry, P., Hess, F., Smart, N.P.: Constructive and destructive facets of weil descent on elliptic curves. Journal of Cryptology\u00a015, 19\u201346 (2002)","journal-title":"Journal of Cryptology"},{"key":"18_CR8","volume-title":"Computer Arithmetic: Algorithms and Hardware Designs","author":"B. Parhami","year":"2000","unstructured":"Parhami, B.: Computer Arithmetic: Algorithms and Hardware Designs. Oxford University Press, Oxford (2000)"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/3-540-36400-5_2","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2002","author":"S. Skorobogatov","year":"2003","unstructured":"Skorobogatov, S., Anderson, R.: Optical fault induction attacks. In: Kaliski Jr., B.S., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2002. LNCS, vol.\u00a02523, pp. 2\u201312. Springer, Heidelberg (2003)"},{"key":"18_CR10","unstructured":"Proudler, I.: Idempotent AN codes. In: IEE Colloquium on Signal Processing Applications of Finite Field Mathematics, London, IEE, pp. 8\/1\u20138\/5 (1989)"}],"container-title":["Lecture Notes in Computer Science","Fault Diagnosis and Tolerance in Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11889700_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:31:22Z","timestamp":1619494282000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11889700_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540462507","9783540462514"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11889700_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}