{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,26]],"date-time":"2024-03-26T12:20:10Z","timestamp":1711455610243},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,2,14]],"date-time":"2015-02-14T00:00:00Z","timestamp":1423872000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptogr Eng"],"published-print":{"date-parts":[[2015,9]]},"DOI":"10.1007\/s13389-015-0094-1","type":"journal-article","created":{"date-parts":[[2015,2,17]],"date-time":"2015-02-17T09:34:41Z","timestamp":1424165681000},"page":"215-226","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Fast software implementation of binary elliptic curve cryptography"],"prefix":"10.1007","volume":"5","author":[{"given":"Manuel","family":"Bluhm","sequence":"first","affiliation":[]},{"given":"Shay","family":"Gueron","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,2,14]]},"reference":[{"key":"94_CR1","unstructured":"Aranha, D.F., Faz-Hern\u00e0ndez, A., L\u00f2pez, J., Rodr\u00ecguez-Henr\u00ecquez, F.: Faster implementation of scalar multiplication on Koblitz curves. In: Cryptology ePrint Archive, Report 2012\/519 (2012). http:\/\/eprint.iacr.org\/2012\/519.pdf . Accessed 17 Jul 2014"},{"key":"94_CR2","doi-asserted-by":"crossref","unstructured":"Aranha, D.F., L\u00f3pez, J., Hankerson, D.: Efficient software implementation of binary field arithmetic using vector instruction sets. In: Abdalla, M., Barreto, P.S.L.M. (eds.) The First International Conference on Cryptology and Information Security (LATINCRYPT 2010), LNCS, vol. 6212, pp. 144\u2013161 (2010)","DOI":"10.1007\/978-3-642-14712-8_9"},{"key":"94_CR3","unstructured":"Bluhm, M., Gueron, S.: A fast vectorized implementation of binary elliptic curves on x86-64 processors (2013). http:\/\/rt.openssl.org\/Ticket\/Display.html?id=3117 . Accessed 17 Jul 2014"},{"key":"94_CR4","unstructured":"Bos, J.W., Costello, C., Hisil, H., Lauter, K.: Fast cryptography in Genus 2. In: Cryptology ePrint Archive, Report 2012\/670 (2012). http:\/\/eprint.iacr.org\/2012\/670.pdf . Accessed 17 Jul 2014"},{"key":"94_CR5","unstructured":"Brumley, B.B., Tuveri, N.: Remote timing attacks are still practical. In: Cryptology ePrint Archive, Report 2011\/232 (2011). http:\/\/eprint.iacr.org\/2011\/232.pdf . Accessed 17 Jul 2014"},{"key":"94_CR6","unstructured":"Ecrypt, II and VAMPIRE, eBACS: ECRYPT benchmarking of cryptographic systems (2014). http:\/\/bench.cr.yp.to\/ . Accessed 17 Jul 2014"},{"key":"94_CR7","doi-asserted-by":"crossref","unstructured":"Fouque, P.-A., R\u00e9al, D., Valette, F., Drissi, M.: The carry leakage on the randomized exponent countermeasure, in cryptographic hardware and embedded systems\u2014CHES 2008. In: Oswald, E., Rohatgi, P. (eds.) Lecture Notes in Computer Science, vol. 5154, pp. 198\u2013213. Springer, Berlin (2008)","DOI":"10.1007\/978-3-540-85053-3_13"},{"key":"94_CR8","unstructured":"Gueron, S., Kounavis, M.: Intel Carry-Less Multiplication Instruction and Its Usage for Computing the GCM Mode (2008). http:\/\/software.intel.com\/sites\/default\/files\/article\/165685\/clmul-wp-rev-2.01-2012-09-21.pdf . Accessed 17 Jul 2014"},{"key":"94_CR9","unstructured":"Gueron, S., Krasnov, V.: Parallelizing message schedules to accelerate the computations of hash functions. In: Cryptology ePrint Archive, Report 2012\/067 (2012). http:\/\/eprint.iacr.org\/2012\/067.pdf . Accessed 17 Jul 2014"},{"key":"94_CR10","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(2 $$^{m}$$ m ) using normal bases. Inf. Comput. 78, 171\u2013177 (1988)","journal-title":"Inf. Comput."},{"key":"94_CR11","unstructured":"Jankowski, K., Laurent, P., O\u2019Mahony, A.: Intel Polynomial Multiplication Instruction and Its Usage for Elliptic Curve Cryptography (2012). http:\/\/www.intel.com\/content\/dam\/www\/public\/us\/en\/documents\/white-papers\/polynomial-multiplication-instructions-paper.pdf . Accessed 17 Jul 2014"},{"key":"94_CR12","doi-asserted-by":"crossref","unstructured":"Kne\u017eevi\u0107, M., Sakiyama, K., Fan, J., Verbauwhede, I.: Modular reduction in GF(2 $$^{n}$$ n ) without pre-computational phase. In: Proceedings of the 2nd International Workshop on Arithmetic of Finite Fields, WAIFI \u201908, pp. 77\u201387. Springer-Verlag, Berlin (2008)","DOI":"10.1007\/978-3-540-69499-1_7"},{"key":"94_CR13","doi-asserted-by":"crossref","unstructured":"L\u00f2pez, J., Dahab, R.: Fast multiplication on elliptic curves over GF(2 $$^{m}$$ m ) without precomputation. In: Koc, C.K., Paar, C. (eds.) Cryptographic Hardware and Embedded Systems. Lecture Notes in Computer Science, vol. 1717, pp. 316\u2013327. Springer, Berlin (1999)","DOI":"10.1007\/3-540-48059-5_27"},{"key":"94_CR14","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1090\/S0025-5718-1987-0866113-7","volume":"48","author":"PL Montgomery","year":"1987","unstructured":"Montgomery, P.L.: Speeding the pollard and elliptic curve methods of factorization. Math. Comput. 48, 243\u2013264 (1987)","journal-title":"Math. Comput."},{"key":"94_CR15","unstructured":"Oliveira, T., Aranha, D.F., L\u00f2pez, J., Rodr\u00ecguez-Henr\u00ecquez, F.: Fast point multiplication algorithms for binary elliptic curves with and without precomputation. In: Cryptology ePrint Archive, Report 2014\/427 (2014). http:\/\/eprint.iacr.org\/2014\/427.pdf . Accessed 17 Jul 2014"},{"key":"94_CR16","unstructured":"Oliveira, T., L\u00f2pez, J., Aranha, D.F., Rodr\u00ecguez-Henr\u00ecquez, F.: Two is the fastest prime. In: Cryptology ePrint Archive, Report 2013\/131 (2013). http:\/\/eprint.iacr.org\/2013\/131.pdf . Accessed 17 Jul 2014"},{"key":"94_CR17","doi-asserted-by":"crossref","unstructured":"Stam, M.: On montgomery-like representations for elliptic curves over GF( $$2^k$$ 2 k ). In: Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography, PKC \u201903, London, pp. 240\u2013253. Springer-Verlag, New York (2003)","DOI":"10.1007\/3-540-36288-6_18"},{"key":"94_CR18","unstructured":"Standards for Efficient Cryptography Group, SEC 2: Recommended Elliptic Curve Domain Parameters (2010). http:\/\/www.secg.org\/download\/aid-784\/sec2-v2.pdf . Accessed 17 Jul 2014"},{"key":"94_CR19","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1016\/j.ipl.2012.03.012","volume":"112","author":"C Su","year":"2012","unstructured":"Su, C., Fan, H.: Impact of Intel\u2019s new instruction sets on software implementation of GF(2) $$[x]$$ [ x ] multiplication. Inf. Process. Lett. 112, 497\u2013502 (2012)","journal-title":"Inf. Process. Lett."},{"key":"94_CR20","doi-asserted-by":"crossref","unstructured":"Taverne, J., Faz-Hern\u00e0ndez, A., Aranha, D.F., Rodr\u00ecguez-Henr\u00ecquez, F., Hankerson, D., L\u00f2pez, J.: Speeding scalar multiplication over binary elliptic curves using the new carry-less multiplication instruction. J. Cryptogr. Eng. 1, 187\u2013199 (2011)","DOI":"10.1007\/s13389-011-0017-8"},{"key":"94_CR21","doi-asserted-by":"crossref","unstructured":"Weber, D., Denny, T.: The solution of McCurley\u2019s discrete log challenge. In: Krawczyk, H. (ed.) Advances in Cryptology\u2014CRYPTO \u201998. Lecture Notes in Computer Science, vol. 1462, pp. 458\u2013471. Springer, Berlin (1998)","DOI":"10.1007\/BFb0055747"}],"container-title":["Journal of Cryptographic Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-015-0094-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13389-015-0094-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-015-0094-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T00:12:51Z","timestamp":1566346371000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13389-015-0094-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,14]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,9]]}},"alternative-id":["94"],"URL":"https:\/\/doi.org\/10.1007\/s13389-015-0094-1","relation":{},"ISSN":["2190-8508","2190-8516"],"issn-type":[{"value":"2190-8508","type":"print"},{"value":"2190-8516","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,14]]}}}