References
- Anshel I, Anshel M, Goldfeld D, An algebraic method for public-key cryptography. Math Res Lett., 6 (1999), 287-291. doi: https://doi.org/10.4310/MRL.1999.v6.n3.a3
- Banin M, Tsaban, The discrete logarithm problem in Bergman’s non-representable ring. J. Math. Cryptol., 6(2) (2012), 171-182. doi: https://doi.org/10.1515/jmc-2012-0014
- Bellare, M., Desai, A., Pointcheval, D., Rogaway, P., Relations among notions of security for public key encryption schemes. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, 1462 (1998) Springer, Heidelberg.
- Dehornoy P, Braid-based cryptography. In: Group theory, statistics and cryptography, 533 (Contemporary Mathematics, vol. 360). American Mathematical Society, Providence (2004).
- Diffie W, Helman M, New Directions in Cryptography, IEEE Trans. Inf. Theory, 22 (1976), 644-654. doi: https://doi.org/10.1109/TIT.1976.1055638
- Elgamal T, A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inf. Theory, 31 (1985), 469-472. doi: https://doi.org/10.1109/TIT.1985.1057074
- Fraleigh J.B, A first course in abstract algebra. Addison Wesley Pub. Reading (1982).
- Hanoymak T, Kusmus O, On construction of cryptographic systems over units of group rings. Int. Electron. J. Pure Appl. Math., 9 (2015), 37-43.
- Hungerford T, (2003) Algebra. Springer, Eighth edition.
- Hurley B, Hurley T, Group ring cryptography, Int. J. Pure Appl. Math., 69 (2010), 67-86.
- Inam S, Ali R, A new ElGamal-like cryptosystem based on matrices over group ring. Neural Comput. & Applic. 29 (2018), 1279-1283. doi: https://doi.org/10.1007/s00521-016-2745-2
- Jonge W, Chaum D, Attacks on some RSA signatures. Advances in Cryptology., (1986), pp:18-27.
- Liu L., Ye J., Identity-based re-encryption scheme with light-weight re-encryption key generation, Journal of Discrete Mathematical Sciences and Cryptography, 21(1), 41-57, (2018) DOI: https://doi.org/10.1080/09720529.2016.1160513.
- Mahalanobis A, Are matrices useful in public-key cryptography. Int. Math. Forum 8 (2013), 1939-1953. doi: https://doi.org/10.12988/imf.2013.310187
- Mahalanobis A, The discrete logarithm problem in the group og nonsingular circulant matrices. Groups Complexity Cryptology 2 (2010), 83-39. doi: https://doi.org/10.1515/gcc.2010.006
- Menezes A, Oorschot P.V, Vanstone S, Handbook of Applied Cryptography, CRC Press (1996).
- Milies C.P, Sehgal S.K, An Introduction to Group Rings, Kluwer Academic Publisher, New York, (2002).
- Mumtaz M., Ping L., Forty years of attacks on the RSA cryptosystem: A brief survey, Journal of Discrete Mathematical Sciences and Cryptography, 22(1) (2019), 9-29, DOI: https://doi.org/10.1080/09720529.2018.1564201.
- Passman D.S, The algebraic structure of group rings. Wiley, New York, (1977).
- Rivest R.L, Shamir A, Adleman L, A method for obtaining digital signature and public key cryptosystems. Commun ACM, 21 (1978), 120-126. doi: https://doi.org/10.1145/359340.359342
- Rososhek S.K, Cryptosystems in automorphism groups of group rings of abelian groups. Fundamentalnaya I prikladnaya matematica 13(8) (2007), 157-164 (in Russian).
- Rososhek S.K, Cryptosystems in automorphism groups of group rings of abelian groups. J. Math. Sci., 154(3) (2008), 386-391. doi: https://doi.org/10.1007/s10958-008-9168-2.
- Shor P.W, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5) (1997), 1484-1509. doi: https://doi.org/10.1137/S0097539795293172
- Shpilrain V, Zapata G, Combinatorial group theory and public-key cryptography, arXiv:math/04100 (2004).
- Silverman J.H, Fast multiplication in finite fields GF(2n). In: CHES’99, LNCS, 1717 (1999), 122-134.