|
This article is cited in 1 scientific paper (total in 1 paper)
Modeling knapsack cryptosystems with Diophantine complexity
V. O. Osipyan, S. G. Spirina, A. S. Arutyunyan, V. V. Podkolzin Kuban State University
Abstract:
The class of systems of protection of the information with public key based upon the modernised knapsack's problem is considered. It is resulted various updatings of such systems containing Diophantos difficulties.
Received: 18.05.2010
Citation:
V. O. Osipyan, S. G. Spirina, A. S. Arutyunyan, V. V. Podkolzin, “Modeling knapsack cryptosystems with Diophantine complexity”, Chebyshevskii Sb., 11:1 (2010), 209–216
Linking options:
https://www.mathnet.ru/eng/cheb202 https://www.mathnet.ru/eng/cheb/v11/i1/p209
|
Statistics & downloads: |
Abstract page: | 224 | Full-text PDF : | 110 | References: | 50 | First page: | 1 |
|