References
- D. Boneh and A. Silverberg, Applications of multilinear forms to cryptography, Contemp. Math. 324 (2003), pp. 71–90.
- W. Bosma, J. Cannon, and C. Playoust, The Magma algebra system I: The user language, J. Symbolic Comput. 24 (1997), pp. 235–265.
- D.F. Holt, B. Eick, and E.A. O'Brien, Handbook of Computational Group Theory, Chapman & Hall/CRC Press, London, 2005.
- D. Kahrobaei, A. Tortora, and M. Tota, Multilinear cryptography using nilpotent groups, Proceedings of Elementary Theory of Groups and Group Rings, and Related Topics conference. Conference held at Fairfield University and at the Graduate Center, CUNY, New York, NY, USA, November 1–2, 2018, De Gruyter, 2020, pp. 127–133.
- J.C. Lennox and D.J.S. Robinson, The Theory of Infinite Soluble Groups, Clarendon Press, Oxford, 2004.
- H. Liebeck, Concerning nilpotent wreath products, Math. Proc. Cambridge Philos. Soc., 58 (1962), pp. 443–451.
- A. Mahalanobis, A simple generalization of El-Gamal cryptosystem to non-abelian groups, Comm. Algebra 40 (2012), no. 9, pp. 3583–3596.
- A. Mahalanobis and P. Shinde, Bilinear cryptography using groups of nilpotency class 2, Cryptography and Coding, Proceedings of the 16th IMA International Conference, IMACC 2017, Oxford, UK, 2017, pp. 127–134.
- D.J.S. Robinson, A Course in the Theory of Groups, 2nd ed., Springer-Verlag, New York, 1996.
- V.A. Roman'kov, Discrete logarithm for nilpotent groups and cryptanalysis of polylinear cryptographic system, Prikl. Diskretn. Mat. Suppl. 12 (2019), pp. 154–160.
- P.W. Shor, Algorithms for quantum computation: Discrete logarithms and factoring, Proceedings of the 35th Annual Symposium on Foundations of Computer Science, Santa Fe, NM, USA, 1994, pp. 124–134.
- The GAP Group, GAP – groups, algorithms, and programming, version 4.11.0; software available at http://www.gap-system.org.