Linear decomposition method in analyzing hidden information protocols on algebraic platforms

V. A. Roman'kov

Algebra i logika, Tome 54 (2015) no. 1, pp. 119-128.

Bibliographie

[1] W. Diffie, M. E. Hellman, “New directions in cryptography”, IEEE Trans. Inf. Theory, 22 (1976), 644–654 | DOI | MR | Zbl

[2] T. Elgamal, “A public key cryptosystem and a signature scheme based on discrete logarithms”, IEEE Trans. Inf. Theory, 31:4 (1985), 469–472 | DOI | MR | Zbl

[3] M. M. Glukhov, I. A. Kruglov, A. B. Pichkur, A. V. Cheremushkin, Vvedenie v teoretiko-chislovye metody kriptografii, Lan, Sankt-Peterburg, 2011

[4] V. A. Romankov, Vvedenie v kriptografiyu, Kurs lektsii, Forum, M., 2012

[5] A. Myasnikov, V. Shpilrain, A. Ushakov, Group-based cryptography, Adv. Courses Math. CRM Barselona, Birkhäuser, Basel, 2008 | MR | Zbl

[6] A. Miasnikov, V. Shpilrain, A. Ushakov, Non-commutative cryptography and complexity of group theoretic problems, Math. Surveys Monogr., 177, Am. Math. Soc., Providence, RI, 2011 | DOI | MR

[7] P. Dehornoy, “Braid-based cryptography”, Group theory, statistics, and cryptography, AMS special session combinatorial and statistical group theory (New York Univ., NY, USA, April 12–13, 2003), Contemp. Math., 360, eds. A. G. Myasnikov et al., Am. Math. Soc., Providence, RI, 2004, 5–33 | DOI | MR | Zbl

[8] V. Shpilrain, G. Zapata, “Combinatorial group theory and public key cryptography”, Appl. Algebra Eng. Commun. Comput., 17:3/4 (2006), 291–302 | DOI | MR | Zbl

[9] V. Shpilrain, G. Zapata, “Using decision problems in public key cryptography”, Groups Complex. Cryptol., 1:1 (2009), 33–49 | DOI | MR | Zbl

[10] V. A. Romankov, “Diofantova kriptografiya na beskonechnykh gruppakh”, Prikl. diskr. matem., 2012, no. 2, 15–42

[11] B. Fine, M. Habeeb, D. Kahrobaei, G. Rosenberger, “Aspects of nonabelian group based cryptography: a survey and open problems”, JP J. Algebra Number Theory Appl., 21:1 (2011), 1–40 | MR | Zbl

[12] V. Shpilrain, A. Ushakov, “The conjugacy search problems in public key cryptography: unecessary and insufficient”, Appl. Algebra Eng. Commun. Comput., 17:3/4 (2006), 285–289 | DOI | MR | Zbl

[13] V. Shpilrain, Razdel PersonalPages/Shpilrain, Vladimir/Cryptology ePrint Archive, www.grouptheory.info

[14] V. A. Romankov, Algebraicheskaya kriptografiya, Izd-vo OmGU, Omsk, 2013

[15] V. A. Romankov, “Kriptograficheskii analiz nekotorykh skhem shifrovaniya, ispolzuyuschikh avtomorfizmy”, Prikl. diskr. matem., 2013, no. 3, 35–51

[16] K. H. Ko, S. J. Lee, J. H. Cheon, J. W. Han, J. Kang, C. Park, “New public-key cryptosystem using braid groups”, Advances in cryptology – CRYPTO 2000, Proceedings 20th annual int. conf. (Santa Barbara, CA, USA, August 20–24, 2000), Lect. Notes Comput. Sci., 1880, ed. M. Bellare, Springer-Verlag, Berlin, 2000, 166–183 | DOI | MR | Zbl

[17] M. Habeeb, D. Kahrobaei, C. Koupparis, V. Shpilrain, Public key exchange using semidirect product of (semi)groups, 24 Apr. 2013, 12 pp., arXiv: 1304.6572v1[cs.CR]

[18] D. Kahrobaei, B. Khan, “A non-commutative generalization of ElGamal key exchange using polycyclic groups”, GLOBECOM'06, Global telecomm. conf., IEEE, 2006, 1–5

[19] D. Kahrobaei, C. Koupparis, V. Schpilrain, “Public key exchange using matrices over group rings”, Groups Complex. Cryptol., 5:1 (2013), 97–115 | DOI | MR | Zbl

[20] A. Mahalanobis, “The Diffie-Hellman key exchange protocol and non-Abelian nilpotent groups”, Isr. J. Math., 165 (2008), 161–187 | DOI | MR | Zbl

[21] V. Shpilrain, A. Ushakov, “A new key exchange protocol based on the decomposition problem”, Algebraic methods in cryptography, AMS/DMV joint int. meeting (June 16–19, 2005, Mainz, Germany), Int. workshop on algebraic methods in cryptography (November 17–18, 2005, Bochum, Germany), Contemp. Math., 418, eds. L. Gerritzen et al., Am. Math. Soc., Providence, RI, 2006, 161–167 | DOI | MR | Zbl

[22] L. Wang, L. Wang, Z. Cao, E. Okamoto, J. Shao, “New constructions of publickey encryption schemes from conjugacy search problems”, Information security and cryptology, 6th int. conf. Inscrypt 2010 (Shanghai, China, October 20–24, 2010), Revised selected papers, Lect. Notes Comput. Sci., 6584, eds. Xuejia Lai et al., Springer-Verlag, Berlin, 2011, 1–17 | DOI | MR | Zbl

[23] A. V. Gribov, P. A. Zolotykh, A. V. Mikhalev, “Postroenie algebraicheskoi kriptosistemy nad kvazigruppovym koltsom”, Matem. vopr. kriptogr., 1:4 (2010), 23–32

[24] V. T. Markov, A. V. Mikhalev, A. V. Gribov, P. A. Zolotykh, S. S. Skazhenik, “Kvazigruppy i koltsa v kodirovanii i postroenii kriptoskhem”, Prikl. diskr. matem., 2012, no. 4, 31–52

[25] S. K. Rososhek, “Kriptosistemy gruppovykh kolets”, Vestn. Tomsk. gos. un-ta. Matem. mekhan., 2003, no. 6, 57–62

[26] S. K. Rososhek, “Kriptosistemy v gruppakh avtomorfizmov gruppovykh kolets abelevykh grupp”, Fundament. i prikl. matem., 13:3 (2007), 157–164 | MR | Zbl

[27] B. Hurley, T. Hurley, Group ring cryptography, 9 Apr 2011, 20 pp., arXiv: 1104.1724v1[math.GR] | MR

[28] T. Hurley, Cryptographic schemes, key exchange, public key, May 2013, 19 pp., arXiv: 1305.4063v1[cs.CR]

[29] L. Babai, R. Beals, Á. Seress, “Polynomial-time theory of matrix groups”, Proc. of the 41st annual ACM symposium on theory of computing, STOC'09 (Bethesda, MD, USA, May 31 – June 2, 2009), Association for Computing Machinery (ACM), New York, NY, 2009, 55–64 | DOI | MR | Zbl

[30] A. S. Detinko, B. Eick, D. L. Flannery, “Computing with matrix groups over infinite fields”, Groups St. Andrews 2009, Sel. papers of the conf. (Univ. of Bath, Bath, UK, August 2009), v. I, London Math. Soc. Lecture Note Ser., 387, eds. C. M. Campbell et al., Cambridge Univ. Press, Cambridge, 2011, 256–270 | MR | Zbl