{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T15:44:20Z","timestamp":1772293460813,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540428800","type":"print"},{"value":"9783540456001","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45600-7_21","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T08:21:49Z","timestamp":1186820509000},"page":"177-188","source":"Crossref","is-referenced-by-count":19,"title":["Efficient Software Implementation for Finite Field Multiplication in Normal Basis"],"prefix":"10.1007","author":[{"given":"Peng","family":"Ning","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yiqun Lisa","family":"Yin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,10,24]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"D. Ash, I. Blake, and S.A. Vanstone. Low Complexity Normal Basis. Discrete Applied Mathematics, Vol. 25, 1989.","DOI":"10.1016\/0166-218X(89)90001-2"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"E. De Win, A. Bosselaers, S. Vandenberghe, P. De Gersem, and J. Vandewalle. A fast software implementation for arithmetic operations in GF(2n). In Proc. Asiacrypt\u201996, 1996.","DOI":"10.1007\/BFb0034836"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"D. Hankerson, J.L. Hernandez, and A. Menesez. Software Implementation of Elliptic Curve Cryptography over Binary Fields. In Proc. CHES'2000, August 2000.","DOI":"10.1007\/3-540-44499-8_1"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"B. Kaliski and M. Liskov. Efficient Finite Field Basis Conversion Involvinga Dual Basis. In Proc. CHES\u201999, August 1999.","DOI":"10.1007\/3-540-48059-5_13"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"B. Kaliski and Y.L. Yin. Storage Efficient Finite Field Basis Conversion. In Proc. SAC\u201998, August 1998.","DOI":"10.1007\/3-540-48892-8_7"},{"key":"21_CR6","unstructured":"R.J. Lambert and A. Vadekar. Method and apparatus for finite field multiplication. US Patent 6,049,815, April 2000."},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"J. Lopez and R. Dahab. High-Speed software multiplication in F(2m). Technical report, IC-00-09, May 2000. Available at http:\/\/www.dcc.unicamp.br\/ic-main\/publications-e.html .","DOI":"10.1007\/3-540-44495-5_18"},{"key":"21_CR8","unstructured":"J. L. Massey and J. K. Omura. Computational method and apparatus for finite field arithmetic. U.S. Patent 4,587,627, May 1986."},{"key":"21_CR9","unstructured":"R.C. Mullin. Multiple Bit Multiplier. U.S. Patent 5,787,028, July 1998."},{"key":"21_CR10","unstructured":"R.C. Mullin, I.M. Onyszchuk, and S.A. Vanstone. Computational Method and Apparatus for Finite Field Multiplication. U.S. Patent 4,745,568, May 1988."},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"R.C. Mullin, I.M. Onyszchuk, S.A. Vanstone, and R. Wilson Optimal Normal Basis in GF(pm). Discrete Applied Mathematics, Vol. 22, 1988\/1989.","DOI":"10.1016\/0166-218X(88)90090-X"},{"key":"21_CR12","unstructured":"P. Ning and Y. L. Yin. Efficient Software Implementation for Finite Field Multiplication in Normal Basis. Pending US Patent Application. Provisional patent application filed in December 1997."},{"key":"21_CR13","unstructured":"M. Rosing. ImplementingEl liptic Curve Cryptography. Manning Publications Co., 1999."},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"A. Reyhani-Masoleh, M. A. Hasan. Fast Normal Basis Multiplication UsingGeneral Purpose Processors. To appear in the 8th Workshop on Selected Areas in Cryptography (SAC 2001). August 2001.","DOI":"10.1007\/3-540-45537-X_18"},{"key":"21_CR15","unstructured":"National Institute of Standards and Technology, Digital Signature Standard, FIPS Publication 186-2, February 2000."}],"container-title":["Lecture Notes in Computer Science","Information and Communications Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45600-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T19:20:50Z","timestamp":1556738450000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45600-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540428800","9783540456001"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-45600-7_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}