Optical Encryption using Photon-Counting Polarimetric Imaging

We present a polarimetric-based optical encoder for image encryption and verification. A system for generating random polarized vector keys based on a Mach-Zehnder configuration combined with translucent liquid crystal displays in each path of the interferometer is developed. Polarization information of the encrypted signal is retrieved by taking advantage of the information provided by the Stokes parameters. Moreover, photon-counting model is used in the encryption process which provides data sparseness and nonlinear transformation to enhance security. An authorized user with access to the polarization keys and the optical design variables can retrieve and validate the photon-counting plain-text. Optical experimental results demonstrate the feasibility of the encryption method.

An Approach Towards The Development Of An Efficient Symmetric Key Encryption Scheme

n the recent years protection of information in digital form is becoming more important. Image and video encryption has applications in various fields including Internet communications, multimedia systems, medical imaging, Tele-medicine and military communications. During storage as well as in transmission, the multimedia information is being exposed to unauthorized entities unless otherwise adequate security measures are built around the information system. There are many kinds of security threats during the transmission of vital classified information through insecure communication channels. Various encryption schemes are available today to deal with information security issues. Data encryption is widely used to protect sensitive data against the security threat in the form of “attack on confidentiality”. Secure transmission of information through insecure communication channels also requires encryption at the sending side and decryption at the receiving side. Encryption of large text message and image takes time before they can be transmitted, causing considerable delay in successive transmission of information in real-time. In order to minimize the latency, efficient encryption algorithms are needed. An encryption procedure with adequate security and high throughput is sought in multimedia encryption applications. Traditional symmetric key block ciphers like Data Encryption Standard (DES), Advanced Encryption Standard (AES) and Escrowed Encryption Standard (EES) are not efficient when the data size is large. With the availability of fast computing tools and communication networks at relatively lower costs today, these encryption standards appear to be not as fast as one would like. High throughput encryption and decryption are becoming increasingly important in the area of high-speed networking. Fast encryption algorithms are needed in these days for high-speed secure communication of multimedia data. It has been shown that public key algorithms are not a substitute for symmetric-key algorithms. Public key algorithms are slow, whereas symmetric key algorithms generally run much faster. Also, public key systems are vulnerable to chosen plaintext attack. In this research work, a fast symmetric key encryption scheme, entitled “Matrix Array Symmetric Key (MASK) encryption” based on matrix and array manipulations has been conceived and developed. Fast conversion has been achieved with the use of matrix table look-up substitution, array based transposition and circular shift operations that are performed in the algorithm. MASK encryption is a new concept in symmetric key cryptography. It employs matrix and array manipulation technique using secret information and data values. It is a block cipher operated on plain text message (or image) blocks of 128 bits using a secret key of size 128 bits producing cipher text message (or cipher image) blocks of the same size. This cipher has two advantages over traditional ciphers. First, the encryption and decryption procedures are much simpler, and consequently, much faster. Second, the key avalanche effect produced in the ciphertext output is better than that of AES.

A Secure Email System Based on Identity Based Encryption

Now a days, email has become the most widely communication way in daily life. The main reason for using email is probably because of the convenience and speed in which it can be transmitted irrespective of geographical distances. To improve security and efficiency of email system, most of the email system adopt PKI and IBE encryption schemes. However, both PKI and IBE encryption schemes have their own shortcomings and consequently bring security issues to email systems. This paper proposes a new secure email system based on IBE which combines finger print authentication and proxy service for encryption and decryption

Matrix based Cryptographic Procedure for Efficient Image Encryption

In this paper we propose a cryptographic transformation based on matrix manipulations for image encryption. Substitution and diffusion operations, based on the matrix, facilitate fast conversion of plaintext and images into ciphertext and cipher images. The paper describes the encryption algorithm, discusses the simulation results and compares with results obtained from Advanced Encryption Standard (AES). It is shown that the proposed algorithm is capable of encrypting images eight times faster than AES.

Matrix based Key Generation to Enhance Key Avalanche in Advanced Encryption Standard

