{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T08:04:45Z","timestamp":1771661085163,"version":"3.50.1"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030801281","type":"print"},{"value":"9783030801298","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-80129-8_61","type":"book-chapter","created":{"date-parts":[[2021,7,5]],"date-time":"2021-07-05T09:04:22Z","timestamp":1625475862000},"page":"923-932","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Elliptic Curves of Nearly Prime Order"],"prefix":"10.1007","author":[{"given":"Daniele","family":"Di Tullio","sequence":"first","affiliation":[]},{"given":"Manoj","family":"Gyawali","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"61_CR1","doi-asserted-by":"publisher","first-page":"2161","DOI":"10.1090\/S0025-5718-07-01980-1","volume":"76","author":"R Broker","year":"2007","unstructured":"Broker, R., Stevenhagen, P.: Efficient CM-construction of elliptic curves over finite field. Math. Comput. 76, 2161\u20132179 (2007)","journal-title":"Math. Comput."},{"key":"61_CR2","first-page":"865","volume":"62","author":"G Frey","year":"1994","unstructured":"Frey, G., R\u00fcck, H.: A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves. Math. Comput. 62, 865\u2013874 (1994)","journal-title":"Math. Comput."},{"key":"61_CR3","doi-asserted-by":"publisher","unstructured":"Hoffstein, J., Pipher, J., Silverman, J.H.: An Introduction to Mathematical Cryptography. UTM. Springer, New York (2014). https:\/\/doi.org\/10.1007\/978-1-4939-1711-2","DOI":"10.1007\/978-1-4939-1711-2"},{"key":"61_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-540-24582-7_23","volume-title":"Progress in Cryptology - INDOCRYPT 2003","author":"E Konstantinou","year":"2003","unstructured":"Konstantinou, E., Stamatiou, Y.C., Zaroliagis, C.: On the construction of prime order elliptic curves. In: Johansson, T., Maitra, S. (eds.) INDOCRYPT 2003. LNCS, vol. 2904, pp. 309\u2013322. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-24582-7_23"},{"key":"61_CR5","doi-asserted-by":"publisher","unstructured":"Lemmermeyer, F.: Receprocity Laws. Springer Monographs in Mathematics. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/978-3-662-12893-0","DOI":"10.1007\/978-3-662-12893-0"},{"key":"61_CR6","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1109\/18.259647","volume":"39","author":"AJ Menezes","year":"1993","unstructured":"Menezes, A.J., Okamoto, T., Vanstone, S.: Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Trans. Inf. Theory 39, 639\u20131646 (1993)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"61_CR7","unstructured":"Narayanan, S., Corwin, D.: Improving the Speed and Accuracy of the Miller-Rabin Primality Test (2015)"},{"key":"61_CR8","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","volume":"24","author":"S Pohlig","year":"1978","unstructured":"Pohlig, S., Hellman, M.: An improved algorithm for computing logarithm over GF($$p$$) and its cryptographic significance (Corresp.). IEEE Trans. Inf. Theory 24, 106\u2013110 (1978)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"61_CR9","first-page":"918","volume":"32","author":"J Pollard","year":"1978","unstructured":"Pollard, J.: Monte Carlo methods for index computation mod $$p$$. Math. Comput. 32, 918\u2013924 (1978)","journal-title":"Math. Comput."},{"key":"61_CR10","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/0022-314X(80)90084-0","volume":"12","author":"MO Rabin","year":"1980","unstructured":"Rabin, M.O.: Probabilistic algorithm for testing primality. J. Number Theory 12, 128\u2013138 (1980)","journal-title":"J. Number Theory"},{"key":"61_CR11","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1090\/S0025-5718-09-02266-2","volume":"79","author":"K Rubin","year":"2010","unstructured":"Rubin, K., Silverberg, A.: Choosing the correct elliptic curve in the CM method. Math. Comput. 79, 545\u2013561 (2010)","journal-title":"Math. Comput."},{"key":"61_CR12","first-page":"81","volume":"47","author":"T Satoh","year":"1998","unstructured":"Satoh, T., Kiyomichi, A.: Fermat quotients and the polynomial time discrete log algorithm for anomalous elliptic curves. Commentarii Math. Univ. St. Pauli. 47, 81\u201392 (1998)","journal-title":"Commentarii Math. Univ. St. Pauli."},{"key":"61_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/3-540-44709-1_13","volume-title":"Cryptographic Hardware and Embedded Systems \u2014 CHES 2001","author":"E Sava\u015f","year":"2001","unstructured":"Sava\u015f, E., Schmidt, T.A., Ko\u00e7, \u00c7.K.: Generating elliptic curves of prime order. In: Ko\u00e7, \u00c7.K., Naccache, D., Paar, C. (eds.) CHES 2001. LNCS, vol. 2162, pp. 142\u2013158. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44709-1_13"},{"key":"61_CR14","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1090\/S0025-5718-98-00887-4","volume":"67","author":"IA Semaev","year":"1998","unstructured":"Semaev, I.A.: Evaluation of discrete logarithms in a group of $$p$$-torsion points of an elliptic curve in characteristic $$p$$. Math. Comput. 67, 353\u2013356 (1998)","journal-title":"Math. Comput."},{"key":"61_CR15","unstructured":"Washington, L.C: Elliptic Curves: Number Theory and Cryptography, 2nd Edn, Chapman and Hall\/CRC Press, Boca Raton (2008)"}],"container-title":["Lecture Notes in Networks and Systems","Intelligent Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-80129-8_61","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T07:14:22Z","timestamp":1771658062000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-80129-8_61"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030801281","9783030801298"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-80129-8_61","relation":{},"ISSN":["2367-3370","2367-3389"],"issn-type":[{"value":"2367-3370","type":"print"},{"value":"2367-3389","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"6 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}