Papers
Topics
Authors
Recent
Search
2000 character limit reached

Pretty Modular Symmetric Encryption (PMSE), compact algorithm for ''embedded cryptography'' with quite low computational cost

Published 17 May 2019 in cs.CR | (1905.08150v1)

Abstract: Nowadays, the dataflux shared between IOT systems must be secured from 8-bits to 64-bits processors systems. Several symmetric cryptographic algorithm already exist such as AES (Advanced Encryption Standard), RC4, Blowfish, etc. In this work, we propose an 8-bits encryption algorithm, combining several ideas of standard symmetric encryption algorithms. The aim is to provide a efficient, modular and compact algorithm able to tend to truly random one-time-pad encryption quality even for large data flux. The algorithm combines the implementation of a divergent polynomial with variable coefficients for pseudo-random keys generation, variable bit swapping and bitwise operations on data, and the use of one or two passwords. The encryption has been evaluated statistically, tested for image encryption and compared with One-Time-Pad encryption on the same data. Three implementations have been tested respectively in C, Javascript and GNU Octave. Encryption time performances are compared with AES on a 8-bits architecture: the Arduino Uno (ATmega328) microcontroller. A new concept of self-decryptionable web encrypted object, called Blocksnet is also presented and tested as a potential application of the compact and embedded PMSE algorithm.

Citations (1)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.