{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T00:35:27Z","timestamp":1764981327082,"version":"3.46.0"},"reference-count":43,"publisher":"Walter de Gruyter GmbH","issue":"1","license":[{"start":{"date-parts":[[2021,10,26]],"date-time":"2021-10-26T00:00:00Z","timestamp":1635206400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,10,26]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    In previous work, we developed a\n                    <jats:italic>single<\/jats:italic>\n                    evolutionary algorithm (EA) to solve random instances of the Anshel\u2013Anshel\u2013Goldfeld (AAG) key exchange protocol over polycyclic groups. The EA consisted of six simple heuristics which manipulated strings. The present work extends this by exploring the use of hyper-heuristics in group-theoretic cryptology for the first time. Hyper-heuristics are a way to generate new algorithms from existing algorithm components (in this case, simple heuristics), with EAs being one example of the type of algorithm which can be generated by our hyper-heuristic framework. We take as a starting point the above EA and allow hyper-heuristics to build on it by making small tweaks to it. This adaptation is through a process of taking the EA and injecting chains of heuristics built from the simple heuristics. We demonstrate we can create novel heuristic chains, which when placed in the EA create algorithms that out perform the existing EA. The new algorithms solve a greater number of random AAG instances than the EA. This suggests the approach may be applied to many of the same kinds of problems, providing a framework for the solution of cryptology problems over groups. The contribution of this article is thus a framework to automatically build algorithms to attack cryptology problems given an applicable group.\n                  <\/jats:p>","DOI":"10.1515\/jmc-2021-0017","type":"journal-article","created":{"date-parts":[[2021,10,26]],"date-time":"2021-10-26T17:22:09Z","timestamp":1635268929000},"page":"49-63","source":"Crossref","is-referenced-by-count":2,"title":["Evolution of group-theoretic cryptology attacks using hyper-heuristics"],"prefix":"10.1515","volume":"16","author":[{"given":"Matthew J.","family":"Craven","sequence":"first","affiliation":[{"name":"Centre for Mathematical Sciences, University of Plymouth, Drake Circus , Plymouth , PL4 8AA , United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John R.","family":"Woodward","sequence":"additional","affiliation":[{"name":"Queen Mary University of London, Mile End Road , London E1 4NS , United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"374","published-online":{"date-parts":[[2021,10,26]]},"reference":[{"key":"2025120600292544637_j_jmc-2021-0017_ref_001","doi-asserted-by":"crossref","unstructured":"Anshel I\n, \nAnshel M\n, \nFisher B\n, \nGoldfeld D\n. New key agreement protocols in braid group cryptography. In Cryptographers\u2019 Track at the RSA Conference. Berlin Heidelberg: Springer; 2001. p. 13\u201327.","DOI":"10.1007\/3-540-45353-9_2"},{"key":"2025120600292544637_j_jmc-2021-0017_ref_002","doi-asserted-by":"crossref","unstructured":"Anshel I\n, \nAnshel M\n, \nGoldfeld D\n. An algebraic method for public-key cryptography. Math Res Lett. 1999;6:287\u201392.","DOI":"10.4310\/MRL.1999.v6.n3.a3"},{"key":"2025120600292544637_j_jmc-2021-0017_ref_003","doi-asserted-by":"crossref","unstructured":"Ko KH\n, \nLee SJ\n, \nCheon JH\n, \nHan JW\n, \nKang JS\n, \nPark C\n. New public-key cryptosystem using braid groups. In Annual International Cryptology Conference. Berlin Heidelberg: Springer; 2000. p. 166\u201383.","DOI":"10.1007\/3-540-44598-6_10"},{"key":"2025120600292544637_j_jmc-2021-0017_ref_004","unstructured":"Eick B\n, \nKahrobaei D\n. Polycyclic groups: a new platform for cryptology? arXiv:http:\/\/arXiv.org\/abs\/math\/0411077, 2004."},{"key":"2025120600292544637_j_jmc-2021-0017_ref_005","doi-asserted-by":"crossref","unstructured":"Kahrobaei D\n, \nLam HT\n. Heisenberg groups as platform for the aag key-exchange protocol. In 2014 IEEE 22nd International Conference on Network Protocols (ICNP). Piscataway: IEEE; 2014. p. 660\u20134.","DOI":"10.1109\/ICNP.2014.105"},{"key":"2025120600292544637_j_jmc-2021-0017_ref_006","doi-asserted-by":"crossref","unstructured":"Garber D\n, \nKaplan S\n, \nTeicher M\n, \nTsaban B\n, \nVishne U\n. Probabilistic solutions of equations in the braid group. Adv. Appl. Math. 2005;35:323\u201334.","DOI":"10.1016\/j.aam.2005.03.002"},{"key":"2025120600292544637_j_jmc-2021-0017_ref_007","doi-asserted-by":"crossref","unstructured":"Garber D\n, \nKaplan S\n, \nTeicher M\n, \nTsaban B\n, \nVishne U\n. Length-based conjugacy search in the braid group. Contemporary Math. 2006;418:75.","DOI":"10.1090\/conm\/418\/07947"},{"key":"2025120600292544637_j_jmc-2021-0017_ref_008","doi-asserted-by":"crossref","unstructured":"Franco N\n, \nGonz\u00e1lez-Meneses J\n. Conjugacy problem for braid groups and garside groups. J Algebra. 2003;266(1):112\u201332.","DOI":"10.1016\/S0021-8693(03)00292-8"},{"key":"2025120600292544637_j_jmc-2021-0017_ref_009","doi-asserted-by":"crossref","unstructured":"Craven MJ\n, \nJimbo HC\n. Evolutionary algorithm solution of the multiple conjugacy search problem in groups, and its applications to cryptography. Groups-Complexity-Cryptol. 2012;4(1):135\u201365.","DOI":"10.1515\/gcc-2012-0002"},{"key":"2025120600292544637_j_jmc-2021-0017_ref_010","doi-asserted-by":"crossref","unstructured":"Craven MJ\n, \nRobertz D\n. A parallel evolutionary approach to solving systems of equations in polycyclic groups. Groups Complexity Cryptol. 2016;8(2):109\u201325.","DOI":"10.1515\/gcc-2016-0012"},{"key":"2025120600292544637_j_jmc-2021-0017_ref_011","doi-asserted-by":"crossref","unstructured":"Kotov M\n, \nUshakov A\n. Analysis of a certain polycyclic-group-based cryptosystem. J Math Cryptol. 2015;9(3):161\u20137.","DOI":"10.1515\/jmc-2015-0013"},{"key":"2025120600292544637_j_jmc-2021-0017_ref_012","doi-asserted-by":"crossref","unstructured":"Myasnikov AD\n, \nUshakov A\n. Length based attack and braid groups: cryptanalysis of Anshel\u2013Anshel\u2013Goldfeld key exchange protocol. In International Workshop on Public Key Cryptography. Berlin: Springer; 2007. p. 76\u201388.","DOI":"10.1007\/978-3-540-71677-8_6"},{"key":"2025120600292544637_j_jmc-2021-0017_ref_013","unstructured":"Myasnikov A\n, \nShpilrain V\n, \nUshakov A\n. Group-based cryptography. Advanced Courses in Mathematics CRM Barcelona. Berlin Heidelberg: Springer Science and Business Media; 2008."},{"key":"2025120600292544637_j_jmc-2021-0017_ref_014","doi-asserted-by":"crossref","unstructured":"Ruinskiy D\n, \nShamir A\n, \nTsaban B\n. Length-based cryptanalysis: The case of Thompson\u2019s group. J Math Cryptol. 2007;1(4):359\u201372.","DOI":"10.1515\/jmc.2007.018"},{"key":"2025120600292544637_j_jmc-2021-0017_ref_015","unstructured":"The GAP Group. Gap - groups, algorithms, and programming, version 4.8.7. 2015. http:\/\/www.gap-system.org"},{"key":"2025120600292544637_j_jmc-2021-0017_ref_016","unstructured":"Cooperman G\n. Pargap, version 1.4.0. Available from: http:\/\/www.gap-system.org\/Packages\/pargap.html, 2013."},{"key":"2025120600292544637_j_jmc-2021-0017_ref_017","doi-asserted-by":"crossref","unstructured":"Garber D\n, \nKahrobaei D\n, \nLam HT\n. Length-based attacks in polycyclic groups. J Math Cryptol. 2015;9(1):33\u201343.","DOI":"10.1515\/jmc-2014-0003"},{"key":"2025120600292544637_j_jmc-2021-0017_ref_018","doi-asserted-by":"crossref","unstructured":"Woodward JR\n, \nSwan J\n. Automatically designing selection heuristics. In Proceedings of the 13th Annual Conference Companion on Genetic and Evolutionary Computation. New York: ACM; 2011. p. 583\u201390.","DOI":"10.1145\/2001858.2002052"},{"key":"2025120600292544637_j_jmc-2021-0017_ref_019","doi-asserted-by":"crossref","unstructured":"Woodward JR\n, \nSwan J\n. The automatic generation of mutation operators for genetic algorithms. In Proceedings of the 14th Annual Conference Companion on Genetic and Evolutionary Computation. New York: ACM; 2012. p. 67\u201374.","DOI":"10.1145\/2330784.2330796"},{"key":"2025120600292544637_j_jmc-2021-0017_ref_020","unstructured":"Hughes J\n, \nTannenbaum A\n. Length-based attacks for certain group based encryption rewriting systems. Workshop SECI02, Tunis, Tunisia. 2002."},{"key":"2025120600292544637_j_jmc-2021-0017_ref_021","doi-asserted-by":"crossref","unstructured":"Shpilrain V\n, \nZapata G\n. Using decision problems in public key cryptography. Groups-Complexity-Cryptol. 2009;1(1):33\u201349.","DOI":"10.1515\/GCC.2009.33"},{"key":"2025120600292544637_j_jmc-2021-0017_ref_022","doi-asserted-by":"crossref","unstructured":"Blaney KR\n, \nNikolaev A\n. A PTIME solution to the restricted conjugacy problem in generalized Heisenberg groups. Groups Complexity Cryptol. 2016;8(1):69\u201374.","DOI":"10.1515\/gcc-2016-0003"},{"key":"2025120600292544637_j_jmc-2021-0017_ref_023","doi-asserted-by":"crossref","unstructured":"Burke EK\n, \nHyde MR\n, \nKendall G\n, \nOchoa G\n, \n\u00d6zcan E\n, \nWoodward JR\n. Exploring hyper-heuristic methodologies with genetic programming. In Computational Intelligence. New York: Springer; 2009. p. 177\u2013201.","DOI":"10.1007\/978-3-642-01799-5_6"},{"key":"2025120600292544637_j_jmc-2021-0017_ref_024","doi-asserted-by":"crossref","unstructured":"Bai R\n. A model for fresh produce shelf space allocation and inventory management with freshness condition dependent demand. INFORMS J Comput. 2007;20(1):78\u201385.","DOI":"10.1287\/ijoc.1070.0219"},{"key":"2025120600292544637_j_jmc-2021-0017_ref_025","doi-asserted-by":"crossref","unstructured":"Bilgin B\n, \n\u00d6zcan E\n, \nKorkmaz EE\n. An experimental study on hyper-heuristics and exam timetabling. In International Conference on the Practice and Theory of Automated Timetabling. Berlin: Springer; 2006. p. 394\u2013412.","DOI":"10.1007\/978-3-540-77345-0_25"},{"key":"2025120600292544637_j_jmc-2021-0017_ref_026","unstructured":"Ross P\n, \nSchulenburg S\n, \nMariiin-Bl\u00e4zquez JG\n, \nHart E\n. Hyper-heuristics: learning to combine simple heuristics in bin-packing problems. In Proceedings of the 4th Annual Conference on Genetic and Evolutionary Computation. New York: ACM; 2002. p. 942\u20138."},{"key":"2025120600292544637_j_jmc-2021-0017_ref_027","doi-asserted-by":"crossref","unstructured":"Burke EK\n, \nKendall G\n, \nSoubeiga E\n. A tabu-search hyperheuristic for timetabling and rostering. J Heurist. 2003;9(6):451\u201370.","DOI":"10.1023\/B:HEUR.0000012446.94732.b6"},{"key":"2025120600292544637_j_jmc-2021-0017_ref_028","doi-asserted-by":"crossref","unstructured":"Ross P\n. Hyper-heuristics. In Search methodologies. Berlin: Springer; 2005. p. 529\u201356.","DOI":"10.1007\/0-387-28356-0_17"},{"key":"2025120600292544637_j_jmc-2021-0017_ref_029","doi-asserted-by":"crossref","unstructured":"Burke EK\n, \nGendreau M\n, \nHyde M\n, \nKendall G\n, \nOchoa G\n, \n\u00d6zcan E\n, \nQu R\n. Hyper-heuristics: a survey of the state of the art. J Operat Res Soc. 2013;64(12):1695\u2013724.","DOI":"10.1057\/jors.2013.71"},{"key":"2025120600292544637_j_jmc-2021-0017_ref_030","doi-asserted-by":"crossref","unstructured":"Burke EK\n, \nHyde MR\n, \nKendall G\n, \nOchoa G\n, \n\u00d6zcan E\n, \nWoodward JR\n. A classification of hyper-heuristic approaches: revisited. In Handbook of Metaheuristics. New York: Springer; 2019. p. 453\u201377.","DOI":"10.1007\/978-3-319-91086-4_14"},{"key":"2025120600292544637_j_jmc-2021-0017_ref_031","doi-asserted-by":"crossref","unstructured":"Goldman BW\n, \nTauritz DR\n. Self-configuring crossover. In Proceedings of the 13th Annual Conference Companion on Genetic and Evolutionary Computation. New York: ACM, 2011. p. 575\u201382.","DOI":"10.1145\/2001858.2002051"},{"key":"2025120600292544637_j_jmc-2021-0017_ref_032","doi-asserted-by":"crossref","unstructured":"Hong L\n, \nWoodward J\n, \nLi J\n, \n\u00d6zcan E\n. Automated design of probability distributions as mutation operators for evolutionary programming using genetic programming. In European Conference on Genetic Programming. Berlin Heidelberg: Springer; 2013. p. 85\u201396.","DOI":"10.1007\/978-3-642-37207-0_8"},{"key":"2025120600292544637_j_jmc-2021-0017_ref_033","doi-asserted-by":"crossref","unstructured":"Haraldsson SO\n, \nWoodward JR\n. Automated design of algorithms and genetic improvement: contrast and commonalities. In Proceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary Computation. New York: ACM; 2014. p. 1373\u201380.","DOI":"10.1145\/2598394.2609874"},{"key":"2025120600292544637_j_jmc-2021-0017_ref_034","unstructured":"Eick B\n, \nNickel W\n, \nHorn M\n. Polycyclic, version 2.11. Available from http:\/\/www.gap-system.org\/Packages\/polycyclic.html, 2013."},{"key":"2025120600292544637_j_jmc-2021-0017_ref_035","doi-asserted-by":"crossref","unstructured":"Ochoa G\n, \nHyde M\n, \nCurtois T\n, \nVazquez-Rodriguez J\n, \nWalker J\n, \nGendreau M\n, et al. Hyflex: a benchmark framework for cross-domain heuristic search. In \nHao J-K\n, \nMiddendorf M\n, editors. European Conference on Evolutionary Computation in Combinatorial Optimisation, LNCS 7245. Berlin: Springer; 2012. p. 136\u201347.","DOI":"10.1007\/978-3-642-29124-1_12"},{"key":"2025120600292544637_j_jmc-2021-0017_ref_036","unstructured":"Craven MJ\n, \nWoodward JR\n. Instances for group-theoretic cryptology. 2020. Available at https:\/\/pearl.plymouth.ac.uk\/handle\/10026.1\/15752."},{"key":"2025120600292544637_j_jmc-2021-0017_ref_037","doi-asserted-by":"crossref","unstructured":"Hains DR\n, \nWhitley LD\n, \nHowe AE\n. Revisiting the big valley search space structure in the tsp. J Operat Res Soc. 2011;62(2):305\u201312.","DOI":"10.1057\/jors.2010.116"},{"key":"2025120600292544637_j_jmc-2021-0017_ref_038","doi-asserted-by":"crossref","unstructured":"Gryak J\n, \nKahrobaei D\n, \nMartinez-Perez C\n. On the conjugacy problem in certain metabelian groups. Glasgow Math J. 2019;61(2):251\u201369.","DOI":"10.1017\/S0017089518000198"},{"key":"2025120600292544637_j_jmc-2021-0017_ref_039","doi-asserted-by":"crossref","unstructured":"Gryak J\n, \nKahrobaei D\n. The status of polycyclic group-based cryptography: a survey and open problems. Groups Complexity Cryptol. 2016;8\n(2):\n171\u201386. Preprint version at https:\/\/arxiv.org\/abs\/1607.05819v2.","DOI":"10.1515\/gcc-2016-0013"},{"key":"2025120600292544637_j_jmc-2021-0017_ref_040","unstructured":"Kahrobaei D\n, \nNoce M\n. Algorithmic problems in engel groups and cryptographic applications. Int J Group Theory. 2020;8(4):231\u201350."},{"key":"2025120600292544637_j_jmc-2021-0017_ref_041","doi-asserted-by":"crossref","unstructured":"Gryak J\n, \nHaralick RM\n, \nKahrobaei D\n. Solving the conjugacy decision problem via machine learning. Exp Math. 2020;29(1):66\u201378.","DOI":"10.1080\/10586458.2018.1434704"},{"key":"2025120600292544637_j_jmc-2021-0017_ref_042","doi-asserted-by":"crossref","unstructured":"Myasnikov A\n, \nRoman\u2019kov V\n. A linear decomposition attack. Groups Complexity Cryptol. 2015;7(1):81\u201394.","DOI":"10.1515\/gcc-2015-0007"},{"key":"2025120600292544637_j_jmc-2021-0017_ref_043","doi-asserted-by":"crossref","unstructured":"Roman\u2019kov V\n. A nonlinear decomposition attack. Groups Complexity Cryptol. 2016;8(2):197\u2013207.","DOI":"10.1515\/gcc-2016-0017"}],"container-title":["Journal of Mathematical Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2021-0017\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2021-0017\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T00:30:34Z","timestamp":1764981034000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2021-0017\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,26]]},"references-count":43,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2022,2,10]]},"published-print":{"date-parts":[[2022,2,10]]}},"alternative-id":["10.1515\/jmc-2021-0017"],"URL":"https:\/\/doi.org\/10.1515\/jmc-2021-0017","relation":{},"ISSN":["1862-2984"],"issn-type":[{"type":"electronic","value":"1862-2984"}],"subject":[],"published":{"date-parts":[[2021,10,26]]}}}