The Existence of Minimal Logarithmic Signatures for Some Finite Simple Groups

References

• [Abbott et al.] R. Abbott, J. Bray, S. Linton, S. Nickerson, S. Norton, R. Parker, I. Suleiman,J. Tripp, P. Walsh, and R. Wilson., ATLAS of Finite Group Representations – Version 3. Available online (http://brauer.maths.qmul.ac.uk/Atlas/v3/).
   Google Scholar
• [Dixon and Mortimer 96] J. D. Dixon and B. Mortimer, Permutation Groups, Graduate Texts in Mathematics. Vol. 163. New York: Springer-Verlag, 1996.
   Google Scholar
• [Giudici 06] M. Giudici., “Factorisations of Sporadic Simple Groups.” J. Algebra 304: 1 (2006), 311–323.
   Web of Science ®Google Scholar
• [González Vasco et al. 03] M. I. González Vasco, M. Rötteler and R. Steinwandt., “On Minimal Length Factorizations of Finite Groups.” Exp. Math. 12: 1 (2003), 1–12.
   Web of Science ®Google Scholar
• [González Vasco and Steinwandt 02] M. I. González Vasco and R. Steinwandt. “Obstacles in Two Public Key Cryptosystems Based on Group Factorizations.” Tatra Mt. Math. Publ. 25 (2002), 23–37.
   Google Scholar
• [Hering et al. 87] C. Hering, M. W. Liebeck, and J. Saxl. “The Factorization of the Finite Exceptional Groups of Lie Type.” J. Algebra 106 (1987), 517–527.
   Web of Science ®Google Scholar
• [Holmes 04] P. E. Holmes., “On Minimal Factorisations of Sporadic Groups.” Exp. Math. 13: 4 (2004), 435–440.
   Web of Science ®Google Scholar
• [Hong et al.] H. Hong, L. Wang, and Y. Yang., “Minimal Logarithmic Signatures for the Unitary Group Un(q).” Des. Codes Cryptogr. doi10.1007/s10623-014-9996-7.
   Google Scholar
• [Hong et al. 14] H. Hong, L. Wang, Y. Yang, and H. Ahmad., “All Exceptional Groups of Lie Type Have Minimal Logarithmic Signatures.” Appl. Aalgebra Eng. Commun. Comput. 25: 4 (2014), 287–296.
   Web of Science ®Google Scholar
• [Lempken and van Trung 05] W. Lempken and T. van Trung “On Minimal Logarithmic Signatures of Finite Groups.” Exp. Math. 14: 3 (2005), 257–269.
   Web of Science ®Google Scholar
• [Lempken et al. 09] W. Lempken, T. van Trung, S. S. Magliveras, and W. Wei. “A Public Key Cryptosystem Based on Non-abelian Finite Groups.” J. Cryptol. 22 (2009), 62–74.
   Web of Science ®Google Scholar
• [Li and Xia 16] C. H. Li and B. Xia, “Factorizations of Almost Simple Groups with a Solvable Factor, and Cayley Graphs of Solvable Groups.” arXiv:1408.0350v3, (2016).
   Google Scholar
• [Liebeck et al. 90] M. W. Liebeck, C. E. Praeger, and J. Saxl. “The Maximal Factorizations of the Finite Simple Groups and Their Authomorphism Groups.” Mem. Am. Math. Soc. 86:432 (1990), iv+151.
   Google Scholar
• [Magliveras 02] S. S. Magliveras.,“Secret- and Public-key Cryptosystems from Group Factorizations.” In Cryptology, edited by K. Nemoga and O. Groek. Tatra Mountains Mathematical Publications 25, Bratislava: Mathematical Institute, Slovak Academy of Sciences, 2002.
   Google Scholar
• [Magliveras et al. 02] S. S. Magliveras, D. R. Stinson and T. van Trung. “New Approaches to Designing Public Key Cryptosystems Using One-way Functions and Trapdoors in Finite Groups.” J. Cryptol. 15 (2002), 167–183.
   Web of Science ®Google Scholar
• [Magliveras and Memon 92] S. S. Magliveras and N. D. Memon. “Algebraic Properties of Cryptosystem PGM.” J. Cryptol. 5 (1992), 167–183.
   Google Scholar
• [Magliveras and Memon 90a] S. S. Magliveras and N. D. Memon Properties of Cryptosystem PGM, in Advances in Cryptology – Crypto ’89. Lecture Notes in Computer Science, 435. Berlin: Springer-Verlag, 1990. pp. 447–460.
   Google Scholar
• [Magliveras and Memon 90b] S. S. Magliveras and N. D. Memon “Complexity Tests for Cryptosystem PGM.” Congressus Numerantium 79 (1990) 61–68.
   Google Scholar
• [Magliveras 86]S. S. Magliveras., “A Cryptosystem from Logarithmic Signatures of Finite Groups.” In Proceedings of the 29th Midwest Symposium on Circuits and Systems, pp. 972–975. Amsterdam: Elsevier Publishing Company, 1986.
   Google Scholar
• [Magliveras 85]S. S. Magliveras, B. A. Oberg, and A. J. Surkan. “A New Random Number Generator from Permutation Groups.” Rend. Sem. Mat. Fis. Milano 54 (1985), 203–223.
   Google Scholar
• [Rahimipour et al. 15] A. R. Rahimipour, A. R. Ashrafi, and A. Gholami., “The Existence of Minimal Logarithmic Signatures for the Sporadic Suzuki and Simple Suzuki Groups.” Cryptogr. Commun. 7: 4 (2015), 535–542.
   Google Scholar
• [Singhi 11a] N. Singhi, “The Existence of Minimal Logarithmic Signatures for Classical Groups.” PhD Thesis, Florida Atlantic University, 2011a.
   Google Scholar
• [Singhi 11b] N. Singhi., “On the Minimal Logarithmic Signature Conjecture.” PhD Thesis, Florida Atlantic University, 2011b.
   Google Scholar
• [Singhi and Singhi 11] N. Singhi and N. Singhi “Minimal Logarithmic Signatures for Classical Groups.” Des. Codes Cryptogr. 60: 2 (2011), 183–195.
   Web of Science ®Google Scholar
• [Singhi et al. 10] N. Singhi, N. Singhi, and S. Magliveras., “Minimal Logarithmic Signatures for Finite Groups of Lie Type.” Des. Codes Cryptogr. 55: 2–3 (2010), 243–260.
   Web of Science ®Google Scholar
• [Svaba et al. 13] P. Svaba, T. van Trung, and P. Wolf. “Logarithmic Signatures for Abelian Groups and Their Factorization.” Tatra Mt. Math. Publ. 57 (2013), 21–33.
   Google Scholar
• [The GAP Team 12] The GAP Team.. GAP – Groups, Algorithms, and Programming. Version 4.5.5, 2012. Available online (http://www.gap-system.org).
   Google Scholar