Provably Secure Encryption Schemes With Zero Setup and Linear Speed by Using Rubik’s Cubes

Abstract

and Telecommunications) (SKLNST-2020-2-16). ABSTRACT Recently, new paradigms for designing modern cryptographic schemes were proposed based on Rubik's rotations. However, most of them lack rigorous provable security reductions. Enlightened by this interesting progress, we present a novel method for designing encryption schemes by using Rubik's groups. Different from most naive designs of permutation ciphers based on Rubik's cubes, our proposals are probabilistic encryption schemes that combine some of the newest cryptographic primitives with modern coding theory. More specifically, under the intractability assumption of the conjugacy decision problem over Rubik's groups, the proposed schemes have provable security reductions (in the random oracle model). Furthermore, the proposed schemes have two remarkable performance advantages: zero setup and linear encryption/decryption speed. In addition, the processes of encoding/encryption and decryption/decoding are demonstrated graphically.

Image encryption scheme based on optical chaos and DNA Rubik’s cube algorithm

“…Rubik's Cube is a kind of educational toy invented by Rubik Ernő in 1974, which can be rotated to achieve the function of disruption and recovery and has many applications in the field of image encryption [14][15][16].…”

Color Image Encryption Scheme Based On Alternate Quantum Walk and Controlled Rubik’s Cube

“…The Rubik's Cube is to change the position of the sub-block by moving the sub-blocks, so as to realize the scrambling of the Rubik's Cube. Similarly, applying the Rubik's Cube transformation to image scrambling is to scramble the image by moving the position of the image pixels [39][40][41][42][43] . For a third-order Rubik's Cube, if a certain layer is rotated 90 degrees at a time, there are eighteen ways for rotation.…”