Lightweight structures of big numbers for cryptographic primitives in limited devices
2017pp. 289–293
Citations Over Time
Abstract
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.
Related Papers
- → A composable cryptographic library with nested operations(2003)35 cited
- → A Study on Fine-Grained Security Properties of Cryptographic Protocols for Formal Analysis Method with Reasoning(2018)2 cited
- → Keynote speaker 1: Global harmonization of cryptographic standards(2015)
- → Primitive Constituent Elements of Cryptographic Protocols(2018)
- → A New Security Proof of Practical Cryptographic Devices Based on Hardware, Software and Protocols(2011)