Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Mikhail Andreevich Kupriyashin"'
Publikováno v:
Безопасность информационных технологий, Vol 22, Iss 4 (2015)
Keywords: In this paper, we propose a new approach to the definition of basic problems in a constructive enumeration of combinations of knapsack vector elements. The proposed approach provides a more even distribution of computational load on multipr
Externí odkaz:
https://doaj.org/article/fbc6c34768f54bf98a8ca9f1c24fb5ae
Publikováno v:
Безопасность информационных технологий, Vol 22, Iss 1 (2015)
The knapsack problem is known to be used in numerous public key ciphersystems designs. These ciphersystems have been receiving increased attention from analytics, resulting in many being compromised. Therefore, modern systems incorporate new algorith
Externí odkaz:
https://doaj.org/article/f9f41e2ca6664c2f855618ed8711690e
Publikováno v:
Безопасность информационных технологий, Vol 21, Iss 2 (2014)
To reduce the time complexity of the basic algorithm for solving the problem of the backpack, we proposed a computational scheme based on the use of the stack graph.
Externí odkaz:
https://doaj.org/article/ed58aa1065344e829580429ab81e5105
Publikováno v:
Безопасность информационных технологий, Vol 21, Iss 1 (2014)
A number of asymmetric cryptosystems (including one of the very first asymmetric cryptosystems – the Merkle–Hellman cryptosystem) are based on the knapsack problem. Many of these cryptosystems are proven either insecure or inapplicable due to ext
Externí odkaz:
https://doaj.org/article/3a0900585121426a91853b794ad7c24a
Publikováno v:
Безопасность информационных технологий, Vol 20, Iss 1, Pp 111-112 (2013)
The number of publications suggesting new asymmetric knapsack-based cipher system models has noticeably increased lately. The newly-suggested cryptosystems are currently considered to be sufficiently resistant. Never the less, it is advisable to deve
Externí odkaz:
https://doaj.org/article/b14670603d9d4babad7b6761a31b833d