{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:17:50Z","timestamp":1742951870703,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030305291"},{"type":"electronic","value":"9783030305307"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-30530-7_18","type":"book-chapter","created":{"date-parts":[[2019,9,9]],"date-time":"2019-09-09T13:03:55Z","timestamp":1568034235000},"page":"364-384","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Batch Binary Weierstrass"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9160-0463","authenticated-orcid":false,"given":"Billy Bob","family":"Brumley","sequence":"first","affiliation":[]},{"given":"Sohaib","family":"ul Hassan","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8420-4179","authenticated-orcid":false,"given":"Alex","family":"Shaindlin","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5172-4568","authenticated-orcid":false,"given":"Nicola","family":"Tuveri","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2142-6492","authenticated-orcid":false,"given":"Kide","family":"Vuoj\u00e4rvi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,9]]},"reference":[{"issue":"5","key":"18_CR1","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1109\/49.223883","volume":"11","author":"GB Agnew","year":"1993","unstructured":"Agnew, G.B., Mullin, R.C., Vanstone, S.A.: An implementation of elliptic curve cryptosystems over $${\\rm F}_{2^{155}}$$. IEEE J. Sel. Areas Commun. 11(5), 804\u2013813 (1993). https:\/\/doi.org\/10.1109\/49.223883","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"8","key":"18_CR2","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1109\/TC.2002.1024743","volume":"51","author":"E Al-Daoud","year":"2002","unstructured":"Al-Daoud, E., Mahmod, R., Rushdan, M., Kili\u00e7man, A.: A new addition formula for elliptic curves over $${\\rm GF}(2^n)$$. IEEE Trans. Comput. 51(8), 972\u2013975 (2002). https:\/\/doi.org\/10.1109\/TC.2002.1024743","journal-title":"IEEE Trans. Comput."},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-319-71501-8_5","volume-title":"Security, Privacy, and Applied Cryptography Engineering","author":"DF Aranha","year":"2017","unstructured":"Aranha, D.F., Azarderakhsh, R., Karabina, K.: Efficient software implementation of laddering algorithms over binary elliptic curves. In: Ali, S.S., Danger, J.-L., Eisenbarth, T. (eds.) SPACE 2017. LNCS, vol. 10662, pp. 74\u201392. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-71501-8_5"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-642-14712-8_9","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2010","author":"DF Aranha","year":"2010","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.) LATINCRYPT 2010. LNCS, vol. 6212, pp. 144\u2013161. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14712-8_9"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-642-03356-8_19","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"DJ Bernstein","year":"2009","unstructured":"Bernstein, D.J.: Batch binary Edwards. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 317\u2013336. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03356-8_19"},{"key":"18_CR6","unstructured":"Bernstein, D.J.: Optimizing linear maps modulo 2. In: SPEED-CC: Software Performance Enhancement for Encryption and Decryption and Cryptographic Compilers, Workshop Record, pp. 3\u201318 (2009). http:\/\/cr.yp.to\/papers.html#linearmod2"},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-540-85053-3_16","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2008","author":"DJ Bernstein","year":"2008","unstructured":"Bernstein, D.J., Lange, T., Rezaeian Farashahi, R.: Binary Edwards curves. In: Oswald, E., Rohatgi, P. (eds.) CHES 2008. LNCS, vol. 5154, pp. 244\u2013265. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85053-3_16"},{"key":"18_CR8","doi-asserted-by":"publisher","unstructured":"Brumley, B.B., Page, D.: Bit-sliced binary normal basis multiplication. In: Antelo, E., Hough, D., Ienne, P. (eds.) 20th IEEE Symposium on Computer Arithmetic, ARITH 2011, T\u00fcbingen, Germany, 25\u201327 July 2011, pp. 205\u2013212. IEEE Computer Society (2011). https:\/\/doi.org\/10.1109\/ARITH.2011.36","DOI":"10.1109\/ARITH.2011.36"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/978-3-642-40588-4_10","volume-title":"Security Engineering and Intelligence Informatics","author":"D C\u00e2mara","year":"2013","unstructured":"C\u00e2mara, D., Gouv\u00eaa, C.P.L., L\u00f3pez, J., Dahab, R.: Fast software polynomial multiplication on ARM processors using the NEON engine. In: Cuzzocrea, A., Kittl, C., Simos, D.E., Weippl, E., Xu, L. (eds.) CD-ARES 2013. LNCS, vol. 8128, pp. 137\u2013154. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40588-4_10"},{"issue":"3","key":"18_CR10","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s13389-017-0155-8","volume":"8","author":"M Cenk","year":"2018","unstructured":"Cenk, M.: Karatsuba-like formulae and their associated techniques. J. Cryptogr. Eng. 8(3), 259\u2013269 (2018). https:\/\/doi.org\/10.1007\/s13389-017-0155-8","journal-title":"J. Cryptogr. Eng."},{"issue":"4","key":"18_CR11","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s13389-015-0101-6","volume":"5","author":"M Cenk","year":"2015","unstructured":"Cenk, M., Hasan, M.A.: Some new results on binary polynomial multiplication. J. Cryptogr. Eng. 5(4), 289\u2013303 (2015). https:\/\/doi.org\/10.1007\/s13389-015-0101-6","journal-title":"J. Cryptogr. Eng."},{"issue":"4","key":"18_CR12","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/0196-8858(86)90023-0","volume":"7","author":"D Chudnovsky","year":"1986","unstructured":"Chudnovsky, D., Chudnovsky, G.: Sequences of numbers generated by addition in formal groups and new primality and factorization tests. Adv. Appl. Math. 7(4), 385\u2013434 (1986). https:\/\/doi.org\/10.1016\/0196-8858(86)90023-0","journal-title":"Adv. Appl. Math."},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/978-3-642-19074-2_22","volume-title":"Topics in Cryptology \u2013 CT-RSA 2011","author":"J Devigne","year":"2011","unstructured":"Devigne, J., Joye, M.: Binary Huff curves. In: Kiayias, A. (ed.) CT-RSA 2011. LNCS, vol. 6558, pp. 340\u2013355. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19074-2_22"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-319-55227-9_2","volume-title":"Arithmetic of Finite Fields","author":"RR Farashahi","year":"2016","unstructured":"Farashahi, R.R., Hosseini, S.G.: Differential addition on binary elliptic curves. In: Duquesne, S., Petkova-Nikova, S. (eds.) WAIFI 2016. LNCS, vol. 10064, pp. 21\u201335. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-55227-9_2"},{"key":"18_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-642-13013-7_15","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"RR Farashahi","year":"2010","unstructured":"Farashahi, R.R., Joye, M.: Efficient arithmetic on Hessian curves. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol. 6056, pp. 243\u2013260. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13013-7_15"},{"issue":"4","key":"18_CR16","doi-asserted-by":"publisher","first-page":"624","DOI":"10.1109\/TC.2018.2874662","volume":"68","author":"MG Find","year":"2019","unstructured":"Find, M.G., Peralta, R.: Better circuits for binary polynomial multiplication. IEEE Trans. Comput. 68(4), 624\u2013630 (2019). https:\/\/doi.org\/10.1109\/TC.2018.2874662","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"18_CR17","doi-asserted-by":"publisher","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 $${\\rm GF}(2^m)$$ using normal bases. Inf. Comput. 78(3), 171\u2013177 (1988). https:\/\/doi.org\/10.1016\/0890-5401(88)90024-7","journal-title":"Inf. Comput."},{"key":"18_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-04138-9_1","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2009","author":"E K\u00e4sper","year":"2009","unstructured":"K\u00e4sper, E., Schwabe, P.: Faster and timing-attack resistant AES-GCM. In: Clavier, C., Gaj, K. (eds.) CHES 2009. LNCS, vol. 5747, pp. 1\u201317. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04138-9_1"},{"issue":"177","key":"18_CR19","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1090\/S0025-5718-1987-0866109-5","volume":"48","author":"N Koblitz","year":"1987","unstructured":"Koblitz, N.: Elliptic curve cryptosystems. Math. Comput. 48(177), 203\u2013209 (1987)","journal-title":"Math. Comput."},{"key":"18_CR20","unstructured":"Lange, T.: A note on L\u00f3pez-Dahab coordinates. IACR Cryptology ePrint Archive 2004, 323 (2004). http:\/\/eprint.iacr.org\/2004\/323"},{"key":"18_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/3-540-48892-8_16","volume-title":"Selected Areas in Cryptography","author":"J L\u00f3pez","year":"1999","unstructured":"L\u00f3pez, J., Dahab, R.: Improved algorithms for elliptic curve arithmetic in $${\\rm GF}(2^{n})$$. In: Tavares, S., Meijer, H. (eds.) SAC 1998. LNCS, vol. 1556, pp. 201\u2013212. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48892-8_16"},{"key":"18_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/3-540-48059-5_27","volume-title":"Cryptographic Hardware and Embedded Systems","author":"J L\u00f3pez","year":"1999","unstructured":"L\u00f3pez, J., Dahab, R.: Fast multiplication on elliptic curves over $${\\rm GF}(2^{m})$$ without precomputation. In: Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 1999. LNCS, vol. 1717, pp. 316\u2013327. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48059-5_27"},{"key":"18_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-39799-X_31","volume-title":"Advances in Cryptology\u2014CRYPTO \u201985 Proceedings","author":"VS Miller","year":"1986","unstructured":"Miller, V.S.: Use of elliptic curves in cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 417\u2013426. Springer, Heidelberg (1986). https:\/\/doi.org\/10.1007\/3-540-39799-X_31"},{"issue":"177","key":"18_CR24","doi-asserted-by":"publisher","first-page":"243","DOI":"10.2307\/2007888","volume":"48","author":"PL Montgomery","year":"1987","unstructured":"Montgomery, P.L.: Speeding the pollard and elliptic curve methods of factorization. Math. Comput. 48(177), 243\u2013264 (1987). https:\/\/doi.org\/10.2307\/2007888","journal-title":"Math. Comput."},{"issue":"1","key":"18_CR25","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s13389-013-0069-z","volume":"4","author":"T Oliveira","year":"2014","unstructured":"Oliveira, T., L\u00f3pez, J., Aranha, D.F., Rodr\u00edguez-Henr\u00edquez, F.: Two is the fastest prime: lambda coordinates for binary elliptic curves. J. Cryptogr. Eng. 4(1), 3\u201317 (2014). https:\/\/doi.org\/10.1007\/s13389-013-0069-z","journal-title":"J. Cryptogr. Eng."},{"issue":"3","key":"18_CR26","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s13389-017-0163-8","volume":"8","author":"T Oliveira","year":"2018","unstructured":"Oliveira, T., L\u00f3pez, J., Rodr\u00edguez-Henr\u00edquez, F.: The Montgomery ladder on binary elliptic curves. J. Cryptogr. Eng. 8(3), 241\u2013258 (2018). https:\/\/doi.org\/10.1007\/s13389-017-0163-8","journal-title":"J. Cryptogr. Eng."},{"issue":"13","key":"18_CR27","doi-asserted-by":"publisher","first-page":"2051","DOI":"10.1002\/sec.1462","volume":"9","author":"H Seo","year":"2016","unstructured":"Seo, H., Liu, Z., Nogami, Y., Choi, J., Kim, H.: Binary field multiplication on ARMv8. Secur. Commun. Netw. 9(13), 2051\u20132058 (2016). https:\/\/doi.org\/10.1002\/sec.1462","journal-title":"Secur. Commun. Netw."},{"key":"18_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/3-540-45353-9_3","volume-title":"Topics in Cryptology\u2014CT-RSA 2001","author":"H Shacham","year":"2001","unstructured":"Shacham, H., Boneh, D.: Improving SSL handshake performance via batching. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol. 2020, pp. 28\u201343. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45353-9_3"},{"key":"18_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/3-540-36288-6_18","volume-title":"Public Key Cryptography\u2014PKC 2003","author":"M Stam","year":"2003","unstructured":"Stam, M.: On Montgomery-like representations for elliptic curves over $${\\rm GF}(2^{k})$$. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol. 2567, pp. 240\u2013254. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36288-6_18"},{"key":"18_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-3-319-69453-5_2","volume-title":"Selected Areas in Cryptography \u2013 SAC 2016","author":"D Stebila","year":"2017","unstructured":"Stebila, D., Mosca, M.: Post-quantum key exchange for the internet and the open quantum safe project. In: Avanzi, R., Heys, H. (eds.) SAC 2016. LNCS, vol. 10532, pp. 14\u201337. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-69453-5_2"},{"key":"18_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-642-23951-9_8","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2011","author":"J Taverne","year":"2011","unstructured":"Taverne, J., Faz-Hern\u00e1ndez, A., Aranha, D.F., Rodr\u00edguez-Henr\u00edquez, F., Hankerson, D., L\u00f3pez, J.: Software implementation of binary elliptic curves: impact of the carry-less multiplier on scalar multiplication. In: Preneel, B., Takagi, T. (eds.) CHES 2011. LNCS, vol. 6917, pp. 108\u2013123. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23951-9_8"},{"issue":"3","key":"18_CR32","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s13389-011-0017-8","volume":"1","author":"J Taverne","year":"2011","unstructured":"Taverne, J., Faz-Hern\u00e1ndez, A., Aranha, D.F., Rodr\u00edguez-Henr\u00edquez, F., Hankerson, D., L\u00f3pez, J.: Speeding scalar multiplication over binary elliptic curves using the new carry-less multiplication instruction. J. Cryptogr. Eng. 1(3), 187\u2013199 (2011). https:\/\/doi.org\/10.1007\/s13389-011-0017-8","journal-title":"J. Cryptogr. Eng."},{"key":"18_CR33","doi-asserted-by":"crossref","unstructured":"Tuveri, N., Brumley, B.B.: Start your ENGINEs: dynamically loadable contemporary crypto. In: IEEE Secure Development Conference, SecDev 2019, McLean, VA, USA, 25\u201327 September 2019. IEEE Computer Society (2019). https:\/\/eprint.iacr.org\/2018\/354","DOI":"10.1109\/SecDev.2019.00014"},{"key":"18_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-030-25283-0_10","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2017","author":"T Wiggers","year":"2019","unstructured":"Wiggers, T.: Energy-efficient ARM64 cluster with cryptanalytic applications. In: Lange, T., Dunkelman, O. (eds.) LATINCRYPT 2017. LNCS, vol. 11368, pp. 175\u2013188. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25283-0_10"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 LATINCRYPT 2019"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30530-7_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,23]],"date-time":"2024-07-23T00:04:15Z","timestamp":1721693055000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-30530-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030305291","9783030305307"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30530-7_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"9 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATINCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology and Information Security in Latin America","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santiago de Chile","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chile","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latincrypt2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/latincrypt2019.cryptojedi.org\/index.shtml","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"WebSubRev","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"45% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.35","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.35","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}