{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T10:17:27Z","timestamp":1779185847202,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540618720","type":"print"},{"value":"9783540707073","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/bfb0034836","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T07:32:03Z","timestamp":1134286323000},"page":"65-76","source":"Crossref","is-referenced-by-count":63,"title":["A fast software implementation for arithmetic operations in GF(2n)"],"prefix":"10.1007","author":[{"given":"Erik","family":"De Win","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antoon","family":"Bosselaers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Servaas","family":"Vandenberghe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"De Gersem","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joos","family":"Vandewalle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,26]]},"reference":[{"issue":"no.5","key":"7_CR1","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1109\/49.223883","volume":"11","author":"G.B. Agnew","year":"1993","unstructured":"G.B. Agnew, R.C. Mullin and S.A. Vanstone, \u201cAn implementation of elliptic curve cryptosystems over F 2155,\u201d IEEE Journal on Selected Areas in Communications, Vol. 11, no. 5 (June 1993), pp. 804\u2013813.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"issue":"no.8","key":"7_CR2","doi-asserted-by":"publisher","first-page":"1010","DOI":"10.1109\/12.238496","volume":"42","author":"H. Brunner","year":"1993","unstructured":"H. Brunner, A. Curiger and M. Hofstetter, \u201cOn computing multiplicative inverses in GF(2n),\u201d IEEE Transactions on Computers, Vol. 42, no. 8 (1993), pp. 1010\u20131015.","journal-title":"IEEE Transactions on Computers"},{"key":"7_CR3","unstructured":"E. De Win and P. De Gersem, Studie en implementatie van arithmetische bewerkingen in GF(2n), Master Thesis K.U.Leuven, 1995. (in Dutch)"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"G. Harper, A. Menezes and S. Vanstone, \u201cPublic-key cryptosystems with very small key lengths,\u201d Advances in Cryptology, Proc. Eurocrypt'92, LNCS 658, R.A. Rueppel, Ed., Springer-Verlag, 1993, pp. 163\u2013173.","DOI":"10.1007\/3-540-47555-9_14"},{"issue":"no.177","key":"7_CR5","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1090\/S0025-5718-1987-0866109-5","volume":"48","author":"N. Koblitz","year":"1987","unstructured":"N. Koblitz, \u201cElliptic curve cryptosystems,\u201d Mathematics of Computation, Vol. 48, no. 177 (1987), pp. 203\u2013209.","journal-title":"Mathematics of Computation"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"R. Lercier and F. Morain, \u201cCounting the number of points on elliptic curves over finite fields: strategies and performances,\u201d Advances in Cryptology, Proc. Eurocrypt'95, LNCS 921, L.C. Guillou and J.J. Quisquater, Eds., Springer-Verlag, 1995, pp. 79\u201394.","DOI":"10.1007\/3-540-49264-X_7"},{"key":"7_CR7","volume-title":"Finite fields","author":"R. Lidl","year":"1983","unstructured":"R. Lidl and H. Niederreiter, Finite fields, Addison-Wesley, Reading, Mass., 1983."},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"A. Menezes, Elliptic curve public key cryptosystems, Kluwer Academic Publishers, 1993.","DOI":"10.1007\/978-1-4615-3198-2"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"V.S.Miller, \u201cUse of elliptic curves in cryptography,\u201d Advances in Cryptology, Proc. Crypto'85, LNCS 218, H.C.Williams, Ed., Springer-Verlag, 1985, pp. 417\u2013426.","DOI":"10.1007\/3-540-39799-X_31"},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0166-218X(88)90090-X","volume":"22","author":"R. Mullin","year":"1988\/89","unstructured":"R. Mullin, I. Onyszchuk, S. Vanstone and R. Wilson, \u201cOptimal normal bases in GF(pn),\u201d Discrete Applied Mathematics, Vol. 22 (1988\/89), pp. 149\u2013161.","journal-title":"Discrete Applied Mathematics"},{"key":"7_CR11","unstructured":"A. Menezes and S. Vanstone, \u201cStandard for RSA, Diffie-Hellman and related public key cryptography,\u201d Working draft of IEEE P1363 Standard, Elliptic Curve Systems, February 15, 1996."},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","volume":"24","author":"S. Pohlig","year":"1978","unstructured":"S. Pohlig and M. Hellman, \u201cAn improved algorithm for computing logarithms over GF(p) and its cryptographic significance,\u201d IEEE Transactions on Information Theory, Vol. 24 (1978), pp. 106\u2013110.","journal-title":"IEEE Transactions on Information Theory"},{"key":"7_CR13","first-page":"483","volume":"44","author":"R. Schoof","year":"1985","unstructured":"R. Schoof, \u201cElliptic curves over finite fields and the computation of square roots mod p,\u201d Mathematics of Computation, Vol. 44 (1985), pp. 483\u2013494.","journal-title":"Mathematics of Computation"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"R. Schroeppel, H. Orman, S. O'Malley and O. Spatscheck, \u201cFast key exchange with elliptic curve systems,\u201d Advances in Cryptology, Proc. Crypto'95, LNCS 963, D. Coppersmith, Ed., Springer-Verlag, 1995, pp. 43\u201356.","DOI":"10.1007\/3-540-44750-4_4"},{"key":"7_CR15","unstructured":"S. Vandenberghe, Snelle basisbewerkingen voor publieke sleutelsystemen gebaseerd op elliptische curven over GF(2n), Master Thesis K.U.Leuven, 1996. (in Dutch)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 ASIACRYPT '96"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0034836","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T13:51:27Z","timestamp":1586613087000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0034836"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540618720","9783540707073"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0034836","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996]]}}}