A Novel Image Encryption Using an Integration Technique of Blocks Rotation Based on the Magic Cube and the AES Algorithm

In recent years, several encryption algorithms have been proposed to protect digital images from cryptographic attacks. These encryption algorithms typically use a relatively small key space and therefore, provide safe, especially if they are of a dimension. In this paper proposes an encryption algorithm for a new image protection scheme based on the rotation of the faces of a Magic Cube. The original image is divided into six sub-images and these sub-images are divided amongst a number of blocks and attached to the faces of a Magic Cube. The faces are then scrambled using rotation of the Magic Cube. Then the rotated image is fed to the AES algorithm which is applied to the pixels of the image to encrypt the scrambled image. Finally, experimental results and security analysis show that the proposed image encryption scheme not only encrypts the picture to achieve perfect hiding, but the algorithm can also withstand exhaustive, statistical and differential attacks

Sneak

Secure multiparty computation (SMC) is a technique that allows multiple parties to jointly compute a function while keeping their inputs private. This technique has gained significant attention due to its potential applications in various fields, including privacy-preserving healthcare, politics and finance. SMC involves a set of protocols that enable parties to achieve secure computation and analysis. These protocols typically involve a trusted third party or a cryptographic algorithm that ensures the privacy of the inputs. Some popular cryptographic algorithms used in SMC include homomorphic encryption, secret sharing, and the one discussed in this thesis, denoted as the round-robin scramble. This thesis focuses on the realization of a secure system for analysing sensitive data across multiple nodes in a distributed network. The thesis discusses the approach, design, and implementation of such a system with emphasis on security, usability, and scalability. Security is of upper importance to prevent information disclosure, followed by usability to ensure practicality and ease of use. Scalability is addressed to accommodate networks of varying sizes. The proposed system, named Sneak, offers near-zero information disclosure by leveraging Python, enabling robust and valid complex analysis operations across distributed networks

From sequence-defined macromolecules to macromolecular pin codes

Dynamic sequence-defined oligomers carrying a chemically written pin code are obtained through a strategy combining multicomponent reactions with the thermoreversible addition of 1,2,4-triazoline-3,5-diones (TADs) to indole substrates. The precision oligomers are specifically designed to be encrypted upon heating as a result of the random reshuffling of the TAD-indole covalent bonds within the backbone, thereby resulting in the scrambling of the encoded information. The encrypted pin code can eventually be decrypted following a second heating step that enables the macromolecular pin code to be deciphered using 1D electrospray ionization-mass spectrometry (ESI-MS). The herein introduced concept of encryption/decryption represents a key advancement compared with current strategies that typically use uncontrolled degradation to erase and tandem mass spectrometry (MS/MS) to analyze, decipher, and read-out chemically encrypted information. Additionally, the synthesized macromolecules are coated onto a high-value polymer material, which demonstrates their potential application as coded product tags for anti-counterfeiting purposes

Small Pseudo-Random Families of Matrices: Derandomizing Approximate Quantum Encryption

A quantum encryption scheme (also called private quantum channel, or state randomization protocol) is a one-time pad for quantum messages. If two parties share a classical random string, one of them can transmit a quantum state to the other so that an eavesdropper gets little or no information about the state being transmitted. Perfect encryption schemes leak no information at all about the message. Approximate encryption schemes leak a non-zero (though small) amount of information but require a shorter shared random key. Approximate schemes with short keys have been shown to have a number of applications in quantum cryptography and information theory. This paper provides the first deterministic, polynomial-time constructions of quantum approximate encryption schemes with short keys. Previous constructions (quant-ph/0307104) are probabilistic--that is, they show that if the operators used for encryption are chosen at random, then with high probability the resulting protocol will be a secure encryption scheme. Moreover, the resulting protocol descriptions are exponentially long. Our protocols use keys of the same length as (or better length than) the probabilistic constructions; to encrypt $n$ qubits approximately, one needs $n+o(n)$ bits of shared key. An additional contribution of this paper is a connection between classical combinatorial derandomization and constructions of pseudo-random matrix families in a continuous space.Comment: 11 pages, no figures. In Proceedings of RANDOM 2004, Cambridge, MA, August 200

Body language, security and e-commerce

Security is becoming an increasingly more important concern both at the desktop level and at the network level. This article discusses several approaches to authenticating individuals through the use of biometric devices. While libraries might not implement such devices, they may appear in the near future of desktop computing, particularly for access to institutional computers or for access to sensitive information. Other approaches to computer security focus on protecting the contents of electronic transmissions and verification of individual users. After a brief overview of encryption technologies, the article examines public-key cryptography which is getting a lot of attention in the business world in what is called public key infrastructure. It also examines other efforts, such as IBM’s Cryptolope, the Secure Sockets Layer of Web browsers, and Digital Certificates and Signatures. Secure electronic transmissions are an important condition for conducting business on the Net. These business transactions are not limited to purchase orders, invoices, and contracts. This could become an important tool for information vendors and publishers to control access to the electronic resources they license. As license negotiators and contract administrators, librarians need to be aware of what is happening in these new technologies and the impact that will have on their operations