Gennady Khalimov
Supplemental Material
Available for Download
pptx
p33-khalimov-supplement.pptx (3.1 MB)
Presentation slides
- N.R. Wagner and M.R. Magyarik, A public-key cryptosystem based on the word problem”, Proc. Advances in Cryptology – CRYPTO 1984, LNCS 196, Springer-Verlag (1985), 19–36.Google Scholar
Cross Ref
- K.H.Ko,S.J.Lee,J.H.Cheon,J.W.Han,J.Kang,andC.Park, “New public-key cryptosystem using braid groups”, in Advances in cryptology—CRYPTO 2000 ,vol.1880of Lecture Notes in Computer Science , pp. 166–183, Springer, Berlin, Germany, 2000.Google ScholarCross Ref
- B. Eick and D. Kahrobaei, “Polycyclic groups: a new platform for cryptology?” http://arxiv.org/abs/math/0411077.Google Scholar
- V. Shpilrain and A. Ushakov, “Thompsons group and public key cryptography”, in Applied Cryptography and Network Security, vol. 3531 of Lecture Notes in Computer Science, pp. 151–164, 2005.Google ScholarDigital Library
- D. Kahrobaei, C. Koupparis, and V. Shpilrain, “Public key exchange using matrices over group rings”, Groups, Complexity, and Cryptology ,vol.5,no.1,pp.97–115,2013.Google ScholarCross Ref
- 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, Elsevier Publishing, Amsterdam, The Netherlands, 1986.Google Scholar
- S.S.Magliveras andN.D.Memon,“Algebraic properties of cryptosystem PGM,” Journal of Cryptology ,vol.5,no.3,pp.167–183, 1992.Google ScholarDigital Library
- A. Caranti and F. Dalla Volta, “The round functions of cryptosystem PGM generate the symmetric group,” Designs, Codes and Cryptography ,vol.38,no.1,pp.147–155,2006.Google ScholarDigital Library
- S.S.Magliveras, D.R.Stinson,andT.vanTrung,“New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups”, Journal of Cryptology , vol. 15, no. 4, pp. 285–297, 2002.Google ScholarDigital Library
- W. Lempken, S.S. Magliveras, Tran van Trung and W. Wei, “A public key cryptosystem based on non-abelian finite groups”, J. of Cryptology, 22 (2009), 62–74.Google ScholarDigital Library
- S.S.Magliveras, P.Svaba, T.vanTrung, and P.Zajac,“On the security of a realization of cryptosystem MST3”, Tatra Mountains Mathematical Publications ,vol.41,pp.65–78,2008.Google Scholar
- P. Svaba and T. van Trung, “Public key cryptosystem MST3 cryptanalysis and realization”, Journal of Mathematical Cryptology,vol.4,no.3,pp.271–315,2010.Google ScholarCross Ref
- Y. Cong, H. Hong, J. Shao, S. Han, J. Lin and S. Zhao A New Secure Encryption Scheme Based on Group Factorization Problem. IEEExplore, November 20, 2019 Digital Object Identifier 10.1109/ACCESS.2019.2954672 https://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=8907845Google Scholar
- G. Khalimov,Y. Kotukh, S. Khalimova, Encryption scheme based on the extension of automorphism group of the Hermitian function field, Book of Abstract 20 th Central European Conference on Cryptology, Zagreb, Croatia, june 24-26, 2020, pp. 30–32Google Scholar
- W. Lempken and T. van Trung, “On minimal logarithmic signatures of finite groups,” Experimental Mathematics,vol.14, no. 3, pp. 257–269, 2005.Google ScholarCross Ref
- Rimhak Ree, A family of simple groups associated with the simple Lie algebra of type (G2), Amer.J. Math. 83 (1961), 432–462. MR 0138680 (25 #2123)Google ScholarCross Ref
- Gregor Kemper, Frank L¨ubeck, and Kay Magaard, Matrix generators for the Ree groups 2G2(q), Comm. Algebra 29 (2001), no. 1, 407–413. MR MR1842506 (2002e:20025)Google ScholarCross Ref
- Robert A. Wilson, The finite simple groups, Graduate Texts in Mathematics, vol. 251, Springer-Verlag London Ltd., London, 2009. MR 2562037 (2011e:20018)Google Scholar
- P. Svaba, “Covers and logarithmic signatures of finite groups in cryptography”, Dissertation, https://bit.ly/2Ws2D24Google Scholar
- G. Khalimov, Y. Kotukh, S. Khalimova, Encryption scheme based on the automorphism group of the Ree function field, The 7th International Conference on Internet of Things: Systems, Management and Security (IOTSMS 2020) Paris, France. December 14-16, 2020 Date Added to IEEE Xplore: 02 February 2021 ISBN Information: DOI: 10.1109/IOTSMS52051.2020.9340192Google Scholar
- G. Khalimov, G., Kotukh, S. Khalimova, MST3 cryptosystem based on a generalized Suzuki 2 - Groups // CEUR Workshop Proceedings, 2020, 2711, стр. 1–15.Google Scholar
- G.Khalimov, Y. Kotukh, S. Khalimova, MST3 cryptosystem based on the automorphism group of the hermitian function field // IEEE International Scientific-Practical Conference: Problems of Infocommunications Science and Technology, PIC S and T 2019 - Proceedings, 2019, стр. 865–868.Google Scholar
Recommendations
Lattice-based certificateless encryption scheme
Certificateless public key cryptography (CL-PKC) can solve the problems of certificate management in a public key infrastructure (PKI) and of key escrows in identity-based public key cryptography (ID-PKC). In CL-PKC, the key generation center (KGC) does ...
Proxy Re-encryption Scheme Based on SK Identity Based Encryption
IAS '09: Proceedings of the 2009 Fifth International Conference on Information Assurance and Security - Volume 02The concept of proxy re-cryptography comes from the work of Blaze,Bleumer, and Strauss in 1998\cite{Blaze:98}. The goal of proxy re-encryption is to securely enable the re-encryption of ciphertexts from one key to another, without relying on trusted ...
Secure public-key encryption scheme without random oracles
Since the first practical and secure public-key encryption scheme without random oracles proposed by Cramer and Shoup in 1998, Cramer-Shoup's scheme and its variants remained the only practical and secure public-key encryption scheme without random ...
Comments