{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:51:56Z","timestamp":1740099116248,"version":"3.37.3"},"publisher-location":"Cham","reference-count":8,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319935539"},{"type":"electronic","value":"9783319935546"}],"license":[{"start":{"date-parts":[[2018,6,8]],"date-time":"2018-06-08T00:00:00Z","timestamp":1528416000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-319-93554-6_51","type":"book-chapter","created":{"date-parts":[[2018,6,7]],"date-time":"2018-06-07T10:15:20Z","timestamp":1528366520000},"page":"537-539","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Current Status on Elliptic Curve Discrete Logarithm Problem"],"prefix":"10.1007","author":[{"given":"Maki","family":"Inui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tetsuya","family":"Izu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,8]]},"reference":[{"key":"51_CR1","unstructured":"Bailey, D.V., Batina, L., Bernstein, D.J., et al.: Breaking ECC2K-130, IACR Cryptology ePrint Archive, 2009\/541 (2009)"},{"key":"51_CR2","unstructured":"Bernstein, D.J., Engels, S., Lange, T., et al.: Faster discrete logarithms on FPGAs, IACR Cryptology ePrint Archive, 2016\/382 (2016)"},{"key":"51_CR3","doi-asserted-by":"crossref","unstructured":"Bos, J.W., Kaihara, M.E., Kleinjung, T., et al.: Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction. IJACT 2(3), 212\u2013228 (2012)","DOI":"10.1504\/IJACT.2012.045590"},{"key":"51_CR4","unstructured":"Certicom, Certicom ECC Challenge, 10 November 2009. https:\/\/www.certicom.com\/images\/pdfs\/challenge-2009.pdf"},{"key":"51_CR5","unstructured":"Standards for Efficient Cryptography Group, SEC 2: Recommended Elliptic Curve Domain Parameters (2010). http:\/\/www.secg.org\/sec2-v2.pdf"},{"key":"51_CR6","doi-asserted-by":"crossref","unstructured":"Wenger, E., Wolfger, P.: Solving the discrete logarithm of a 113-bit Kobilitz curve with an FPGA cluster. In: SAC 2014, LNCS 8781, pp. 363\u2013379. Springer, Berlin (2014)","DOI":"10.1007\/978-3-319-13051-4_22"},{"key":"51_CR7","doi-asserted-by":"crossref","unstructured":"Wenger, E., Wolfger, P.: Harder, better, faster, stronger - elliptic curve discrete logarithm computation on FPGAs. J. Cryptographic Eng. 6(4), 287\u2013297 (2016)","DOI":"10.1007\/s13389-015-0108-z"},{"key":"51_CR8","doi-asserted-by":"crossref","unstructured":"Yasuda, M., Shimoyama, T., Kogure, J., Izu, T.: Computational hardness of IFP and ECDLP. In: Applicable Algebra in Engineering, Communication and Computing (AAECC), 09 April 2016","DOI":"10.1007\/s00200-016-0291-x"}],"container-title":["Advances in Intelligent Systems and Computing","Innovative Mobile and Internet Services in Ubiquitous Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-93554-6_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,19]],"date-time":"2019-10-19T01:48:00Z","timestamp":1571449680000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-93554-6_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,8]]},"ISBN":["9783319935539","9783319935546"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-93554-6_51","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2018,6,8]]}}}