Lightweight structures of big numbers for cryptographic primitives in limited devices

The new technological approaches bring us into the digital era, where data security is a part of our everyday lives. Nowadays cryptographic algorithms, which are also recommended by international security standards, are often developed for non-limited devices and they are not suitable for limited environments. This paper deals with a lightweight solution for the structure of big numbers, which should help with ordinary recommended cryptographic algorithms in limited devices. We introduce our lightweight structure and elementary algebra for cryptographic primitives based on non-limited OpenSSL library. Last but not least, we provide experimental measurements and verification on the real scenarios. © 2017 IEEE.

Авторы
Fujdiak R. 1, 2 , Mlynek P. 1, 2 , Bezzateev S.3 , Muka R.4 , Slacik J.5 , Misurec J.5 , Raso O.5
Сборник материалов конференции
Язык
Английский
Страницы
289-293
Статус
Опубликовано
Том
2017-November
Год
2018
Организации
  • 1 Peoples Friendship University of Russia, RUDN University, 6 Miklukho-Maklaya St, Moscow, 117198, Russian Federation
  • 2 Brno University of Technology, BUT University, Technicka 12, Brno, 61600, Czech Republic
  • 3 ITMO University, Kronverkskiy pr. 49, Saint-Petersburg, 197101, Russian Federation
  • 4 Norwegian University of Science and Technology, A Building A108, Teknologivegen 22, Gjovik, 2815, Norway
  • 5 Brno University of Technology, Tecnicka 12, Brno, 61600, Czech Republic
Ключевые слова
Big Numbers; Cryptographic Primitives; Elementary Algebra; Limited Devices
Дата создания
19.10.2018
Дата изменения
19.10.2018
Постоянная ссылка
https://repository.rudn.ru/ru/records/article/record/6912/
Поделиться

Другие записи