Skip to main content
Log in

Minimal logarithmic signatures for one type of classical groups

  • Original Paper
  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

Abstract

As a special type of factorization of finite groups, logarithmic signature (LS) is used as the main component of cryptographic keys for secret key cryptosystems such as PGM and public key cryptosystems like \(MST_1\), \(MST_2\) and \(MST_3\). An LS with the shortest length, called a minimal logarithmic signature (MLS), is even desirable for cryptographic applications. The MLS conjecture states that every finite simple group has an MLS. Recently, the conjecture has been shown to be true for general linear groups \(GL_n(q)\), special linear groups \(SL_n(q)\), and symplectic groups \(Sp_n(q)\) with q a power of primes and for orthogonal groups \(O_n(q)\) with q a power of 2. In this paper, we present new constructions of minimal logarithmic signatures for the orthogonal group \(O_n(q)\) and \(SO_n(q)\) with q a power of an odd prime. Furthermore, we give constructions of MLSs for a type of classical groups—the projective commutator subgroup \(P{\varOmega }_n(q)\).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5), 1484–1509 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bohli, J.M., Steinwandt, R., Vasco, M.I.G., Martínez, C.: Weak keys in \(MST_1\). Des. Codes Cryptogr. 37, 509–524 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  3. Lempken, W., Magliveras, S.S., van Trung, T., Wei, W.: A public key cryptosystem based on non-abelian finite groups. J. Cryptol. 22, 62–74 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  4. Magliveras, S.S.: Secret and public-key cryptosystems from group factorizations. Tatra Mt. Math. Publ. 25, 11–22 (2002)

    MathSciNet  MATH  Google Scholar 

  5. Magliveras, S.S., Memon, M.D.: Algebraic properties of cryptosystem PGM. J. Cryptol. 5, 167–183 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  6. 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. 15, 285–297 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  7. Marquardt, T., Svaba, P., Trung, Tran Van: Pseudorandom number generators based on random covers for finite groups. Des. Codes Cryptogr. 64, 209–220 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  8. Magliveras S.S.: A cryptosystem from logarithmic signatures of finite groups. In: Proceedings of the 29th Midwest Symposium on Circuits and Systems, pp. 972–975. Elsevier Publishing Company, Amsterdam (1986)

  9. Qu, M., Vanstone, S.A.: Factorizations of elementary abelian p-groups and their cryptographic significance. J. Cryptol. 7, 201–212 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  10. Hong, H., Wang, L., Yang, Y., Ahmad, H.: All exceptional groups of lie type have minimal logarithmic signatures. Appl. Algebra Eng. Commun. Comput. 25(4), 287–296 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  11. Hong, H., Wang, L., Yang, Y.: Minimal logarithmic signatures for the unitary group Un(q). Des. Codes Cryptogr 77(1), 179–191 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  12. Lempken, W., van Trung, T.: On minimal logarithmic signatures of finite groups. Exp. Math. 14, 257–269 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  13. Rahimipour, A.R., Ashrafi, A.R., Gholami, A.: The existence of minimal logarithmic signatures for the sporadic Suzuki and simple Suzuki groups. Cryptogr. Commun. 7(4), 535–542 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  14. Vasco, M.I.G., Rötteler, M., Steinwandt, R.: On minimal length factorizations of finite groups. Exp. Math. 12, 10–12 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  15. Holmes, P.E.: On minimal factorisations of sporadic groups. Exp. Math. 13, 435–440 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  16. Singhi, N., Singhi, N., Magliveras, S.S.: Minimal logarithmic signatures for finite groups of lie type. Des. Codes Cryptogr. 55, 243–260 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  17. Singhi, N., Singhi, N.: Minimal logarithmic signatures for classical groups. Dec. Codes Cryptogr. 60, 183–195 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  18. Garrett, P.: Buildings and Classical Groups. Chapman and Hall, London (1997)

    Book  MATH  Google Scholar 

  19. Wilson, R.A.: The Finite Simple Groups. Graduate Texts in Mathematics, vol. 251. Springer, London (2009)

    Book  Google Scholar 

  20. De Beule, J., Klein, A., Metsch, K., Storme, L.: Partial ovoids and partial spreads of classical finite polar spaces. Serdica Math. J. 34, 689–714 (2008)

    MathSciNet  MATH  Google Scholar 

  21. Kantor, W.M.: Spreads, translation planes and Kerdock sets I. SIAM J Algebr. Discret. Methods 3, 151–165 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  22. Thas, J.A.: Ovoids and spreads of finite classical polar spaces. Geom. Dedicata 10, 135–143 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  23. Dye, R.H.: Maximal subgroups of finite orthogonal groups stabilizing spreads of lines. J. Lond. Math. Soc. 33(2), 279–293 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  24. González Vasco, M.I., Steinwandt, R.: Obstacles in two public key cryptosystems based on group factorizations. Tatra Mt. Math. Publ. 25, 23–37 (2002)

    MathSciNet  MATH  Google Scholar 

  25. Cossidente, A., De Resmini, M.J.: Remarks on singer cyclic groups and their normalizers. Des. Codes Cryptogr. 32, 97–102 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  26. Babai, L., Pálfy, P.P., Saxl, J.: On the number of \(p\) regular elements in finite simple groups. LMS J. Comput. Math. 12, 82–119 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  27. Svaba, P., Trung, Tran van: Public key cryptosystem \(MST_3\): cryptanalysis and realization. J. Math. Cryptol. 3, 271–315 (2010)

    MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

This work is partially supported by the National Natural Science Foundation of China (NSFC) (Nos. 61602408,61502048,61370194), Open Foundation of State key Laboratory of Networking and Switching Technology (Beijing University of Posts and Telecommunications) (SKLNST-2016-1-05) and the NSFC A3 Foresight Program (No. 61411146001)

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Haibo Hong.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Hong, H., Wang, L., Ahmad, H. et al. Minimal logarithmic signatures for one type of classical groups. AAECC 28, 177–192 (2017). https://doi.org/10.1007/s00200-016-0302-y

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00200-016-0302-y

Keywords

Mathematics Subject Classification

Navigation