乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:55:43Z","timestamp":1743101743588,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":48,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819609437"},{"type":"electronic","value":"9789819609444"}],"license":[{"start":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T00:00:00Z","timestamp":1733961600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T00:00:00Z","timestamp":1733961600000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-0944-4_11","type":"book-chapter","created":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T05:54:13Z","timestamp":1733896453000},"page":"330-357","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the\u00a0Semidirect Discrete Logarithm Problem in\u00a0Finite Groups"],"prefix":"10.1007","author":[{"given":"Christopher","family":"Battarbee","sequence":"first","affiliation":[]},{"given":"Giacomo","family":"Borin","sequence":"additional","affiliation":[]},{"given":"Julian","family":"Brough","sequence":"additional","affiliation":[]},{"given":"Ryann","family":"Cartor","sequence":"additional","affiliation":[]},{"given":"Tobias","family":"Hemmert","sequence":"additional","affiliation":[]},{"given":"Nadia","family":"Heninger","sequence":"additional","affiliation":[]},{"given":"David","family":"Jao","sequence":"additional","affiliation":[]},{"given":"Delaram","family":"Kahrobaei","sequence":"additional","affiliation":[]},{"given":"Laura","family":"Maddison","sequence":"additional","affiliation":[]},{"given":"Edoardo","family":"Persichetti","sequence":"additional","affiliation":[]},{"given":"Angela","family":"Robinson","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Smith-Tone","sequence":"additional","affiliation":[]},{"given":"Rainer","family":"Steinwandt","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,12]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"L\u00e1szl\u00f3 Babai and Robert Beals. A polynomial-time theory of black box groups i. London Mathematical Society Lecture Note Series, pages 30\u201364, 1999","DOI":"10.1017\/CBO9781107360228.004"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"L\u00e1szl\u00f3 Babai, Robert Beals, and \u00c1kos Seress. Polynomial-time theory of matrix groups. In Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing, STOC \u201909, page 55-64, New York, NY, USA, 2009. Association for Computing Machinery","DOI":"10.1145\/1536414.1536425"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"L\u00e1szl\u00f3 Babai, Gene Cooperman, Larry Finkelstein, Eugene Luks, and \u00c1kos Seress. Fast monte carlo algorithms for permutation groups. In Proceedings of the twenty-third annual ACM symposium on Theory of computing, pages 90\u2013100, 1991","DOI":"10.1145\/103418.103435"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"L\u00e1szl\u00f3 Babai and Endre Szemer\u00e9di. On the complexity of matrix group problems i. In 25th Annual Symposium onFoundations of Computer Science, 1984., pages 229\u2013240. IEEE, 1984","DOI":"10.1109\/SFCS.1984.715919"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Reinhold Baer. Der reduzierte Rang einer Gruppe. Journal f\u00fcr die reine und angewandte Mathematik, 0214_0215: 146\u2013173, 1964. URL http:\/\/eudml.org\/doc\/150612","DOI":"10.1515\/crll.1964.214-215.146"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Christopher Battarbee, Delaram Kahrobaei, Ludovic Perret, and Siamak\u00a0F. Shahandashti. A subexponential quantum algorithm for the semidirect discrete logarithm problem, 2023","DOI":"10.1007\/978-3-031-62743-9_7"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Christopher Battarbee, Delaram Kahrobaei, Ludovic Perret, and Siamak\u00a0F. Shahandashti. Spdh-sign: Towards efficient, post-quantum group-based signatures. In Thomas Johansson and Daniel Smith-Tone, editors, Post-Quantum Cryptography, pages 113\u2013138, Cham, 2023. Springer Nature Switzerland","DOI":"10.1007\/978-3-031-40003-2_5"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Christopher Battarbee, Delaram Kahrobaei, and Siamak\u00a0F Shahandashti. Semidirect product key exchange: The state of play. Journal of Algebra and Its Applications, page 2550066, 2023","DOI":"10.1142\/S0219498825500665"},{"key":"11_CR9","unstructured":"Alexandre Borovik and Sukru Yalcinkaya. Steinberg presentations of black box classical groups in small characteristics, 2013"},{"key":"11_CR10","unstructured":"Alexandre Borovik and \u015e\u00fckr\u00fc Yal\u00e7\u0131nkaya. Natural representations of black box groups encrypting $$sl_2(\\mathbb{F}_q)$$, 2020"},{"key":"11_CR11","unstructured":"Alexander Bors. A bound on element orders in the holomorph of a finite group, 2015"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Peter\u00a0A. Brooksbank. Fast constructive recognition of black box symplectic groups. Journal of Algebra, 320 (2): 885\u2013909, 2008. ISSN 0021-8693. Computational Algebra","DOI":"10.1016\/j.jalgebra.2008.03.021"},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1112\/S1461157000000437","volume":"6","author":"Peter A Brooksbank","year":"2003","unstructured":"Brooksbank, Peter A.: Fast constructive recognition of black-box unitary groups. LMS Journal of Computation and Mathematics 6, 162\u2013197 (2003)","journal-title":"LMS Journal of Computation and Mathematics"},{"issue":"1","key":"11_CR14","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/j.jalgebra.2006.02.024","volume":"300","author":"Peter A Brooksbank","year":"2006","unstructured":"Brooksbank, Peter A., Kantor, William M.: Fast constructive recognition of black box orthogonal groups. Journal of Algebra 300(1), 256\u2013288 (2006)","journal-title":"Journal of Algebra"},{"key":"11_CR15","first-page":"95","volume":"3","author":"Peter A Brooksbank","year":"1999","unstructured":"Brooksbank, Peter A., Kantor, William M.: On constructive recognition of a black box psl (d, q). Groups and computation 3, 95\u2013111 (1999)","journal-title":"Groups and computation"},{"issue":"1","key":"11_CR16","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1515\/jmc-2021-0016","volume":"16","author":"Daniel Brown","year":"2015","unstructured":"Brown, Daniel, Koblitz, Neal, Legrow, Jason: Cryptanalysis of \u2018make\u2019. J. Math. Cryptol. 16(1), 98\u2013102 (2015)","journal-title":"J. Math. Cryptol."},{"issue":"4","key":"11_CR17","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1515\/jmc-2013-0038","volume":"8","author":"Andrew M Childs","year":"2014","unstructured":"Childs, Andrew M., Ivanyos, G\u00e1bor.: Quantum computation of discrete logarithms in semigroups. J. Math. Cryptol. 8(4), 405\u2013416 (2014)","journal-title":"J. Math. Cryptol."},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Marston Conder and Charles\u00a0R. Leedham-Green. Fast recognition of classical groups over large fields. Groups and computation, III (Columbus, OH, 1999), 8: 113\u2013121, 2001","DOI":"10.1515\/9783110872743.113"},{"issue":"3","key":"11_CR19","doi-asserted-by":"publisher","first-page":"1203","DOI":"10.1090\/S0002-9947-05-03756-6","volume":"358","author":"Marston Conder","year":"2006","unstructured":"Conder, Marston, Leedham-Green, Charles R., O\u2019Brien, Eamonn: Constructive recognition of $$PSL (2, q)$$. Trans. Amer. Math. Soc. 358(3), 1203\u20131221 (2006)","journal-title":"Trans. Amer. Math. Soc."},{"key":"11_CR20","volume-title":"Atlas of finite groups","author":"John H Conway","year":"1985","unstructured":"Conway, John H., Curtis, Robert T., Norton, Simon P., Parker, Richard A., Wilson, Robert A.: Atlas of finite groups. Oxford University Press, Eynsham (1985)"},{"key":"11_CR21","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1016\/j.jalgebra.2014.08.039","volume":"421","author":"Heiko Dietrich","year":"2015","unstructured":"Dietrich, Heiko, Leedham-Green, Charles R., O\u2019Brien, Eamonn A.: Effective black-box constructive recognition of classical groups. Journal of Algebra 421, 460\u2013492 (2015)","journal-title":"Journal of Algebra"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Daniel Gorenstein, Richard. Lyons, and Ron Solomon. The classification of finite simple groups. Number 3. Part I. American Mathematical Society, Providence, RI, 1998","DOI":"10.1090\/surv\/040.3"},{"issue":"10","key":"11_CR23","doi-asserted-by":"publisher","first-page":"4224","DOI":"10.1080\/00927872.2019.1581213","volume":"47","author":"Dima Grigoriev","year":"2019","unstructured":"Grigoriev, Dima, Shpilrain, Vladimir: Tropical cryptography ii: extensions by homomorphisms. Communications in Algebra 47(10), 4224\u20134229 (2019)","journal-title":"Communications in Algebra"},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"Maggie Habeeb, Delaram Kahrobaei, Charalambos Koupparis, and Vladimir Shpilrain. Public key exchange using semidirect product of (semi)groups. In International Conference on Applied Cryptography and Network Security, pages 475\u2013486. Springer, 2013","DOI":"10.1007\/978-3-642-38980-1_30"},{"key":"11_CR25","doi-asserted-by":"crossref","unstructured":"Muhammad Imran and G\u00e1bor Ivanyos. Efficient quantum algorithms for some instances of the semidirect discrete logarithm problem. Designs, Codes and Cryptography, 5 2024","DOI":"10.1007\/s10623-024-01416-8"},{"key":"11_CR26","doi-asserted-by":"crossref","unstructured":"G\u00e1bor Ivanyos, Fr\u00e9d\u00e9ric Magniez, and Miklos Santha. Efficient quantum algorithms for some instances of the non-abelian hidden subgroup problem. Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 263\u2013270, 2001","DOI":"10.1145\/378580.378679"},{"key":"11_CR27","doi-asserted-by":"crossref","unstructured":"Sebastian Jambor, Martin Leuner, Alice\u00a0C Niemeyer, and Wilhelm Plesken. Fast recognition of alternating groups of unknown degree. Journal of Algebra, 392: 315\u2013335, 2013","DOI":"10.1016\/j.jalgebra.2013.06.005"},{"key":"11_CR28","doi-asserted-by":"crossref","unstructured":"Delaram Kahrobaei and Vladimir Shpilrain. Using semidirect product of (semi) groups in public key cryptography. In Arnold Beckmann, Laurent Bienvenu, and Nata\u0161a Jonoska, editors, Pursuit of the Universal, pages 132\u2013141, Cham, 2016. Springer International Publishing","DOI":"10.1007\/978-3-319-40189-8_14"},{"issue":"9","key":"11_CR29","doi-asserted-by":"publisher","first-page":"4895","DOI":"10.1090\/S0002-9947-2013-05822-9","volume":"365","author":"WM Kantor","year":"2013","unstructured":"Kantor, W.M., Magaard, K.: Black box exceptional groups of Lie type. Trans. Amer. Math. Soc. 365(9), 4895\u20134931 (2013)","journal-title":"Trans. Amer. Math. Soc."},{"key":"11_CR30","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1016\/j.jalgebra.2014.09.003","volume":"421","author":"WM Kantor","year":"2015","unstructured":"Kantor, W.M., Magaard, K.: Black box exceptional groups of lie type ii. Journal of Algebra 421, 524\u2013540 (2015)","journal-title":"Journal of Algebra"},{"key":"11_CR31","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.jalgebra.2014.08.014","volume":"421","author":"William M Kantor","year":"2015","unstructured":"Kantor, William M., Kassabov, Martin: Black box groups isomorphic to pgl (2, 2e). Journal of Algebra 421, 16\u201326 (2015)","journal-title":"Journal of Algebra"},{"issue":"1","key":"11_CR32","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1112\/plms\/s3-60.1.89","volume":"3","author":"Wolfgang Kimmerle","year":"1990","unstructured":"Kimmerle, Wolfgang, Lyons, Richard, Sandling, Robert, Teague, David N.: Composition factors from the group ring and artin\u2019s theorem on orders of simple groups. Proceedings of the London Mathematical Society 3(1), 89\u2013122 (1990)","journal-title":"Proceedings of the London Mathematical Society"},{"key":"11_CR33","unstructured":"Stefan Kohl. A bound on the order of the outer automorphism group of a finite simple group of given order, 2003. Available at https:\/\/stefan-kohl.github.io\/preprints\/outbound.pdf"},{"key":"11_CR34","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1515\/9783110872743.229","volume":"3","author":"Charles R Leedham-Green","year":"2001","unstructured":"Leedham-Green, Charles R.: The computational matrix group project. Groups and computation 3, 229\u2013248 (2001)","journal-title":"Groups and computation"},{"key":"11_CR35","unstructured":"Andrew Mendelsohn, Edmund Dable-Heath, and Cong Ling. A Small Serving of Mash: (Quantum) Algorithms for SPDH-Sign with Small Parameters. Cryptology ePrint Archive, Paper 2023\/1963, 2023. URL https:\/\/eprint.iacr.org\/2023\/1963"},{"key":"11_CR36","unstructured":"Chris Monico. Remarks on MOBS and cryptosystems using semidirect products, 2021"},{"key":"11_CR37","unstructured":"Chris Monico and Ayan Mahalanobis. A remark on MAKE \u2013 a Matrix Action Key Exchange, 2020"},{"issue":"1","key":"11_CR38","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1515\/gcc-2015-0007","volume":"7","author":"Alexei Myasnikov","year":"2015","unstructured":"Myasnikov, Alexei, Roman\u2019kov, Vitali\u01d0: A linear decomposition attack. Groups Complexity Cryptology 7(1), 81\u201394 (2015)","journal-title":"Groups Complexity Cryptology"},{"key":"11_CR39","unstructured":"NIST. Post-Quantum Cryptography Standardization, 2017. URL: https:\/\/csrc.nist.gov\/Projects\/Post-Quantum-Cryptography"},{"key":"11_CR40","doi-asserted-by":"crossref","unstructured":"Eamonn\u00a0A O\u2019Brien. Algorithms for matrix groups. London Math. Soc. Lecture Note Ser, 388: 297\u2013323, 2011","DOI":"10.1017\/CBO9780511842474.002"},{"issue":"1","key":"11_CR41","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1515\/jmc-2020-0053","volume":"16","author":"Nael Rahman","year":"2022","unstructured":"Rahman, Nael, Shpilrain, Vladimir: Make: A matrix action key exchange. J. Math. Cryptol. 16(1), 64\u201372 (2022)","journal-title":"J. Math. Cryptol."},{"key":"11_CR42","unstructured":"Nael Rahman and Vladimir Shpilrain. MOBS (Matrices Over Bit Strings) public key exchange. Cryptology ePrint Archive, Paper 2021 \/560, 2021. URL https:\/\/eprint.iacr.org\/2021\/560"},{"key":"11_CR43","unstructured":"Vitali\u012d Roman\u2019kov. Linear decomposition attack on public key exchange protocols using semidirect products of (semi) groups, 2015"},{"key":"11_CR44","doi-asserted-by":"crossref","unstructured":"Martin Seysen. Python implementation of the monster group. GitHub repository, 2024. URL https:\/\/github.com\/Martin-Seysen\/mmgroup","DOI":"10.1016\/j.jaca.2024.100012"},{"key":"11_CR45","doi-asserted-by":"crossref","unstructured":"Daniel Shanks. Class number, a theory of factorization, and genera. In Proceedings of Symposia in Pure Mathematics, 1971","DOI":"10.1090\/pspum\/020\/0316385"},{"key":"11_CR46","doi-asserted-by":"crossref","unstructured":"Peter\u00a0W. Shor. Algorithms for quantum computation: discrete logarithms and factoring. In Proceedings 35th Annual Symposium on Foundations of Computer Science, pages 124\u2013134, 1994","DOI":"10.1109\/SFCS.1994.365700"},{"key":"11_CR47","doi-asserted-by":"crossref","unstructured":"Victor Shoup. Lower bounds for discrete logarithms and related problems. In Walter Fumy, editor, Advances in Cryptology \u2014 EUROCRYPT \u201997, pages 256\u2013266, Berlin, Heidelberg, 1997. Springer Berlin Heidelberg","DOI":"10.1007\/3-540-69053-0_18"},{"key":"11_CR48","doi-asserted-by":"crossref","unstructured":"Robert\u00a0A. Wilson. The Finite Simple Groups, volume 251 of Graduate Texts in Mathematics. Springer, 2009","DOI":"10.1007\/978-1-84800-988-2"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-0944-4_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T06:12:25Z","timestamp":1733897545000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0944-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,12]]},"ISBN":["9789819609437","9789819609444"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0944-4_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,12,12]]},"assertion":[{"value":"12 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kolkata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}