000			02294nab a2200289 c 4500
001			koha000719738
005			20211025115437.0
007			cr |
008			211013|2021 ru s a eng d
024	7		_a10.17223/2226308X/14/25 _2doi
035			_akoha000719738
040			_aRU-ToGU _brus _cRU-ToGU
100	1		_aRomankov, V. A. _9103792
245	1	3	_aAn improvement of cryptographic schemes based on the conjugacy search problem _cV. A. Roman'kov
336			_aТекст
337			_aэлектронный
504			_aБиблиогр.: 13 назв.
520	3		_aThe key exchange protocol is a method of securely sharing cryptographic keys over a public channel. It is considered as important part of cryptographic mechanism to protect secure communications between two parties. The Diffie — Hellman protocol, based on the discrete logarithm problem, which is generally difficult to solve, is the most well-known key exchange protocol. One of the possible generalizations of the discrete logarithm problem to arbitrary noncommutative groups is the so-called conjugacy search problem: given two elements g,h of a group G and the information that = h for some x G G, find at least one particular element x like that. Here gx stands for x-1gx. This problem is in the core of several known public key exchange protocols, most notably the one due to Anshel et al. and the other due to Ko et al. In recent years, effective algebraic cryptanalysis methods have been developed that have shown the vulnerability of protocols of this type. The main purpose of this short note is to describe a new tool to improve protocols based on the conjugacy search problem. This tool has been introduced by the author in some recent papers. It is based on a new mathematical concept of a marginal set.
653			_aкриптография
653			_aпротокол распределения ключей
653			_aалгоритмы
655		4	_aстатьи в журналах _9759384
773	0		_tПрикладная дискретная математика. Приложение _d2021 _g № 14. С. 114-118 _x2226-308X _wto000620992
852	4		_aRU-ToGU
856	4		_uhttp://vital.lib.tsu.ru/vital/access/manager/Repository/koha:000719738
908			_aстатья
999			_c719738