{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,6,3]],"date-time":"2023-06-03T13:28:08Z","timestamp":1685798888532},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2009,6,1]],"date-time":"2009-06-01T00:00:00Z","timestamp":1243814400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1007\/s00607-009-0032-0","type":"journal-article","created":{"date-parts":[[2009,6,2]],"date-time":"2009-06-02T19:25:39Z","timestamp":1243970739000},"page":"3-19","source":"Crossref","is-referenced-by-count":2,"title":["Discrete logarithms for finite groups"],"prefix":"10.1007","volume":"85","author":[{"given":"Lee C.","family":"Klingler","sequence":"first","affiliation":[]},{"given":"Spyros S.","family":"Magliveras","sequence":"additional","affiliation":[]},{"given":"Fred","family":"Richman","sequence":"additional","affiliation":[]},{"given":"Michal","family":"Sramka","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,6,3]]},"reference":[{"key":"32_CR1","doi-asserted-by":"crossref","first-page":"287","DOI":"10.4310\/MRL.1999.v6.n3.a3","volume":"6","author":"I Anshel","year":"1999","unstructured":"Anshel I, Anshel M, Goldfeld D (1999) An algebraic method for public-key cryptography. Math Res Lett 6: 287\u2013291","journal-title":"Math Res Lett"},{"key":"32_CR2","first-page":"351","volume":"1","author":"S-J Choi","year":"2007","unstructured":"Choi S-J, Blackburn SR, Wild PR (2007) Cryptanalysis of a homomorphic public-key cryptosystem over a finite group. J Math Cryptogr 1: 351\u2013358","journal-title":"J Math Cryptogr"},{"key":"32_CR3","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"2","author":"W Diffie","year":"1976","unstructured":"Diffie W, Hellman ME (1976) New directions in cryptography. IEEE Trans Inf Theory 2: 644\u2013654","journal-title":"IEEE Trans Inf Theory"},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"Egner S, Pueschel M (1998) Solving puzzles related to permutation groups. In: Proceedings of the 1998 International Symposium on Symbolic and Algebraic Computation. ACM Press, New York, pp 186\u2013193","DOI":"10.1145\/281508.281611"},{"issue":"3","key":"32_CR5","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0196-6774(81)90029-8","volume":"2","author":"S Even","year":"1981","unstructured":"Even S, Goldreich O (1981) Minimum-length generator sequence problem is NP-hard. J Algorithms 2(3): 311\u2013313","journal-title":"J Algorithms"},{"key":"32_CR6","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography","author":"O Goldreich","year":"2001","unstructured":"Goldreich O (2001) Foundations of Cryptography. Cambridge University Press, Cambridge"},{"issue":"1","key":"32_CR7","first-page":"149","volume":"33","author":"MI Gonzalez-Vasco","year":"2006","unstructured":"Gonzalez-Vasco MI, Steinwandt R (2006) Chosen ciphertext attacks as common vulnerability of some group- and polynomial-based encryption schemes. Tatra Mt Math Publ 33(1): 149\u2013157","journal-title":"Tatra Mt Math Publ"},{"key":"32_CR8","first-page":"305","volume":"13","author":"D Grigoriev","year":"2004","unstructured":"Grigoriev D, Ponomarenko I (2004) Homomorphic public-key cryptosystems over groups and rings. Complex Comput Proofs Quad Mat 13: 305\u2013325","journal-title":"Complex Comput Proofs Quad Mat"},{"key":"32_CR9","doi-asserted-by":"crossref","DOI":"10.1201\/9781420035216","volume-title":"Handbook of computational group theory","author":"DF Holt","year":"2005","unstructured":"Holt DF, Eick B, O\u2019Brien EA (2005) Handbook of computational group theory. Chapman & Hall\/CRC Press, Boca Raton"},{"key":"32_CR10","unstructured":"Ilic I (2008) Discrete logs in arbitrary finite groups. PhD Research, Florida Atlantic University (Unpublished)"},{"key":"32_CR11","unstructured":"Impagliazzo R, Levin LA, Luby M (1989) Pseudorandom generation from one-way functions. In: Proceedings of the 21st ACM symposium on theory of computing. ACM Press, New York, pp 12\u201324"},{"issue":"1","key":"32_CR12","first-page":"95","volume":"3","author":"SK Kashyap","year":"2006","unstructured":"Kashyap SK, Sharma BK, Banerjee A (2006) A cryptosystem based on DLP $${\\gamma\\equiv\\alpha^a\\beta^b\\pmod{p}}$$ . Int J Netw Secur 3(1): 95\u2013100","journal-title":"Int J Netw Secur"},{"key":"32_CR13","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/s00145-008-9033-y","volume":"22","author":"W Lempken","year":"2009","unstructured":"Lempken W, Magliveras SS, Tran van Trung, Wei W (2009) A public key cryptosystem based on non-abelian finite groups. J Cryptol 22: 62\u201374","journal-title":"J Cryptol"},{"key":"32_CR14","doi-asserted-by":"crossref","first-page":"941","DOI":"10.1090\/S0025-5718-1980-0572868-5","volume":"35","author":"JS Leon","year":"1980","unstructured":"Leon JS (1980) On an algorithm for finding a base and a strong generating set for a group given by generating permutations. Math Comput 35: 941\u2013974","journal-title":"Math Comput"},{"key":"32_CR15","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BF02451113","volume":"5","author":"SS Magliveras","year":"1992","unstructured":"Magliveras SS, Memon ND (1992) The algebraic properties of cryptosystem PGM. J Cryptol 5: 167\u2013183","journal-title":"J Cryptol"},{"key":"32_CR16","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/s00145-001-0018-3","volume":"15","author":"SS Magliveras","year":"2002","unstructured":"Magliveras SS, van Tran Trung, Stinson DR (2002) New approaches to designing public key cryptosystems using one-way functions and trap-doors in finite groups. J Cryptol 15: 285\u2013297","journal-title":"J Cryptol"},{"key":"32_CR17","unstructured":"Mahalanobis A (2005) Diffie\u2013Hellman key exchange protocol, its generalization and Nilpotent Groups. PhD thesis, Florida Atlantic University, Boca Raton"},{"key":"32_CR18","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s11856-008-1008-z","volume":"165","author":"A Mahalanobis","year":"2008","unstructured":"Mahalanobis A (2008) The Diffie\u2013Hellman key exchange protocol, and non-abelian nilpotent groups. Isr J Math 165: 161\u2013187","journal-title":"Isr J Math"},{"issue":"10","key":"32_CR19","doi-asserted-by":"crossref","first-page":"3878","DOI":"10.1080\/00927870802160883","volume":"36","author":"A Mahalanobis","year":"2008","unstructured":"Mahalanobis A (2008) A simple generalization of the ElGamal cryptosystem to non-abelian groups. Comm Algebra 36(10): 3878\u20133889","journal-title":"Comm Algebra"},{"issue":"4","key":"32_CR20","doi-asserted-by":"crossref","first-page":"489","DOI":"10.3934\/amc.2007.1.489","volume":"1","author":"G Maze","year":"2007","unstructured":"Maze G, Monico C, Rosenthal J (2007) Public key cryptography based on semigroup actions. Adv Math Commun 1(4): 489\u2013507","journal-title":"Adv Math Commun"},{"key":"32_CR21","doi-asserted-by":"crossref","unstructured":"Myasnikov AG, Shpilrain V, Ushakov A (2005) A practical attack on some braid group based cryptographic protocols. In: Advances in Cryptology\u2014CRYPTO 2005. Lecture Notes in Computer Science, vol 3621. Springer, Heidelberg, pp 86\u201396","DOI":"10.1007\/11535218_6"},{"key":"32_CR22","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1023\/A:1008350005447","volume":"19","author":"AM Odlyzko","year":"2000","unstructured":"Odlyzko AM (2000) Discrete logarithms: the past and the future. Des Codes Cryptogr 19: 129\u2013145","journal-title":"Des Codes Cryptogr"},{"key":"32_CR23","doi-asserted-by":"crossref","unstructured":"Paeng S, Ha K, Kim J, Chee S, Park C (2001) New public key cryptosystem using finite non-abelian groups. In: Advances in Cryptology\u2014CRYPTO 2001. Lecture Notes in Computer Science, vol 2139. pp 470\u2013485","DOI":"10.1007\/3-540-44647-8_28"},{"key":"32_CR24","doi-asserted-by":"crossref","unstructured":"Rompel J (1990) One-way functions are necessary and sufficient for secure signatures. In: Proceedings of the 22nd annual ACM symposium on theory of computing. ACM Press, New York, pp 387\u2013394","DOI":"10.1145\/100216.100269"},{"issue":"5","key":"32_CR25","doi-asserted-by":"crossref","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"PW Shor","year":"1997","unstructured":"Shor PW (1997) Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J Comput 26(5): 1484\u20131509","journal-title":"SIAM J Comput"},{"key":"32_CR26","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/s00200-006-0006-9","volume":"17","author":"V Shpilrain","year":"2006","unstructured":"Shpilrain V, Zapata G (2006) Combinatorial group theory and public key cryptography. App Alg Eng Comm Comp 17: 291\u2013302","journal-title":"App Alg Eng Comm Comp"},{"key":"32_CR27","doi-asserted-by":"crossref","unstructured":"Shpilrain V (2008) Cryptanalysis of Stickel\u2019s key exchange scheme. In: Proceedings of Computer Science in Russia 2008. Lecture Notes in Computer Science, vol 5010. Springer, Heidelberg, pp 283\u2013288 (2008)","DOI":"10.1007\/978-3-540-79709-8_29"},{"issue":"1","key":"32_CR28","first-page":"137","volume":"33","author":"J-C Birget","year":"2006","unstructured":"Birget J-C, Magliveras SS, Sramka M (2006) On public-key cryptosystems based on combinatorial group theory. Tatra Mt Math Publ 33(1): 137\u2013148","journal-title":"Tatra Mt Math Publ"},{"key":"32_CR29","unstructured":"Sramka M (2006) New Results in Group Theoretic Cryptology. PhD Thesis, Florida Atlantic University, Boca Raton"},{"issue":"1","key":"32_CR30","first-page":"80","volume":"6","author":"M Sramka","year":"2008","unstructured":"Sramka M (2008) Cryptanalysis of the cryptosystem based on DLP \u03b3 =\u00a0\u03b1 a \u03b2 b . Int J Netw Secur 6(1): 80\u201381","journal-title":"Int J Netw Secur"},{"key":"32_CR31","unstructured":"Sramka M (2008) On the Security of Stickel\u2019s Key Exchange Scheme. J Comb Math Comb Comp 66"},{"key":"32_CR32","doi-asserted-by":"crossref","unstructured":"Stickel E (2005) A new method for exchanging secret keys. In: Proceedings of the third international conference on information technology and applications (ICITA\u201905), vol 2, pp 426\u2013430","DOI":"10.1109\/ICITA.2005.33"},{"key":"32_CR33","doi-asserted-by":"crossref","unstructured":"Steinwandt R, Grassl M, Geiselmann W, Beth Th (2000) Weaknesses in the SL2(F2n) Hashing Scheme. In: Advances in Cryptology\u2014CRYPTO 2000. Lecture Notes in Computer Science, vol 1880. Springer, Heidelberg, pp 287\u2013299","DOI":"10.1007\/3-540-44598-6_18"},{"key":"32_CR34","unstructured":"Tillich JP, Z\u00e9mor G (1994) Hashing with SL2. In: Advances in Cryptology\u2014CRYPTO\u201994. Lecture Notes in Computer Science, vol 839. Springer, Heidelberg, pp 40\u201349"},{"key":"32_CR35","doi-asserted-by":"crossref","unstructured":"Wagner NR, Magyarik MR (1985) A public-key cryptosystem based on the word problem. In: Advances in Cryptology\u2014CRYPTO\u201984. Lecture Notes in Computer Science, vol 196. Springer, Heidelberg, pp 19\u201336","DOI":"10.1007\/3-540-39568-7_3"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-009-0032-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00607-009-0032-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-009-0032-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:30:21Z","timestamp":1559140221000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00607-009-0032-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6]]},"references-count":35,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2009,6]]}},"alternative-id":["32"],"URL":"https:\/\/doi.org\/10.1007\/s00607-009-0032-0","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,6]]}}}