350 rub
Journal Neurocomputers №9 for 2010 г.
Article in number:
Modular schemes of electronic digital signature
Authors:
R. G. Biyashev, S. E. Nyssanbayeva
Abstract:
In the work the systems of the electronic digital signature (EDS) developed on the basis of not resulted polynomial over the field of item polynomial notations (FIPN) are considered. FIPN Bases are GF (2). Application of FIPN by the development of algorithms of symmetric enciphering and EDS formation allows us to raise essentially their crypto stability. Cryptographic algorithms at which creation FIPN are applied, are called not conventional. Known approaches to construction of systems of the digital signature can be divided into three groups: 1) schemes on the basis of dissymmetric systems of enciphering; 2) schemes with specially developed procedures of formation and check of EDS; 3) schemes on the basis of symmetric systems of enciphering. Used by development of algorithms of EDS formation the not conventional approach belongs to the second group. At the not conventional approach to creation of cryptosystems substantial increase of efficiency of algorithms, reduction of lengths of hash-value and EDS, and also paralleling operations are possible. The increase of crypto stability about five orders is received. Dependence of crypto stability on length of the message is more linear than in the first algorithm of EDS formation on modules of the several superfluous bases. It is caused by presence of restrictions on a choice of the superfluous basis and on formation of a full key. Algorithms of the formation of an electronic digital signature in the non-positional polynomial notation are considered. Digital signatures are created on the modulo surplus bases. The cryptostability of created algorithms is investigated.
Pages: 9-13
References
  1. Акушский И. Я., Юдицкий Д. И. Машинная арифметика в остаточных классах. М.: Сов. радио. 1968.
  2. Бияшев Р. Г.Разработка и исследование методов сквозного повышения достоверности в системах обмена данными распределенных АСУ: Дис. ... докт. тех. наук. М. 1985.
  3. Амербаев В. М., Бияшев, Р. Г., Нысанбаева С. Е. Применение непозиционных систем счисления при криптографической защите // Изв. Нац. акад. наук Республики Казахстан. Сер. Физика. Математика. Алматы: Гылым. 2005. № 3. С. 84-89.
  4. Бияшев Р. Г., Нысанбаева С. Е. Моделирование генерации ключей в непозиционной полиномиальной системе счисления // Изв. ЮФУ. Технические науки. Тематический выпуск «Информационная безопасность» Таганрог: Изд-во ТТИ ЮФУ. 2007. № 1. С. 193-198.
  5. Моисил Гр. К.Алгебраическая теория дискретных автоматических устройств. М: Издательство иностранной литературы. 1963.
  6. СТ РК 1073-2007. Средства криптографической защиты информации / Общие технические требования. Введ. 2009. 01.01. Астана: 2009.