RSA cryptosystem for Dedekind rings. (English) Zbl 1398.94151
Summary: May soon be invented quantum computer and some known cryptosystems (such as RSA) will be threatened breaking. This paper is aimed at establishing necessary conditions for the maximum possible algebraic generalization of the classical RSA algorithm. We substitute ideals of a Dedekind ring for integers. Ideals in Dedekind rings allow the unique decomposition into a product of maximal ideals, but may not be the principal ideals. Also we define Euler’s \(\varphi\)-function for ideal of a Dedekind ring and describe some properties of this function. We hope that our proposed method will help to develop algorithms for encryption, which is hard to crack using a quantum computer.
MSC:
| 94A60 | Cryptography |
| 11T71 | Algebraic coding theory; cryptography (number-theoretic aspects) |
| 13F05 | Dedekind, Prüfer, Krull and Mori rings and their generalizations |
Keywords:
algebraic cryptography; RSA; Dedekind ring; ideal; Euler’s function; algebraic numbers; cryptographic protocol; securityReferences:
| [1] | Buchmann, J.; Takagi, T.; Vollmer, U., No article title, High Primes and Misdemeanours: Lectures in Honour 60th Birthday of Hugh Cowie Williams, 41, 111-122 (2004) |
| [2] | Cross, J. T., No article title, The American Mathematical Monthly, 8, 518-528 (1983) · Zbl 0525.12001 · doi:10.2307/2322785 |
| [3] | A. N. El-Kassar, R. Haraty, and Y. A. Awad, Proceedings of the ISCA 18th International Conference on Computer Applications in Industry and Engineering (Honolulu, 2005), p. 298-303. |
| [4] | Gluhov, M. M., No article title, Mathematical Aspects of Cryptography, 1, 23-54 (2010) · Zbl 1469.94098 |
| [5] | Haraty, R. A.; El-Kassar, A. N.; Shibaro, B., No article title, Journal of Mathematics and Statistics, 1, 354-359 (2006) · Zbl 1142.94371 |
| [6] | A. Koval and B. S. Verkhovsky, 5th International Conference on Information Technology: New Generations (ITNG-2008), Las Vegas, USA, 2008 (Las Vegas, 2008), pp. 101-105. |
| [7] | K. A. Rodosskii, Euclidean Algorithm (Nauka, Moscow, 1988) [in Russian]. · Zbl 0631.13016 |
| [8] | H. P. F. Swinnerton-Dyer, ABrief Guide to Algebraic Number Theory (Cambridge Univ. Press, Cambridge, 2001). · Zbl 0963.11001 · doi:10.1017/CBO9781139173360 |
| [9] | M. Trifkovic, Algebraic Theory of Quadratic Numbers (Springer, New York, 2013). · Zbl 1280.11002 · doi:10.1007/978-1-4614-7717-4 |
| [10] | S. N. Tronin and K. A. Petikhova, International Conference “Algebra and Mathematical Logic: Theory and Applications”, Kazan, Russia, 2014 (Kazan Univ., 2014), pp. 148-149. |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
