Advanced Image Encryption & Decryption using Rubik’s Cube Technology

The world changing at a fast pace and more than ever there’s this need to secure data and preserve one’s privacy. Advanced algorithms and technologies that can be used for secure transmission of texts, images and videos are being tried and tested. We have used the Rubik’s Cube Technology for secure encryption and decryption of colored images.

Constructing the three-qudit unextendible product bases with strong nonlocality

The unextendible product bases (UPB) are interesting members of the family of orthogonal product bases. In this paper, we investigate the construction of 3-qudit UPB with strong nonlocality. First, a UPB set in ${{C}^{3}}\otimes {{C}^{3}}\otimes {{C}^{3}}$ of size 19 is presented based on the Shifts UPB. By mapping the system to a Rubik's Cube, we provide a general method of constructing UPB in ${{C}^{d}}\otimes {{C}^{d}}\otimes {{C}^{d}}$ of size ${{\left(d-1 \right)}^{3}}+2d+5$, whose corresponding Rubik's Cube is composed of four parts. Second, for the more general case where the dimensions of parties are different, we extend the classical tile structure to the 3-qudit system and propose the Tri-tile structure. By means of this structure, a ${{C}^{4}}\otimes {{C}^{4}}\otimes {{C}^{5}}$ system of size 38 is obtained based on a ${{C}^{3}}\otimes {{C}^{3}}\otimes {{C}^{4}}$ system of size 19. Then, we generalize this approach to ${{C}^{{{d}_{1}}}}\otimes {{C}^{{{d}_{2}}}}\otimes {{C}^{{{d}_{3}}}}$ system which also consists of four parts. Our research provides a positive answer to the open question raised in [Halder, et al., PRL, 122, 040403 (2019)], indicating that there do exist UPB that can exhibit strong quantum nonlocality without entanglement.

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

Aiming at solving the trouble that digital image information is easily intercepted and tampered during transmission, we proposed a color image encryption scheme based on alternate quantum random walk and controlled Rubik’s Cube transformation. At the first, the color image is separated into three channels: channel R, channel G and channel B. Besides, a random sequence is generated by alternate quantum walk. Then the six faces of the Rubik’s Cube are decomposed and arranged in a specific order on a two-dimensional plane, and each pixel of the image is randomly mapped to the Rubik’s Cube. The whirling of the Rubik’s Cube is controlled by a random sequence to realize image scrambling and encryption. The scrambled image acquired by Rubik’s Cube whirling and the random sequence received by alternate quantum walk are bitwise-XORed to obtain a single-channel encrypted image. Finally the three-channel image is merged to acquire the final encrypted image. The decryption procedure is the reverse procedure of the encryption procedure. The key space of this scheme is theoretically infinite. After simulation experiments, the information entropy after encryption reaches 7.999, the NPCR is 99.5978%, and the UACI is 33.4317%. The encryption scheme with high robustness and security has a excellent encryption effect which is effective to resist statistical attacks, force attacks, and other differential attacks.

An implementation of Hill cipher and 3x3x3 rubik's cube to enhance communication security

Message security is must be managed seriously. Therefore, to maintain the confidentiality of any message, cryptography is needed. Cryptography is a science that uses mathematics to encrypt and decrypt messages. Cryptography is used as a tool to protect messages, for example, national secrets and strategies. The method of this research is qualitative research with a literature review. This research implements a hybrid cryptographic algorithm by combining Hill cipher and 3x3x3 Rubik's cube methods with Python software simulation.

Iterative Deepening Dynamically Improved Bounds Bidirectional Search

This paper presents a new bidirectional search algorithm to solve the shortest path problem. The new algorithm uses an iterative deepening technique with a consistent heuristic to improve lower bounds on path costs. The new algorithm contains a novel technique of filtering nodes to significantly reduce the memory requirements. Computational experiments on the pancake problem, sliding tile problem, and Rubik’s cube show that the new algorithm uses significantly less memory and executes faster than A* and other state-of-the-art bidirectional algorithms. Summary of Contribution: Quickly solving single-source shortest path problems on graphs is important for pathfinding applications and is a core problem in both artificial intelligence and operations research. This paper attempts to solve large problems that do not easily fit into the available memory of a desktop computer, such as finding the optimal shortest set of moves to solve a Rubik’s cube, and solve them faster than existing algorithms.

Dissolving the value-price transformation Rubik's cube: A response to Steve Toms’ review of Accounting for Value

Toms disputes the Temporal Single-System Interpretation's claim to have refuted Bortkiewicz’s influential charge that Marx's transformation from values to prices is ‘inconsistent’. This is a claim that Bryer supports with a replacement cost accounting interpretation, which Toms asserts leaves the ‘problem’ an ‘unsolved’ Rubik's cube. This conclusion is seriously misleading, the note argues, which illustrates the dangers from failing to always take the ‘social turn’ in accounting history research.