Abstract
As a special factorization category of finite groups, logarithmic signature (LS) is used as the main component of cryptographic keys that operate within secret key cryptosystems such as PGM and public key cryptosystems like MST 1, MST 2 and MST 3. An LS with the shortest length is called a minimal logarithmic signature (MLS) that constitutes of the smallest sized blocks and offers the lowest complexity, and is therefore desirable for cryptographic constructions. However, the existence of MLSs for finite groups should be firstly taken into an account. The MLS conjecture states that every finite simple group has an MLS. If it holds, then by the consequence of Jordan-Hölder Theorem, every finite group would have an MLS. In fact, many cryptographers and mathematicians are keen for solving this problem. Some effective work has already been done in search of MLSs for finite groups. Recently, we have made some progress towards searching a minimal length key for MST cryptosystems and presented a theoretical proof of MLS conjecture.
创新点
根据有限单群的分类定理,本文利用有限群论、代数群论、射影几何等学科的相关理论给出了剩余四种单群极小对数签名的结构,最终从理论上完成MLS 猜想的证明,为MST 密码系统提供了广阔的应用平台。具体成果如下: (a) 给出了一类经典单群极小对数签名的构造。(b) 给出了一类经典单群—射影特殊酉群极小对数签名的构造。 (c) 构造了所有十类特殊李型群的极小对数签名。 (d) 构造了剩余十三类零散群的极小对数签名。
Similar content being viewed by others
References
Shor P. Polynomial time algorithms for prime factorization and discrete logarithms on quantum computers. SIAM J Comput, 1997, 26: 1484–1509
Proos J, Zalka C. Shor’s discrete logarithm quantum algorithm for elliptic curves. Quantum Inf Comput, 2003, 3: 317–344
Blaser M. Noncommutativity makes determinants hard. Electr Coll Comp Complex Report. No. 142. 2012
Rotteler M. Quantum algorithms: a survey of some recent results. Inf Forsch Entw, 2006, 21: 3–20
Wagner N, Magyarik M. A public-key cryptosystem based on the word problem. In: Proceedings of CRYPTO’84 on Advances in Cryptology. Berlin: Springer, 1985. 19–36
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–183
Eick B, Kahrobaei D. Polycyclic groups: a new platform for cryptology. arXiv:math/0411077
Shpilrain V, Ushakov A. Thompson’s group and public key cryptography. In: Proceedings of 3rd International Conference on Applied Cryptography and Network Security, New York, 2005. 151–164
Kahrobaei D, Koupparis C, Shpilrain V. Public key exchange using matrices over group rings. Groups Complexity Cryptol, 2013, 5: 97–115
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–975
Magliveras S S, Memon N D. Properties of cryptosystem PGM. In: Proceedings of 9th Annual International Cryptology Conference, Santa Barbara, 1989. 447–460
Magliveras S S, Memon N D. Complexity tests for cryptosystem PGM. Congr Numer, 1990, 79: 61–68
Magliveras S S, Memon N D. Algebraic properties of cryptosystem PGM. J Cryptol, 1992, 5: 167–183
Caranti A, Volta D F. The round functions of cryptosystem PGM generate the symmetric group. Des Codes Cryptogr, 2006, 38: 147–155
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–297
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–74
Higman G. Suzuki 2-groups. Ill J Math, 1963, 7: 79–96
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–13
Blackburn S R, Cid C, Mullan C. Cryptanalysis of the MST3 public key cryptosystem. J Math Crypt, 2009, 3: 321–338
González Vasco M I, Pérez del Pozo A L, Duarte P T. A note on the security of MST3. Des Codes Cryptogr, 2010, 55: 189–200
Svaba P, van Trung T. Public key cryptosystem MST3: cryptanalysis and realization. J Math Cryptol, 2010, 4: 271–315
Hong H B, Li J, Wang L C, et al. A digital signature scheme based on MST3 cryptosystem. Math Probl Eng, 2014, 2014: 630421
González Vasco M I, Rötteler M, Steinwandt R. On minimal length factorizations of finite groups. Exp Math, 2003, 12: 1–12
Holmes P E. On minimal factorisations of sporadic groups. Exp Math, 2004, 13: 435–440
Lempken W, van Trung T. On minimal logarithmic signatures of finite groups. Exp Math, 2005, 14: 257–269
Singhi N, Singhi N, Magliveras S S. Minimal logarithmic signatures for finite groups of Lie type. Des Codes Cryptogr, 2010, 55: 243–260
Singhi N, Singhi N. Minimal logarithmic signatures for classical groups. Des Codes Cryptogr, 2011, 60: 183–195
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–296
Hong H B, Wang L C, Yang Y X. Minimal logarithmic signatures for the unitary group Un(q). Des Codes Cryptogr, 2015, 77: 179–191
Hong H B, Wang L C, Ahmad H, et al. Minimal logarithmic signatures for a type of classical groups. arXiv:1507.01163
Hong H B, Wang L C, Ahmad H, et al. Minimal logarithmic signatures for sporadic groups. arXiv:1507.01162
González Vasco M I, Steinwandt R. Obstacles in two public key cryptosystems based on group factorizations. Tatra Mt Math Publ, 2002, 25: 23–37
Conway J, Curtis R, Norton S, et al. Atlas of Finite Groups. Oxford: Clarendon Press, 1985
Cossidente A, de Resmini M J. Remarks on singer cyclic groups and their normalizers. Des Codes Cryptogr, 2004, 32: 97–102
Hestenes M D. Singer groups. Can J Math, 1970, 22: 492–513
Thas J A. Ovoids and spreads of finite classical polar spaces. Geom Dedic, 1981, 10: 135–143
Kantor W M. Spreads, translation planes and Kerdock sets. I. SIAM J Algebr Discret Meth, 1982, 3: 151–165
Wilson R A. The Finite Simple Groups. London: Springer-Verlag, 2009
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–542
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Hong, H., Wang, L., Ahmad, H. et al. Minimum length key in MST cryptosystems. Sci. China Inf. Sci. 60, 052106 (2017). https://doi.org/10.1007/s11432-015-5479-3
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s11432-015-5479-3