Перейти к основному содержанию
AkademIndex

Продукты

Для разработчиков

AkademBaseскороОткрытый API экосистемы
Латиница
Статья

Algorithm Of The Electronic Digital Subscript On The Basis Of The Composition Of Computing Complexities

Д. Е. АкбаровDoctor Of Physics And Mathematics, Associate Professor, Department Of Mathematics Kokand Pedagogical Institute, Republic Of UzbekistanShukhratjon UmarovSenior Teacher, Department Of Information Technology, Fergana Branch Of The Tashkent University Of Information Technologies Named After Muhammad Al-Khwarizmi, Republic Of Uzbekistan
ABI

Аннотация

In article the new algorithm of a digital signature in composition of the existing difficulties is developed: discrete logarithming in a final field, decomposition of rather large natural number on simple multipliers, additions of points with rational coordinates of an elliptic curve. On the basis of a combination of difficulties of discrete logarithming on a final field with the characteristic of large number, decomposition of rather large odd number on simple multipliers and additions of points of an elliptic curve develops algorithm of a digital signature for formation. The conventional scheme (model) of a digital signature covers three processes: generation of keys of EDS; formation of EDS; check (authenticity confirmation) of EDS. The idea of a design of the offered algorithm allows modifying and increasing crypto stability with addition to other computing difficulties. It is intended for use in systems of information processing of different function during forming and confirmation of authenticity of digital signature.

Темы

Идентификаторы

Цитирования и источники

Показатели — AkademScholar · Скоро