In symmetric block ciphers, substitution and diffusion operations are performed in multiple rounds using sub-keys generated from a key generation procedure called key schedule. The key schedule plays a very important role in deciding the security of block ciphers. In this paper we propose a complex key generation procedure, based on matrix manipulations, which could be introduced in symmetric ciphers. The proposed key generation procedure offers two advantages. First, the procedure is simple to implement and has complexity in determining the sub-keys through crypt analysis. Secondly, the procedure produces a strong avalanche effect making many bits in the output block of a cipher to undergo changes with one bit change in the secret key. As a case study, matrix based key generation procedure has been introduced in Advanced Encryption Standard (AES) by replacing the existing key schedule of AES. The key avalanche and differential key propagation produced in AES have been observed. The paper describes the matrix based key generation procedure and the enhanced key avalanche and differential key propagation produced in AES. It has been shown that, the key avalanche effect and differential key propagation characteristics of AES have improved by replacing the AES key schedule with the Matrix based key generation procedure

Proxy re-encryption schemes for IoT and crowd sensing

IoT, crowd sensing and smart cities will be a traffic challenge. New communication paradigms as asynchronous messaging carry and forward, scheduled delivery and temporary storage will be needed to manage network resources dynamically. Since traditional end to end security will require keeping security associations among devices for a long time draining valuable resources, we propose and evaluate the use of proxy re-encryption protocols in these scenarios as a solution for reliable and flexible security.

Independent Domain of Symmetric Encryption using Least SignificantBit : Computer Vision, Steganography and Cryptography Techniques

The rapid development of data transfer through internet made it easier to send the data accurate and faster to the destination. There are many transmission media to transfer the data to destination like e-mails; at the same time it is may be easier to modify and misuse the valuable information through hacking. So, in order to transfer the data securely to the destination without any modifications, there are many approaches like cryptography and steganography. This paper deals with the image steganography as well as with the different security issues, general overview of cryptography, steganography and digital watermarking approaches.  The problem of copyright violation of multimedia data has increased due to the enormous growth of computer networks that provides fast and error free transmission of any unauthorized duplicate and possibly manipulated copy of multimedia information. In order to be effective for copyright protection, digital watermark must be robust which are difficult to remove from the object in which they are embedded despite a variety of possible attacks. The message to be send safe and secure, we use watermarking. We use invisible watermarking to embed the message using LSB (Least Significant Bit) steganographic technique. The standard LSB technique embed the message in every pixel, but my contribution for this proposed watermarking, works with the hint for embedding the message only on the image edges alone. If the hacker knows that the system uses LSB technique also, it cannot decrypt correct message. To make my system robust and secure, we added cryptography algorithm as Vigenere square. Whereas the message is transmitted in cipher text and its added advantage to the proposed system. The standard Vigenere square algorithm works with either lower case or upper case. The proposed cryptography algorithm is Vigenere square with extension of numbers also. We can keep the crypto key with combination of characters and numbers. So by using these modifications and updating in this existing algorithm and combination of cryptography and steganography method we develop a secure and strong watermarking method. Performance of this watermarking scheme has been analyzed by evaluating the robustness of the algorithm with PSNR (Peak Signal to Noise Ratio) and MSE (Mean Square Error) against the quality of the image for large amount of data. While coming to see results of the proposed encryption, higher value of 89dB of PSNR with small value of MSE is 0.0017. Then it seems the proposed watermarking system is secure and robust for hiding secure information in any digital system, because this system collect the properties of both steganography and cryptography sciences.

Homomorphic self-incompatibility, with stylar rejection site, in Luehea grandiflora Mart. and Zucc. (Tiliaceae-Malvaceae s.l.)

The breeding system of Luehea grandiflora (Tiliaceae-Malvaceae s.l.) was investigated using hand pollinations and fluorescence microscopy studies of pollen tube growth. Although selfed flowers persisted for some 10 days, our study indicates that L. grandiflora is self-incompatible, with self pollen tube inhibition in the upper style, as occurs in many taxa with homomorphic, gametophytic self-incompatibility (GSI). L. grandiflora is only the second species reported within the Malvales with homomorphic stylar inhibition. This result is discussed within the context of a report for self-compatibility in this species, and we also consider the phylogenetic implications for the occurrence of GSI in the family Malvaceae s.l.

