{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:33:14Z","timestamp":1725600794796},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642231407"},{"type":"electronic","value":"9783642231414"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23141-4_17","type":"book-chapter","created":{"date-parts":[[2011,8,17]],"date-time":"2011-08-17T08:36:48Z","timestamp":1313570208000},"page":"177-187","source":"Crossref","is-referenced-by-count":0,"title":["Lower Bounds for Interpolating Polynomials for Square Roots of the Elliptic Curve Discrete Logarithm"],"prefix":"10.1007","author":[{"given":"Gerasimos C.","family":"Meletiou","sequence":"first","affiliation":[]},{"given":"Yannis C.","family":"Stamatiou","sequence":"additional","affiliation":[]},{"given":"Apostolos","family":"Tsiakalos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1090\/S0025-5718-1993-1199989-X","volume":"61","author":"A.O.L. Atkin","year":"1993","unstructured":"Atkin, A.O.L., Morain, F.: Elliptic curves and primality proving. Mathematics of Computation\u00a061, 29\u201367 (1993)","journal-title":"Mathematics of Computation"},{"key":"17_CR2","unstructured":"Baier, H.: Efficient Algorithms for Generating Elliptic Curves over Finite Fields Suitable for Use in Cryptography, PhD Thesis, Dept. of Computer Science, Technical Univ.\u00a0of Darmstadt (May 2002)"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/3-540-44495-5_17","volume-title":"Progress in Cryptology - INDOCRYPT 2000","author":"J. Buchmann","year":"2000","unstructured":"Buchmann, J., Baier, H.: Efficient construction of cryptographically strong elliptic curves. In: Roy, B., Okamoto, E. (eds.) INDOCRYPT 2000. LNCS, vol.\u00a01977, pp. 191\u2013202. Springer, Heidelberg (2000)"},{"key":"17_CR4","series-title":"London Mathematical Society Lecture Note Series","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107360211","volume-title":"Elliptic curves in cryptography","author":"I. Blake","year":"1999","unstructured":"Blake, I., Seroussi, G., Smart, N.: Elliptic curves in cryptography. London Mathematical Society Lecture Note Series, vol.\u00a0265. Cambridge University Press, Cambridge (1999)"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/BFb0052252","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"J. Camenisch","year":"1997","unstructured":"Camenisch, J., Stadler, M.: Efficient Group Signature Schemes for Large Groups (Extended Abstract). In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 410\u2013424. Springer, Heidelberg (1997)"},{"key":"17_CR6","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02945-9","volume-title":"A Course in Computational Algebraic Number Theory","author":"H. Cohen","year":"1993","unstructured":"Cohen, H.: A Course in Computational Algebraic Number Theory. Graduate Texts in Mathematics, vol.\u00a0138. Springer, Berlin (1993)"},{"key":"17_CR7","first-page":"33","volume":"46","author":"G. Cornacchia","year":"1908","unstructured":"Cornacchia, G.: Su di un metodo per la risoluzione in numeri interi dell\u2019 equazione $\\sum_{h=0}^{n} C_{h}x^{n-h}y^h = P$ . Giornale di Matematiche di Battaglini\u00a046, 33\u201390 (1908)","journal-title":"Giornale di Matematiche di Battaglini"},{"key":"17_CR8","volume-title":"Primes of the form $x\\sp 2 + ny\\sp 2$","author":"D.A. Cox","year":"1989","unstructured":"Cox, D.A.: Primes of the form $x\\sp 2 + ny\\sp 2$ . John Wiley and Sons, New York (1989)"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/BF02940746","volume":"14","author":"M. Deuring","year":"1941","unstructured":"Deuring, M.: Die Typen der Multiplikatorenringe elliptischer Funktionenk\u00f6rper. Abh. Math. Sem. Hansischen Univ.\u00a014, 197\u2013272 (1941)","journal-title":"Abh. Math. Sem. Hansischen Univ."},{"key":"17_CR10","unstructured":"IEEE P1363\/D13, Standard Specifications for Public-Key Cryptography (1999), http:\/\/grouper.ieee.org\/groups\/1363\/tradPK\/draft.html"},{"issue":"1","key":"17_CR11","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1093\/ietfec\/E88-A.1.81","volume":"88-A","author":"C. Konoma","year":"2005","unstructured":"Konoma, C., Mambo, M., Shizuya, H.: The Computational Difficulty of Solving Cryptographic Primitive Problems Related to the Discrete Logarithm Problem. IEICE Transactions\u00a088-A(1), 81\u201388 (2005)","journal-title":"IEICE Transactions"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1007\/3-540-45749-6_55","volume-title":"Algorithms - ESA 2002","author":"E. Konstantinou","year":"2002","unstructured":"Konstantinou, E., Stamatiou, Y., Zaroliagis, C.: A Software Library for Elliptic Curve Cryptography. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 625\u2013637. Springer, Heidelberg (2002)"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/3-540-36400-5_25","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2002","author":"E. Konstantinou","year":"2003","unstructured":"Konstantinou, E., Stamatiou, Y., Zaroliagis, C.: On the Efficient Generation of Elliptic Curves over Prime Fields. In: Kaliski Jr., B.S., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2002. LNCS, vol.\u00a02523, pp. 333\u2013348. Springer, Heidelberg (2003)"},{"key":"17_CR14","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.\u00a02904, pp. 309\u2013322. Springer, Heidelberg (2003)"},{"key":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/11496618_20","volume-title":"Information Security and Cryptology \u2013 ICISC 2004","author":"E. Konstantinou","year":"2005","unstructured":"Konstantinou, E., Kontogeorgis, A., Stamatiou, Y., Zaroliagis, C.: Generating Prime Order Elliptic Curves: Difficulties and Efficiency Considerations. In: Park, C.-s., Chee, S. (eds.) ICISC 2004. LNCS, vol.\u00a03506, pp. 261\u2013278. Springer, Heidelberg (2005)"},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/3-540-45655-4_16","volume-title":"Computing and Combinatorics","author":"T. Lange","year":"2002","unstructured":"Lange, T., Winterhof, A.: Polynomial Interpolation of the Elliptic Curve and XTR Discrete Logarithm. In: Ibarra, O.H., Zhang, L. (eds.) COCOON 2002. LNCS, vol.\u00a02387, pp. 137\u2013143. Springer, Heidelberg (2002)"},{"key":"17_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/3-540-58691-1_64","volume-title":"Algorithmic Number Theory","author":"G.J. Lay","year":"1994","unstructured":"Lay, G.J., Zimmer, H.: Constructing Elliptic Curves with Given Group Order over Large Finite Fields. In: Huang, M.-D.A., Adleman, L.M. (eds.) ANTS 1994. LNCS, vol.\u00a0877, pp. 250\u2013263. Springer, Heidelberg (1994)"},{"key":"17_CR18","doi-asserted-by":"publisher","first-page":"649","DOI":"10.2307\/1971363","volume":"2","author":"H. Lenstra Jr.","year":"1987","unstructured":"Lenstra Jr., H.: Factoring integers with elliptic curves. Ann. of Math.\u00a02, 649\u2013673 (1987)","journal-title":"Ann. of Math."},{"key":"17_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/BFb0055483","volume-title":"Financial Cryptography","author":"A. Lysyanskaya","year":"1998","unstructured":"Lysyanskaya, A., Ramzan, Z.: Group Blind Digital Signatures: A Scalable Solution to Electronic Cash. In: Hirschfeld, R. (ed.) FC 1998. LNCS, vol.\u00a01465, pp. 184\u2013197. Springer, Heidelberg (1998)"},{"key":"17_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/978-3-642-03564-7_21","volume-title":"Algebraic Informatics","author":"G.C. Meletiou","year":"2009","unstructured":"Meletiou, G.C.: Polynomial Interpolation of the k-th Root of the Discrete Logarithm. In: Bozapalidis, S., Rahonis, G. (eds.) CAI 2009. LNCS, vol.\u00a05725, pp. 318\u2013323. Springer, Heidelberg (2009)"},{"key":"17_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-69499-1_1","volume-title":"Arithmetic of Finite Fields","author":"G.C. Meletiou","year":"2008","unstructured":"Meletiou, G.C., Winterhof, A.: Interpolation of the Double Discrete Logarithm. In: von zur Gathen, J., Ima\u00f1a, J.L., Ko\u00e7, \u00c7.K. (eds.) WAIFI 2008. LNCS, vol.\u00a05130, pp. 1\u201310. Springer, Heidelberg (2008)"},{"key":"17_CR22","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 - 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.\u00a02162, pp. 142\u2013161. Springer, Heidelberg (2001)"},{"key":"17_CR23","volume-title":"Progress in Computer Science and Applied Logic (PCS)","author":"I.E. Shparlinski","year":"1999","unstructured":"Shparlinski, I.E.: Number Theoretic Methods in Cryptography: Complexity Lower Bounds. In: Progress in Computer Science and Applied Logic (PCS). Birkh\u00e4user, Basel (1999)"},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"Silverman, J.H.: The Arithmetic of Elliptic Curves. GTM\u00a0106 (1986)","DOI":"10.1007\/978-1-4757-1920-8"},{"key":"17_CR25","volume-title":"Galois Theory","author":"I. Stewart","year":"2004","unstructured":"Stewart, I.: Galois Theory, 3rd edn. Chapman & Hall\/CRC, Boca Raton, FL (2004)","edition":"3"},{"key":"17_CR26","volume-title":"Algebraic Number Theory","author":"I. Stewart","year":"1987","unstructured":"Stewart, I., Tall, D.: Algebraic Number Theory, 2nd edn. Chapman & Hall, London (1987)","edition":"2"},{"key":"17_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/3-540-48970-3_19","volume-title":"Information Security and Privacy","author":"J. Traor\u00e9","year":"1999","unstructured":"Traor\u00e9, J.: Group Signatures and Their Relevance to Privacy-Protecting Off-Line Electronic Cash Systems. In: Pieprzyk, J.P., Safavi-Naini, R., Seberry, J. (eds.) ACISP 1999. LNCS, vol.\u00a01587, pp. 228\u2013243. Springer, Heidelberg (1999)"}],"container-title":["Communications in Computer and Information Science","Information Security and Assurance"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23141-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T23:59:13Z","timestamp":1560470353000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23141-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642231407","9783642231414"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23141-4_17","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2011]]}}}