1,404 research outputs found

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

    Get PDF
    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

    A Novel Latin Square Image Cipher

    Full text link
    In this paper, we introduce a symmetric-key Latin square image cipher (LSIC) for grayscale and color images. Our contributions to the image encryption community include 1) we develop new Latin square image encryption primitives including Latin Square Whitening, Latin Square S-box and Latin Square P-box ; 2) we provide a new way of integrating probabilistic encryption in image encryption by embedding random noise in the least significant image bit-plane; and 3) we construct LSIC with these Latin square image encryption primitives all on one keyed Latin square in a new loom-like substitution-permutation network. Consequently, the proposed LSIC achieve many desired properties of a secure cipher including a large key space, high key sensitivities, uniformly distributed ciphertext, excellent confusion and diffusion properties, semantically secure, and robustness against channel noise. Theoretical analysis show that the LSIC has good resistance to many attack models including brute-force attacks, ciphertext-only attacks, known-plaintext attacks and chosen-plaintext attacks. Experimental analysis under extensive simulation results using the complete USC-SIPI Miscellaneous image dataset demonstrate that LSIC outperforms or reach state of the art suggested by many peer algorithms. All these analysis and results demonstrate that the LSIC is very suitable for digital image encryption. Finally, we open source the LSIC MATLAB code under webpage https://sites.google.com/site/tuftsyuewu/source-code.Comment: 26 pages, 17 figures, and 7 table

    Bit-based cube rotation for text encryption

    Get PDF
    Today's rapid technological developments make information increasingly important. Not just its content, but the channels or media used for information distribution also need to be secured. Information security is an important aspect that requires serious attention. One of the most important parts of information security is implementation of encryption using certain methods or techniques. This study proposes bit-based cube rotation to secure a plaintext. The aim is to produce a ciphertext that satisfies the two properties of cryptography through diffusion to produce confusion. The result shows that in a normal sentence, there is a significant change in the ciphertext which has the highest avalanche effect value of 55.47% and a correlation coefficient of 0.115. This result proves that the bit-based cube rotation can produce a good ciphertext, where the encryption result is not influenced by its original text

    The Arena: An indoor mixed reality space

    Get PDF
    ln this paper, we introduce the Arena, an indoor space for mobile mixed reality interaction. The Arena includes a new user tracking system appropriate for AR/MR applications and a new Too/kit oriented to the augmented and mixed reality applications developer, the MX Too/kit. This too/kit is defined at a somewhat higher abstraction levei, by hiding from the programmer low-level implementation details and facilitating ARJMR object-oriented programming. The system handles, uniformly, video input, video output (for headsets and monitors), sound aurelisation and Multimodal Human-Computer Interaction in ARJMR, including, tangible interfaces, speech recognition and gesture recognition.info:eu-repo/semantics/publishedVersio

    A Review on Encryption and Decryption of Image using Canonical Transforms & Scrambling Technique

    Get PDF
    Data security is a prime objective of various researchers & organizations. Because we have to send the data from one end to another end so it is very much important for the sender that the information will reach to the authorized receiver & with minimum loss in the original data. Data security is required in various fields like banking, defence, medical etc. So our objective here is that how to secure the data. So for this purpose we have to use encryption schemes. Encryption is basically used to secure the data or information which we have to transmit or to store. Various methods for the encryption are provided by various researchers. Some of the methods are based on the random keys & some are based on the scrambling scheme. Chaotic map, logistic map, Fourier transform & Fractional Fourier transform etc. are widely used for the encryption process. Now day’s image encryption method is very popular for the encryption scheme. The information is encrypted in the form of image. The encryption is done in a format so no one can read that image. Only the person who are authenticated or have authentication keys can only read that data or information. So this work is based on the same fundamental concept. Here we use Linear Canonical Transform for the encryption process

    Through the Looking Glass: The Use of Lenses as an Interface Tool for Augmented Reality

    Get PDF
    Stephen N. Spencer The University of Washington Program Chairs Alan Chalmers Hock Soon Seah Publisher ACM Press New York, NY, US

    Comparing dynamitic difficulty adjustment and improvement in action game

    Get PDF
    A thesis submitted to the University of Bedfordshire in partial fulfilment of the requirements for the degree of Master ResearchDesigning a game difficulty is one of the key things as a game designer. Player will be feeling boring when the game designer makes the game too easy or too hard. In the past decades, most of single player games can allow players to choose the game difficulty either easy, normal or hard which define the overall game difficulty. In action game, these options are lack of flexibility and they are unsuitable to the player skill to meet the game difficulty. By using Dynamic Difficulty Adjustment (DDA), it can change the game difficulty in real time and it can match different player skills. In this paper, the final goal is the comparison of the three DDA systems in action game and apply an improved DDA. In order to apply a new improved DDA, this thesis will evaluate three chosen DDA systems with chosen action decision based AI for action game. A new DDA measurement formula is applied to the comparing section

    RAISE THE STRENGTH OF CRYPTOSYSTEM USING VARIETY EFFECTS

    Get PDF
    Nowadays, images became one of the most types of transmitted data through Internet. Some of these images carry secret information, therefore having an effective cryptosystem for hiding the information inside these images become an urgent need. Many traditional encryption methods are unable to achieve a high degree of protection for information. This paper presents nontraditional method for image encryption through applying substitution and transposition operations in different ways on both key and data. Series of (Linear and Circular), (Left, Right, Up and Down) rotation operations on (Bits and Bytes) of key and data are applied to make good confusion effects in the data. Moreover, XOR Boolean operations also applied on the key and data to make diffusion effects in the data. These two types of operations will produce a large set of keys. Using this large number of different keys in encrypting image will raise the strength of the encryption system used and achieve a high degree of protection for image. To test the security degree and performance of the encryption system, the system has been applied using different images and analyzing the results key space, key sensitivity, and statistical analysis and other criteria. From these tests, we can conclude that the encryption system can be used effectively to protect digital images

    RAISE THE STRENGTH OF CRYPTOSYSTEM USING VARIETY EFFECTS

    Get PDF
    Nowadays, images became one of the most types of transmitted data through Internet. Some of these images carry secret information, therefore having an effective cryptosystem for hiding the information inside these images become an urgent need. Many traditional encryption methods are unable to achieve a high degree of protection for information. This paper presents nontraditional method for image encryption through applying substitution and transposition operations in different ways on both key and data. Series of (Linear and Circular), (Left, Right, Up and Down) rotation operations on (Bits and Bytes) of key and data are applied to make good confusion effects in the data. Moreover, XOR Boolean operations also applied on the key and data to make diffusion effects in the data. These two types of operations will produce a large set of keys. Using this large number of different keys in encrypting image will raise the strength of the encryption system used and achieve a high degree of protection for image. To test the security degree and performance of the encryption system, the system has been applied using different images and analyzing the results key space, key sensitivity, and statistical analysis and other criteria. From these tests, we can conclude that the encryption system can be used effectively to protect digital images
    corecore