Homomorphic Sex Chromosomes and the Intriguing Y Chromosome of Ctenomys Rodent Species (Rodentia, Ctenomyidae)

Unlike the X chromosome, the mammalian Y chromosome undergoes evolutionary decay resulting in small size. This sex chromosomal heteromorphism, observed in most species of the fossorial rodent Ctenomys, contrasts with the medium-sized, homomorphic acrocentric sex chromosomes of closely related C. maulinus and C. sp. To characterize the sequence composition of these chromosomes, fluorescent banding, self-genomic in situ hybridization, and fluorescent in situ hybridization with an X painting probe were performed on mitotic and meiotic plates. High molecular homology between the sex chromosomes was detected on mitotic material as well as on meiotic plates immunodetected with anti-SYCP3 and anti-gamma H2AX. The Y chromosome is euchromatic, poor in repetitive sequences and differs from the X by the loss of a block of pericentromeric chromatin. Inferred from the G-banding pattern, an inversion and the concomitant prevention of recombination in a large asynaptic region seems to be crucial for meiotic X chromosome inactivation. These peculiar findings together with the homomorphism of Ctenomys sex chromosomes are discussed in the light of the regular purge that counteracts Muller's ratchet and the probable mechanisms accounting for their origin and molecular homology. (C) 2014 S. Karger AG, Basel

Chaotic encryption method based on life-like cellular automata

A chaotic encryption algorithm is proposed based on the "Life-like" cellular automata (CA), which acts as a pseudo-random generator (PRNG). The paper main focus is to use chaos theory to cryptography. Thus, CA was explored to look for this "chaos" property. This way, the manuscript is more concerning on tests like: Lyapunov exponent, Entropy and Hamming distance to measure the chaos in CA, as well as statistic analysis like DIEHARD and ENT suites. Our results achieved higher randomness quality than others ciphers in literature. These results reinforce the supposition of a strong relationship between chaos and the randomness quality. Thus, the "chaos" property of CA is a good reason to be employed in cryptography, furthermore, for its simplicity, low cost of implementation and respectable encryption power. (C) 2012 Elsevier Ltd. All rights reserved.

L'algoritmo advanced encryption standard (AES)

Descrizione dell'algoritmo crittografico AES, criteri adottati dal NIST per la scelta di AES e considerazioni sulla sua sicurezza.

The location of Z- and W-linked marker genes and sequence on the homomorphic sex chromosomes of the ostrich and the emu

Perhaps the most striking fact about early Cenozoic avian history some 70 million years ago was the rapid radiation of large, flightless, ground-living birds. It has been suggested that, for a time, there was active competition between these large terrestrial birds and the early mammals. Probably reflecting the above noted early start of Ratitae of the infraclass Eoaves, the presumptive sex chromosomes of their present day survivors, such as the emu and the ostrich, largely remained homomorphic. The signs of genetic differentiation between their still-homomorphic Z and W chromosomes were tested by using two marker genes (Z-linked ZOV3 and the gene for the iron-responsive element-binding protein) and one marker sequence of a part of a presumptive pseudogene (W-linked EE0.6 of the chicken). Their homologues, maintaining 71–92% identities to the chicken counterparts, were found in both the emu (Dromaius novaehollandiae) and the ostrich (Struthio camelus). Their locations were visualized on chromosome preparations by fluorescence in situ hybridization. In the case of the emu, these three marker sequences were localized on both members of the fifth pair of a female, thus revealing no sign yet of genetic differentiation between the Z and the W. The finding was the same with regard to both members of the fourth pair of male ostriches. In the female ostrich, however, the sequence of the gene for the iron-responsive element-binding protein was missing from one of the pairs, thus revealing the differentiation by a small deletion of the W from the Z.

Maintenance testing for the data encryption standard /

"Issued August 1980."