{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T22:02:10Z","timestamp":1757541730234,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031219665"},{"type":"electronic","value":"9783031219672"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-21967-2_46","type":"book-chapter","created":{"date-parts":[[2022,12,8]],"date-time":"2022-12-08T08:02:35Z","timestamp":1670486555000},"page":"569-581","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Extensions of\u00a0the\u00a0Diffie-Hellman Key Agreement Protocol Based on\u00a0Exponential and\u00a0Logarithmic Functions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6722-4402","authenticated-orcid":false,"given":"Zbigniew","family":"Lipi\u0144ski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2298-5037","authenticated-orcid":false,"given":"Jolanta","family":"Mizera-Pietraszko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,9]]},"reference":[{"key":"46_CR1","doi-asserted-by":"crossref","unstructured":"Diffie, W., Hellman, M.E.: New Directions in Cryptography. IEEE Trans. Inform. Theor. IT-22(6), 644\u2013654 (1976)","DOI":"10.1109\/TIT.1976.1055638"},{"key":"46_CR2","doi-asserted-by":"crossref","unstructured":"Rescorla, E.: Diffie-Hellman Key Agreement Method, RFC 2631, http:\/\/www.rfc-editor.org (1999)","DOI":"10.17487\/rfc2631"},{"key":"46_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4310\/MRL.1999.v6.n3.a3","volume":"6","author":"I Anshel","year":"1999","unstructured":"Anshel, I., Anshel, M., Goldfeld, D.: An algebraic method for public-key cryptography. Math. Res. Lett. 6, 1\u20135 (1999)","journal-title":"Math. Res. Lett."},{"key":"46_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0166-218X(02)00585-1","volume":"130","author":"I Anshel","year":"2003","unstructured":"Anshel, I., Anshel, M., Goldfeld, D.: Non-abelian key agreement protocols. Discrete Appl. Math. 130, 3\u201312 (2003)","journal-title":"Discrete Appl. Math."},{"key":"46_CR5","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/BF01456932","volume":"71","author":"M Dehn","year":"1911","unstructured":"Dehn, M.: \u00dcber unendliche diskontinuierliche Gruppen. Math. Annalen 71, 116\u2013144 (1911)","journal-title":"Math. Annalen"},{"key":"46_CR6","doi-asserted-by":"crossref","unstructured":"Myasnikov, A., Shpilrain, V., Ushakov, A.: Non-commutative Cryptography and Complexity of Group-theoretic Problems, Mathematical Surveys and Monographs, vol. 177, AMS (2011)","DOI":"10.1090\/surv\/177"},{"key":"46_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-39568-7_3","volume-title":"Advances in Cryptology","author":"NR Wagner","year":"1985","unstructured":"Wagner, N.R., Magyarik, M.R.: A public-key cryptosystem based on the word problem. In: Blakley, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 19\u201336. Springer, Heidelberg (1985). https:\/\/doi.org\/10.1007\/3-540-39568-7_3"},{"key":"46_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/3-540-44598-6_10","volume-title":"Advances in Cryptology \u2014 CRYPTO 2000","author":"KH Ko","year":"2000","unstructured":"Ko, K.H., Lee, S.J., Cheon, J.H., Han, J.W., Kang, J., Park, C.: New public-key cryptosystem using braid groups. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 166\u2013183. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44598-6_10"},{"key":"46_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/3-540-45353-9_2","volume-title":"Topics in Cryptology \u2014 CT-RSA 2001","author":"I Anshel","year":"2001","unstructured":"Anshel, I., Anshel, M., Fisher, B., Goldfeld, D.: New key agreement protocols in braid group Ccyptography. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol. 2020, pp. 13\u201327. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45353-9_2"},{"key":"46_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1515\/jmc-2017-0015","volume":"12","author":"J Partala","year":"2018","unstructured":"Partala, J.: Algebraic generalization of Diffe-Hellman key exchange. J. Math. Cryptol. 12, 1\u201321 (2018)","journal-title":"J. Math. Cryptol."},{"key":"46_CR11","doi-asserted-by":"publisher","unstructured":"Chefranov, A. G., Mahmoud, A. Y.: Commutative Matrix-based Diffie-Hellman-Like Key-Exchange Protocol. In: Proceedings of the 28th International Symposium on Computer and Information Sciences In: E. Gelenbe, R. Lent (eds.), Springer, pp. 317\u2013324, (2013). https:\/\/doi.org\/10.1007\/978-3-319-01604-7_31","DOI":"10.1007\/978-3-319-01604-7_31"},{"key":"46_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/978-3-540-45146-4_13","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"JH Cheon","year":"2003","unstructured":"Cheon, J.H., Jun, B.: A polynomial time algorithm for the braid Diffie-Hellman Conjugacy Problem. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 212\u2013225. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_13"},{"key":"46_CR13","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1515\/gcc-2012-0001","volume":"4","author":"M Eftekhari","year":"2012","unstructured":"Eftekhari, M.: A Diffie-Hellman key exchange protocol using matrices over noncommutative rings. Groups Complex. Cryptol. 4, 167\u2013176 (2012)","journal-title":"Groups Complex. Cryptol."},{"key":"46_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-540-78967-3_8","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"D Cash","year":"2008","unstructured":"Cash, D., Kiltz, E., Shoup, V.: The twin Diffie-Hellman problem and applications. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 127\u2013145. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78967-3_8"},{"key":"46_CR15","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.jco.2004.01.002","volume":"20","author":"IF Blake","year":"2004","unstructured":"Blake, I.F., Garefalakis, T.: On the complexity of the discrete logarithm and Diffie-Hellman problems. J. Complexity 20, 148\u2013170 (2004)","journal-title":"J. Complexity"},{"key":"46_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/3-540-36492-7_21","volume-title":"Selected Areas in Cryptography","author":"E Bresson","year":"2003","unstructured":"Bresson, E., Chevassut, O., Pointcheval, D.: The group Diffie-Hellman problems. In: Nyberg, K., Heys, H. (eds.) SAC 2002. LNCS, vol. 2595, pp. 325\u2013338. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36492-7_21"},{"key":"46_CR17","doi-asserted-by":"crossref","unstructured":"Steiner, M., Tsudik, G., Waidner, M.: Diffe-Hellman key distribution extended to group communication. In: Proceedings of ACM CCS \u201996, ACM Press, pp. 31\u201337 (1996)","DOI":"10.1145\/238168.238182"},{"key":"46_CR18","unstructured":"Dougherty, D. J., Guttman, J. D.: Symbolic Protocol Analysis for Diffie-Hellman, arXiv:1202.2168 (2012)"},{"key":"46_CR19","unstructured":"Niven, I. M., Zuckerman, H. S., Montgomery, H. L.: An introduction to the theory of numbers, John Wiley & Sons (1991)"},{"issue":"220","key":"46_CR20","doi-asserted-by":"publisher","first-page":"1719","DOI":"10.1090\/S0025-5718-97-00890-9","volume":"66","author":"E Bach","year":"1997","unstructured":"Bach, E.: Comments on search procedures for primitive roots. Math. Comp. 66(220), 1719\u20131727 (1997)","journal-title":"Math. Comp."},{"issue":"17","key":"46_CR21","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1112\/plms\/s3-17.1.11","volume":"3","author":"DA Burgess","year":"1967","unstructured":"Burgess, D.A.: Character sums and primitive roots in finite fields. Proc. London Math. Soe. 3(17), 11\u201325 (1967)","journal-title":"Proc. London Math. Soe."},{"key":"46_CR22","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/0304-3975(95)00164-6","volume":"157","author":"I Shparlinski","year":"1996","unstructured":"Shparlinski, I.: On finding primitive roots in finite fields. Theor. Comput. Sci. 157, 273\u2013275 (1996)","journal-title":"Theor. Comput. Sci."},{"issue":"197","key":"46_CR23","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1090\/S0025-5718-1992-1106981-9","volume":"58","author":"V Shoup","year":"1992","unstructured":"Shoup, V.: Searching for Primitive Roots in Finite Fields. Math. Comput. 58(197), 369\u2013380 (1992)","journal-title":"Math. Comput."},{"key":"46_CR24","unstructured":"Bach, E., Shallit, J.: Algorithmic number theory, Volume I: Efficient Algorithms, MIT Press (1996)"},{"key":"46_CR25","doi-asserted-by":"crossref","unstructured":"Lidl, R., Niederreiter, H., Cohn, P. M.: Finite Fields, Cambridge University Press (1997)","DOI":"10.1017\/CBO9780511525926"},{"key":"46_CR26","doi-asserted-by":"publisher","unstructured":"Rose, H.E.: A Course on Finite Groups, Springer-Verlag (2009). https:\/\/doi.org\/10.1007\/978-1-84882-889-6","DOI":"10.1007\/978-1-84882-889-6"}],"container-title":["Lecture Notes in Computer Science","Intelligent Information and Database Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-21967-2_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,8]],"date-time":"2022-12-08T08:17:43Z","timestamp":1670487463000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-21967-2_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031219665","9783031219672"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-21967-2_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"9 December 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACIIDS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asian Conference on Intelligent Information and Database Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ho Chi Minh City","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vietnam","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aciids2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/aciids.pwr.edu.pl\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}