Detail publikace

Lightweight Structures of Big Numbers for Cryptographic Primitives in Limited Devices

Originální název

Lightweight Structures of Big Numbers for Cryptographic Primitives in Limited Devices

Anglický název

Lightweight Structures of Big Numbers for Cryptographic Primitives in Limited Devices

Jazyk

en

Originální abstrakt

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.

Anglický abstrakt

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.

BibTex


@inproceedings{BUT141459,
  author="Radek {Fujdiak} and Petr {Mlýnek} and Sergey {Bezzateev} and Ján {Sláčik} and Jiří {Mišurec} and Ondřej {Rášo}",
  title="Lightweight Structures of Big Numbers for Cryptographic Primitives in Limited Devices",
  annote="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.",
  booktitle="2017 9th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT)",
  chapter="141459",
  doi="10.1109/ICUMT.2017.8255191",
  howpublished="online",
  year="2017",
  month="november",
  pages="289--293",
  type="conference paper"
}