{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T20:40:02Z","timestamp":1749588002522,"version":"3.41.0"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2016,9,13]],"date-time":"2016-09-13T00:00:00Z","timestamp":1473724800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2017,5]]},"DOI":"10.1007\/s11432-015-5479-3","type":"journal-article","created":{"date-parts":[[2016,9,20]],"date-time":"2016-09-20T11:59:24Z","timestamp":1474372764000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Minimum length key in MST cryptosystems","MST\u5bc6\u7801\u7cfb\u7edf\u4e2d\u6781\u5c0f\u957f\u5ea6\u5bc6\u94a5\u7684\u7814\u7a76"],"prefix":"10.1007","volume":"60","author":[{"given":"Haibo","family":"Hong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Licheng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haseeb","family":"Ahmad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yixian","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiguo","family":"Qu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,13]]},"reference":[{"key":"5479_CR1","doi-asserted-by":"crossref","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P Shor","year":"1997","unstructured":"Shor P. Polynomial time algorithms for prime factorization and discrete logarithms on quantum computers. SIAM J Comput, 1997, 26: 1484\u20131509","journal-title":"SIAM J Comput"},{"key":"5479_CR2","first-page":"317","volume":"3","author":"J Proos","year":"2003","unstructured":"Proos J, Zalka C. Shor\u2019s discrete logarithm quantum algorithm for elliptic curves. Quantum Inf Comput, 2003, 3: 317\u2013344","journal-title":"Quantum Inf Comput"},{"key":"5479_CR3","volume-title":"Electr Coll Comp Complex Report. No. 142.","author":"M Blaser","year":"2012","unstructured":"Blaser M. Noncommutativity makes determinants hard. Electr Coll Comp Complex Report. No. 142. 2012"},{"key":"5479_CR4","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s00450-006-0008-7","volume":"21","author":"M Rotteler","year":"2006","unstructured":"Rotteler M. Quantum algorithms: a survey of some recent results. Inf Forsch Entw, 2006, 21: 3\u201320","journal-title":"Inf Forsch Entw"},{"key":"5479_CR5","first-page":"19","volume-title":"Proceedings of CRYPTO\u201984 on Advances in Cryptology. Berlin: Springer","author":"N Wagner","year":"1985","unstructured":"Wagner N, Magyarik M. A public-key cryptosystem based on the word problem. In: Proceedings of CRYPTO\u201984 on Advances in Cryptology. Berlin: Springer, 1985. 19\u201336"},{"key":"5479_CR6","first-page":"166","volume-title":"Proceedings of 20th Annual International Cryptology Conference on Advances in Cryptology, Santa Barbara","author":"K Ko","year":"2000","unstructured":"Ko K, Lee S, Cheon J, et al. New public-key cryptosystem using braid groups. In: Proceedings of 20th Annual International Cryptology Conference on Advances in Cryptology, Santa Barbara, 2000. 166\u2013183"},{"key":"5479_CR7","unstructured":"Eick B, Kahrobaei D. Polycyclic groups: a new platform for cryptology. arXiv:math\/0411077"},{"key":"5479_CR8","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/11496137_11","volume-title":"Proceedings of 3rd International Conference on Applied Cryptography and Network Security, New York","author":"V Shpilrain","year":"2005","unstructured":"Shpilrain V, Ushakov A. Thompson\u2019s group and public key cryptography. In: Proceedings of 3rd International Conference on Applied Cryptography and Network Security, New York, 2005. 151\u2013164"},{"key":"5479_CR9","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1515\/gcc-2013-0007","volume":"5","author":"D Kahrobaei","year":"2013","unstructured":"Kahrobaei D, Koupparis C, Shpilrain V. Public key exchange using matrices over group rings. Groups Complexity Cryptol, 2013, 5: 97\u2013115","journal-title":"Groups Complexity Cryptol"},{"key":"5479_CR10","first-page":"972","volume-title":"Proceedings of 29th Midwest Symposium on Circuits and Systems. Amsterdam: Elsevier Publishing Company","author":"S S Magliveras","year":"1986","unstructured":"Magliveras S S. A cryptosystem from logarithmic signatures of finite groups. In: Proceedings of 29th Midwest Symposium on Circuits and Systems. Amsterdam: Elsevier Publishing Company, 1986. 972\u2013975"},{"key":"5479_CR11","first-page":"447","volume-title":"Proceedings of 9th Annual International Cryptology Conference, Santa Barbara","author":"S S Magliveras","year":"1989","unstructured":"Magliveras S S, Memon N D. Properties of cryptosystem PGM. In: Proceedings of 9th Annual International Cryptology Conference, Santa Barbara, 1989. 447\u2013460"},{"key":"5479_CR12","first-page":"61","volume":"79","author":"S S Magliveras","year":"1990","unstructured":"Magliveras S S, Memon N D. Complexity tests for cryptosystem PGM. Congr Numer, 1990, 79: 61\u201368","journal-title":"Congr Numer"},{"key":"5479_CR13","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BF02451113","volume":"5","author":"S S Magliveras","year":"1992","unstructured":"Magliveras S S, Memon N D. Algebraic properties of cryptosystem PGM. J Cryptol, 1992, 5: 167\u2013183","journal-title":"J Cryptol"},{"key":"5479_CR14","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/s10623-005-5667-z","volume":"38","author":"A Caranti","year":"2006","unstructured":"Caranti A, Volta D F. The round functions of cryptosystem PGM generate the symmetric group. Des Codes Cryptogr, 2006, 38: 147\u2013155","journal-title":"Des Codes Cryptogr"},{"key":"5479_CR15","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/s00145-001-0018-3","volume":"15","author":"S S Magliveras","year":"2002","unstructured":"Magliveras S S, Stinson D R, van Trung T. New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups. J Cryptol, 2002, 15: 285\u2013297","journal-title":"J Cryptol"},{"key":"5479_CR16","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 S S, van Trung T, et al. A public key cryptosystem based on non-abelian finite groups. J Cryptol, 2009, 22: 62\u201374","journal-title":"J Cryptol"},{"key":"5479_CR17","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1215\/ijm\/1255637483","volume":"7","author":"G Higman","year":"1963","unstructured":"Higman G. Suzuki 2-groups. Ill J Math, 1963, 7: 79\u201396","journal-title":"Ill J Math"},{"key":"5479_CR18","first-page":"1","volume":"41","author":"S S Magliveras","year":"2008","unstructured":"Magliveras S S, Svaba P, van Trung T, et al. On the security of a realization of cryptosystem MST3. Tatra Mt Math Publ, 2008, 41: 1\u201313","journal-title":"Tatra Mt Math Publ"},{"key":"5479_CR19","first-page":"321","volume":"3","author":"S R Blackburn","year":"2009","unstructured":"Blackburn S R, Cid C, Mullan C. Cryptanalysis of the MST3 public key cryptosystem. J Math Crypt, 2009, 3: 321\u2013338","journal-title":"J Math Crypt"},{"key":"5479_CR20","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s10623-010-9373-0","volume":"55","author":"M I Gonz\u00e1lez Vasco","year":"2010","unstructured":"Gonz\u00e1lez Vasco M I, P\u00e9rez del Pozo A L, Duarte P T. A note on the security of MST3. Des Codes Cryptogr, 2010, 55: 189\u2013200","journal-title":"Des Codes Cryptogr"},{"key":"5479_CR21","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1515\/jmc.2010.011","volume":"4","author":"P v Svaba","year":"2010","unstructured":"Svaba P, van Trung T. Public key cryptosystem MST3: cryptanalysis and realization. J Math Cryptol, 2010, 4: 271\u2013315","journal-title":"J Math Cryptol"},{"key":"5479_CR22","doi-asserted-by":"crossref","first-page":"630421","DOI":"10.1155\/2014\/630421","volume":"2014","author":"H B Hong","year":"2014","unstructured":"Hong H B, Li J, Wang L C, et al. A digital signature scheme based on MST3 cryptosystem. Math Probl Eng, 2014, 2014: 630421","journal-title":"Math Probl Eng"},{"key":"5479_CR23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/10586458.2003.10504708","volume":"12","author":"M I Gonz\u00e1lez Vasco","year":"2003","unstructured":"Gonz\u00e1lez Vasco M I, R\u00f6tteler M, Steinwandt R. On minimal length factorizations of finite groups. Exp Math, 2003, 12: 1\u201312","journal-title":"Exp Math"},{"key":"5479_CR24","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1080\/10586458.2004.10504552","volume":"13","author":"P E Holmes","year":"2004","unstructured":"Holmes P E. On minimal factorisations of sporadic groups. Exp Math, 2004, 13: 435\u2013440","journal-title":"Exp Math"},{"key":"5479_CR25","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1080\/10586458.2005.10128924","volume":"14","author":"W Lempken","year":"2005","unstructured":"Lempken W, van Trung T. On minimal logarithmic signatures of finite groups. Exp Math, 2005, 14: 257\u2013269","journal-title":"Exp Math"},{"key":"5479_CR26","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/s10623-010-9369-9","volume":"55","author":"N Singhi","year":"2010","unstructured":"Singhi N, Singhi N, Magliveras S S. Minimal logarithmic signatures for finite groups of Lie type. Des Codes Cryptogr, 2010, 55: 243\u2013260","journal-title":"Des Codes Cryptogr"},{"key":"5479_CR27","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/s10623-010-9427-3","volume":"60","author":"N Singhi","year":"2011","unstructured":"Singhi N, Singhi N. Minimal logarithmic signatures for classical groups. Des Codes Cryptogr, 2011, 60: 183\u2013195","journal-title":"Des Codes Cryptogr"},{"key":"5479_CR28","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/s00200-014-0226-3","volume":"25","author":"H B Hong","year":"2014","unstructured":"Hong H B, Wang L C, Yang Y X, et al. All exceptional groups of Lie type have minimal logarithmic signatures. Appl Algebr Eng Commun Comput, 2014, 25: 287\u2013296","journal-title":"Appl Algebr Eng Commun Comput"},{"key":"5479_CR29","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/s10623-014-9996-7","volume":"77","author":"H B Hong","year":"2015","unstructured":"Hong H B, Wang L C, Yang Y X. Minimal logarithmic signatures for the unitary group Un(q). Des Codes Cryptogr, 2015, 77: 179\u2013191","journal-title":"Des Codes Cryptogr"},{"key":"5479_CR30","unstructured":"Hong H B, Wang L C, Ahmad H, et al. Minimal logarithmic signatures for a type of classical groups. arXiv:1507.01163"},{"key":"5479_CR31","unstructured":"Hong H B, Wang L C, Ahmad H, et al. Minimal logarithmic signatures for sporadic groups. arXiv:1507.01162"},{"key":"5479_CR32","first-page":"23","volume":"25","author":"M I Gonz\u00e1lez Vasco","year":"2002","unstructured":"Gonz\u00e1lez Vasco M I, Steinwandt R. Obstacles in two public key cryptosystems based on group factorizations. Tatra Mt Math Publ, 2002, 25: 23\u201337","journal-title":"Tatra Mt Math Publ"},{"key":"5479_CR33","volume-title":"Atlas of Finite Groups","author":"J Conway","year":"1985","unstructured":"Conway J, Curtis R, Norton S, et al. Atlas of Finite Groups. Oxford: Clarendon Press, 1985"},{"key":"5479_CR34","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1023\/B:DESI.0000029214.50635.17","volume":"32","author":"A Cossidente","year":"2004","unstructured":"Cossidente A, de Resmini M J. Remarks on singer cyclic groups and their normalizers. Des Codes Cryptogr, 2004, 32: 97\u2013102","journal-title":"Des Codes Cryptogr"},{"key":"5479_CR35","doi-asserted-by":"crossref","first-page":"492","DOI":"10.4153\/CJM-1970-057-2","volume":"22","author":"M D Hestenes","year":"1970","unstructured":"Hestenes M D. Singer groups. Can J Math, 1970, 22: 492\u2013513","journal-title":"Can J Math"},{"key":"5479_CR36","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/BF01447417","volume":"10","author":"J A Thas","year":"1981","unstructured":"Thas J A. Ovoids and spreads of finite classical polar spaces. Geom Dedic, 1981, 10: 135\u2013143","journal-title":"Geom Dedic"},{"key":"5479_CR37","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1137\/0603015","volume":"3","author":"W M Kantor","year":"1982","unstructured":"Kantor W M. Spreads, translation planes and Kerdock sets. I. SIAM J Algebr Discret Meth, 1982, 3: 151\u2013165","journal-title":"I. SIAM J Algebr Discret Meth"},{"key":"5479_CR38","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84800-988-2","volume-title":"The Finite Simple Groups","author":"R A Wilson","year":"2009","unstructured":"Wilson R A. The Finite Simple Groups. London: Springer-Verlag, 2009"},{"key":"5479_CR39","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1007\/s12095-015-0129-6","volume":"7","author":"A R Rahimipour","year":"2015","unstructured":"Rahimipour A R, Ashrafi A R, Gholami A. The existence of minimal logarithmic signatures for some Suzuki and simple unitary. Cryptogr Commun, 2015, 7: 535\u2013542","journal-title":"Cryptogr Commun"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-015-5479-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-015-5479-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-015-5479-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T20:15:26Z","timestamp":1749586526000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-015-5479-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,13]]},"references-count":39,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2017,5]]}},"alternative-id":["5479"],"URL":"https:\/\/doi.org\/10.1007\/s11432-015-5479-3","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"type":"print","value":"1674-733X"},{"type":"electronic","value":"1869-1919"}],"subject":[],"published":{"date-parts":[[2016,9,13]]},"article-number":"052106"}}