Science.gov

Sample records for acquisition compression encryption

  1. Large-scale electrophysiology: acquisition, compression, encryption, and storage of big data.

    PubMed

    Brinkmann, Benjamin H; Bower, Mark R; Stengel, Keith A; Worrell, Gregory A; Stead, Matt

    2009-05-30

    The use of large-scale electrophysiology to obtain high spatiotemporal resolution brain recordings (>100 channels) capable of probing the range of neural activity from local field potential oscillations to single-neuron action potentials presents new challenges for data acquisition, storage, and analysis. Our group is currently performing continuous, long-term electrophysiological recordings in human subjects undergoing evaluation for epilepsy surgery using hybrid intracranial electrodes composed of up to 320 micro- and clinical macroelectrode arrays. DC-capable amplifiers, sampling at 32kHz per channel with 18-bits of A/D resolution are capable of resolving extracellular voltages spanning single-neuron action potentials, high frequency oscillations, and high amplitude ultra-slow activity, but this approach generates 3 terabytes of data per day (at 4 bytes per sample) using current data formats. Data compression can provide several practical benefits, but only if data can be compressed and appended to files in real-time in a format that allows random access to data segments of varying size. Here we describe a state-of-the-art, scalable, electrophysiology platform designed for acquisition, compression, encryption, and storage of large-scale data. Data are stored in a file format that incorporates lossless data compression using range-encoded differences, a 32-bit cyclically redundant checksum to ensure data integrity, and 128-bit encryption for protection of patient information. PMID:19427545

  2. Compressive Optical Image Encryption

    PubMed Central

    Li, Jun; Sheng Li, Jiao; Yang Pan, Yang; Li, Rong

    2015-01-01

    An optical image encryption technique based on compressive sensing using fully optical means has been proposed. An object image is first encrypted to a white-sense stationary noise pattern using a double random phase encoding (DRPE) method in a Mach-Zehnder interferometer. Then, the encrypted image is highly compressed to a signal using single-pixel compressive holographic imaging in the optical domain. At the receiving terminal, the encrypted image is reconstructed well via compressive sensing theory, and the original image can be decrypted with three reconstructed holograms and the correct keys. The numerical simulations show that the method is effective and suitable for optical image security transmission in future all-optical networks because of the ability of completely optical implementation and substantially smaller hologram data volume. PMID:25992946

  3. Compressive optical image encryption.

    PubMed

    Li, Jun; Sheng Li, Jiao; Yang Pan, Yang; Li, Rong

    2015-01-01

    An optical image encryption technique based on compressive sensing using fully optical means has been proposed. An object image is first encrypted to a white-sense stationary noise pattern using a double random phase encoding (DRPE) method in a Mach-Zehnder interferometer. Then, the encrypted image is highly compressed to a signal using single-pixel compressive holographic imaging in the optical domain. At the receiving terminal, the encrypted image is reconstructed well via compressive sensing theory, and the original image can be decrypted with three reconstructed holograms and the correct keys. The numerical simulations show that the method is effective and suitable for optical image security transmission in future all-optical networks because of the ability of completely optical implementation and substantially smaller hologram data volume. PMID:25992946

  4. Innovative hyperchaotic encryption algorithm for compressed video

    NASA Astrophysics Data System (ADS)

    Yuan, Chun; Zhong, Yuzhuo; Yang, Shiqiang

    2002-12-01

    It is accepted that stream cryptosystem can achieve good real-time performance and flexibility which implements encryption by selecting few parts of the block data and header information of the compressed video stream. Chaotic random number generator, for example Logistics Map, is a comparatively promising substitute, but it is easily attacked by nonlinear dynamic forecasting and geometric information extracting. In this paper, we present a hyperchaotic cryptography scheme to encrypt the compressed video, which integrates Logistics Map with Z(232 - 1) field linear congruential algorithm to strengthen the security of the mono-chaotic cryptography, meanwhile, the real-time performance and flexibility of the chaotic sequence cryptography are maintained. It also integrates with the dissymmetrical public-key cryptography and implements encryption and identity authentification on control parameters at initialization phase. In accord with the importance of data in compressed video stream, encryption is performed in layered scheme. In the innovative hyperchaotic cryptography, the value and the updating frequency of control parameters can be changed online to satisfy the requirement of the network quality, processor capability and security requirement. The innovative hyperchaotic cryprography proves robust security by cryptoanalysis, shows good real-time performance and flexible implement capability through the arithmetic evaluating and test.

  5. Degradative encryption: An efficient way to protect SPIHT compressed images

    NASA Astrophysics Data System (ADS)

    Xiang, Tao; Qu, Jinyu; Yu, Chenyun; Fu, Xinwen

    2012-11-01

    Degradative encryption, a new selective image encryption paradigm, is proposed to encrypt only a small part of image data to make the detail blurred but keep the skeleton discernible. The efficiency is further optimized by combining compression and encryption. A format-compliant degradative encryption algorithm based on set partitioning in hierarchical trees (SPIHT) is then proposed, and the scheme is designed to work in progressive mode for gaining a tradeoff between efficiency and security. Extensive experiments are conducted to evaluate the strength and efficiency of the scheme, and it is found that less than 10% data need to be encrypted for a secure degradation. In security analysis, the scheme is verified to be immune to cryptographic attacks as well as those adversaries utilizing image processing techniques. The scheme can find its wide applications in online try-and-buy service on mobile devices, searchable multimedia encryption in cloud computing, etc.

  6. System using data compression and hashing adapted for use for multimedia encryption

    DOEpatents

    Coffland, Douglas R.

    2011-07-12

    A system and method is disclosed for multimedia encryption. Within the system of the present invention, a data compression module receives and compresses a media signal into a compressed data stream. A data acquisition module receives and selects a set of data from the compressed data stream. And, a hashing module receives and hashes the set of data into a keyword. The method of the present invention includes the steps of compressing a media signal into a compressed data stream; selecting a set of data from the compressed data stream; and hashing the set of data into a keyword.

  7. Image compression-encryption scheme based on hyper-chaotic system and 2D compressive sensing

    NASA Astrophysics Data System (ADS)

    Zhou, Nanrun; Pan, Shumin; Cheng, Shan; Zhou, Zhihong

    2016-08-01

    Most image encryption algorithms based on low-dimensional chaos systems bear security risks and suffer encryption data expansion when adopting nonlinear transformation directly. To overcome these weaknesses and reduce the possible transmission burden, an efficient image compression-encryption scheme based on hyper-chaotic system and 2D compressive sensing is proposed. The original image is measured by the measurement matrices in two directions to achieve compression and encryption simultaneously, and then the resulting image is re-encrypted by the cycle shift operation controlled by a hyper-chaotic system. Cycle shift operation can change the values of the pixels efficiently. The proposed cryptosystem decreases the volume of data to be transmitted and simplifies the keys distribution simultaneously as a nonlinear encryption system. Simulation results verify the validity and the reliability of the proposed algorithm with acceptable compression and security performance.

  8. Joint compression and encryption using chaotically mutated Huffman trees

    NASA Astrophysics Data System (ADS)

    Hermassi, Houcemeddine; Rhouma, Rhouma; Belghith, Safya

    2010-10-01

    This paper introduces a new scheme for joint compression and encryption using the Huffman codec. A basic tree is first generated for a given message and then based on a keystream generated from a chaotic map and depending from the input message, the basic tree is mutated without changing the statistical model. Hence a symbol can be coded by more than one codeword having the same length. The security of the scheme is tested against the known plaintext attack and the brute force attack. Performance analysis including encryption/decryption speed, additional computational complexity and compression ratio are given.

  9. Image compression and encryption scheme based on 2D compressive sensing and fractional Mellin transform

    NASA Astrophysics Data System (ADS)

    Zhou, Nanrun; Li, Haolin; Wang, Di; Pan, Shumin; Zhou, Zhihong

    2015-05-01

    Most of the existing image encryption techniques bear security risks for taking linear transform or suffer encryption data expansion for adopting nonlinear transformation directly. To overcome these difficulties, a novel image compression-encryption scheme is proposed by combining 2D compressive sensing with nonlinear fractional Mellin transform. In this scheme, the original image is measured by measurement matrices in two directions to achieve compression and encryption simultaneously, and then the resulting image is re-encrypted by the nonlinear fractional Mellin transform. The measurement matrices are controlled by chaos map. The Newton Smoothed l0 Norm (NSL0) algorithm is adopted to obtain the decryption image. Simulation results verify the validity and the reliability of this scheme.

  10. Simultaneous image compression, fusion and encryption algorithm based on compressive sensing and chaos

    NASA Astrophysics Data System (ADS)

    Liu, Xingbin; Mei, Wenbo; Du, Huiqian

    2016-05-01

    In this paper, a novel approach based on compressive sensing and chaos is proposed for simultaneously compressing, fusing and encrypting multi-modal images. The sparsely represented source images are firstly measured with the key-controlled pseudo-random measurement matrix constructed using logistic map, which reduces the data to be processed and realizes the initial encryption. Then the obtained measurements are fused by the proposed adaptive weighted fusion rule. The fused measurement is further encrypted into the ciphertext through an iterative procedure including improved random pixel exchanging technique and fractional Fourier transform. The fused image can be reconstructed by decrypting the ciphertext and using a recovery algorithm. The proposed algorithm not only reduces data volume but also simplifies keys, which improves the efficiency of transmitting data and distributing keys. Numerical results demonstrate the feasibility and security of the proposed scheme.

  11. Double-image encryption scheme combining DWT-based compressive sensing with discrete fractional random transform

    NASA Astrophysics Data System (ADS)

    Zhou, Nanrun; Yang, Jianping; Tan, Changfa; Pan, Shumin; Zhou, Zhihong

    2015-11-01

    A new discrete fractional random transform based on two circular matrices is designed and a novel double-image encryption-compression scheme is proposed by combining compressive sensing with discrete fractional random transform. The two random circular matrices and the measurement matrix utilized in compressive sensing are constructed by using a two-dimensional sine Logistic modulation map. Two original images can be compressed, encrypted with compressive sensing and connected into one image. The resulting image is re-encrypted by Arnold transform and the discrete fractional random transform. Simulation results and security analysis demonstrate the validity and security of the scheme.

  12. Encrypted Three-dimensional Dynamic Imaging using Snapshot Time-of-flight Compressed Ultrafast Photography.

    PubMed

    Liang, Jinyang; Gao, Liang; Hai, Pengfei; Li, Chiye; Wang, Lihong V

    2015-01-01

    Compressed ultrafast photography (CUP), a computational imaging technique, is synchronized with short-pulsed laser illumination to enable dynamic three-dimensional (3D) imaging. By leveraging the time-of-flight (ToF) information of pulsed light backscattered by the object, ToF-CUP can reconstruct a volumetric image from a single camera snapshot. In addition, the approach unites the encryption of depth data with the compressed acquisition of 3D data in a single snapshot measurement, thereby allowing efficient and secure data storage and transmission. We demonstrated high-speed 3D videography of moving objects at up to 75 volumes per second. The ToF-CUP camera was applied to track the 3D position of a live comet goldfish. We have also imaged a moving object obscured by a scattering medium. PMID:26503834

  13. Encrypted Three-dimensional Dynamic Imaging using Snapshot Time-of-flight Compressed Ultrafast Photography

    NASA Astrophysics Data System (ADS)

    Liang, Jinyang; Gao, Liang; Hai, Pengfei; Li, Chiye; Wang, Lihong V.

    2015-10-01

    Compressed ultrafast photography (CUP), a computational imaging technique, is synchronized with short-pulsed laser illumination to enable dynamic three-dimensional (3D) imaging. By leveraging the time-of-flight (ToF) information of pulsed light backscattered by the object, ToF-CUP can reconstruct a volumetric image from a single camera snapshot. In addition, the approach unites the encryption of depth data with the compressed acquisition of 3D data in a single snapshot measurement, thereby allowing efficient and secure data storage and transmission. We demonstrated high-speed 3D videography of moving objects at up to 75 volumes per second. The ToF-CUP camera was applied to track the 3D position of a live comet goldfish. We have also imaged a moving object obscured by a scattering medium.

  14. Encrypted Three-dimensional Dynamic Imaging using Snapshot Time-of-flight Compressed Ultrafast Photography

    PubMed Central

    Liang, Jinyang; Gao, Liang; Hai, Pengfei; Li, Chiye; Wang, Lihong V.

    2015-01-01

    Compressed ultrafast photography (CUP), a computational imaging technique, is synchronized with short-pulsed laser illumination to enable dynamic three-dimensional (3D) imaging. By leveraging the time-of-flight (ToF) information of pulsed light backscattered by the object, ToF-CUP can reconstruct a volumetric image from a single camera snapshot. In addition, the approach unites the encryption of depth data with the compressed acquisition of 3D data in a single snapshot measurement, thereby allowing efficient and secure data storage and transmission. We demonstrated high-speed 3D videography of moving objects at up to 75 volumes per second. The ToF-CUP camera was applied to track the 3D position of a live comet goldfish. We have also imaged a moving object obscured by a scattering medium. PMID:26503834

  15. On encryption-compression tradeoff of pre/post-filtered images

    NASA Astrophysics Data System (ADS)

    Gurijala, Aparna; Khayam, Syed A.; Radha, Hayder; Deller, J. R., Jr.

    2005-09-01

    Advances in network communications have necessitated secure local-storage and transmission of multimedia content. In particular, military networks need to securely store sensitive imagery which at a later stage may be transmitted over bandwidth-constrained wireless networks. This work investigates compression efficiency of JPEG and JPEG 2000 standards for encrypted images. An encryption technique proposed by Kuo et al. in [4] is employed. The technique scrambles the phase spectrum of an image by addition of the phase of an all-pass pre-filter. The post-filter inverts the encryption process, provided the correct pseudo-random filter coefficients are available at the receiver. Additional benefits of pre/post-filter encryption include the prevention of blocking effects and better robustness to channel noise [4]. Since both JPEG and JPEG 2000 exploit spatial and perceptual redundancies for compression, pre/post-filtered (encrypted) images are susceptible to compression inefficiencies. The PSNR difference between the unencrypted and pre/post-filtered images after decompression is determined for various compression rates. Compression efficiency decreases with an increase in compression rate. For JPEG and JPEG 2000 compression rates between 0.5 to 2.5 bpp, the difference in PSNR is negligible. Partial encryption is proposed wherein a subset of image phase coefficients are scrambled. Due to the phase sensitivity of images, even partial scrambling of the phase information results in unintelligible data. The effect of compression on partially encrypted images is observed for various bit-rates. When 25% of image phase coefficients are scrambled, the JPEG and JPEG 2000 compression performance of encrypted images is almost similar to that of unencrypted images for compression rates in the 0.5 to 3.5 bpp range.

  16. Optical image encryption via photon-counting imaging and compressive sensing based ptychography

    NASA Astrophysics Data System (ADS)

    Rawat, Nitin; Hwang, In-Chul; Shi, Yishi; Lee, Byung-Geun

    2015-06-01

    In this study, we investigate the integration of compressive sensing (CS) and photon-counting imaging (PCI) techniques with a ptychography-based optical image encryption system. Primarily, the plaintext real-valued image is optically encrypted and recorded via a classical ptychography technique. Further, the sparse-based representations of the original encrypted complex data can be produced by combining CS and PCI techniques with the primary encrypted image. Such a combination takes an advantage of reduced encrypted samples (i.e., linearly projected random compressive complex samples and photon-counted complex samples) that can be exploited to realize optical decryption, which inherently serves as a secret key (i.e., independent to encryption phase keys) and makes an intruder attack futile. In addition to this, recording fewer encrypted samples provides a substantial bandwidth reduction in online transmission. We demonstrate that the fewer sparse-based complex samples have adequate information to realize decryption. To the best of our knowledge, this is the first report on integrating CS and PCI with conventional ptychography-based optical image encryption.

  17. A new simultaneous compression and encryption method for images suitable to recognize form by optical correlation

    NASA Astrophysics Data System (ADS)

    Alfalou, Ayman; Elbouz, Marwa; Jridi, Maher; Loussert, Alain

    2009-09-01

    In some recognition form applications (which require multiple images: facial identification or sign-language), many images should be transmitted or stored. This requires the use of communication systems with a good security level (encryption) and an acceptable transmission rate (compression rate). In the literature, several encryption and compression techniques can be found. In order to use optical correlation, encryption and compression techniques cannot be deployed independently and in a cascade manner. Otherwise, our system will suffer from two major problems. In fact, we cannot simply use these techniques in a cascade manner without considering the impact of one technique over another. Secondly, a standard compression can affect the correlation decision, because the correlation is sensitive to the loss of information. To solve both problems, we developed a new technique to simultaneously compress & encrypt multiple images using a BPOF optimized filter. The main idea of our approach consists in multiplexing the spectrums of different transformed images by a Discrete Cosine Transform (DCT). To this end, the spectral plane should be divided into several areas and each of them corresponds to the spectrum of one image. On the other hand, Encryption is achieved using the multiplexing, a specific rotation functions, biometric encryption keys and random phase keys. A random phase key is widely used in optical encryption approaches. Finally, many simulations have been conducted. Obtained results corroborate the good performance of our approach. We should also mention that the recording of the multiplexed and encrypted spectra is optimized using an adapted quantification technique to improve the overall compression rate.

  18. An Unequal Secure Encryption Scheme for H.264/AVC Video Compression Standard

    NASA Astrophysics Data System (ADS)

    Fan, Yibo; Wang, Jidong; Ikenaga, Takeshi; Tsunoo, Yukiyasu; Goto, Satoshi

    H.264/AVC is the newest video coding standard. There are many new features in it which can be easily used for video encryption. In this paper, we propose a new scheme to do video encryption for H.264/AVC video compression standard. We define Unequal Secure Encryption (USE) as an approach that applies different encryption schemes (with different security strength) to different parts of compressed video data. This USE scheme includes two parts: video data classification and unequal secure video data encryption. Firstly, we classify the video data into two partitions: Important data partition and unimportant data partition. Important data partition has small size with high secure protection, while unimportant data partition has large size with low secure protection. Secondly, we use AES as a block cipher to encrypt the important data partition and use LEX as a stream cipher to encrypt the unimportant data partition. AES is the most widely used symmetric cryptography which can ensure high security. LEX is a new stream cipher which is based on AES and its computational cost is much lower than AES. In this way, our scheme can achieve both high security and low computational cost. Besides the USE scheme, we propose a low cost design of hybrid AES/LEX encryption module. Our experimental results show that the computational cost of the USE scheme is low (about 25% of naive encryption at Level 0 with VEA used). The hardware cost for hybrid AES/LEX module is 4678 Gates and the AES encryption throughput is about 50Mbps.

  19. Simultaneous compression and encryption for secure real-time secure transmission of sensitive video transmission

    NASA Astrophysics Data System (ADS)

    Al-Hayani, Nazar; Al-Jawad, Naseer; Jassim, Sabah A.

    2014-05-01

    Video compression and encryption became very essential in a secured real time video transmission. Applying both techniques simultaneously is one of the challenges where the size and the quality are important in multimedia transmission. In this paper we proposed a new technique for video compression and encryption. Both encryption and compression are based on edges extracted from the high frequency sub-bands of wavelet decomposition. The compression algorithm based on hybrid of: discrete wavelet transforms, discrete cosine transform, vector quantization, wavelet based edge detection, and phase sensing. The compression encoding algorithm treats the video reference and non-reference frames in two different ways. The encryption algorithm utilized A5 cipher combined with chaotic logistic map to encrypt the significant parameters and wavelet coefficients. Both algorithms can be applied simultaneously after applying the discrete wavelet transform on each individual frame. Experimental results show that the proposed algorithms have the following features: high compression, acceptable quality, and resistance to the statistical and bruteforce attack with low computational processing.

  20. Multiple-image encryption based on compressive holography using a multiple-beam interferometer

    NASA Astrophysics Data System (ADS)

    Wan, Yuhong; Wu, Fan; Yang, Jinghuan; Man, Tianlong

    2015-05-01

    Multiple-image encryption techniques not only improve the encryption capacity but also facilitate the transmission and storage of the ciphertext. We present a new method of multiple-image encryption based on compressive holography with enhanced data security using a multiple-beam interferometer. By modifying the Mach-Zehnder interferometer, the interference of multiple object beams and unique reference beam is implemented for encrypting multiple images simultaneously into one hologram. The original images modulated with the random phase masks are put in different positions with different distance away from the CCD camera. Each image plays the role of secret key for other images to realize the mutual encryption. Four-step phase shifting technique is combined with the holographic recording. The holographic recording is treated as a compressive sensing process, thus the decryption process is inverted as a minimization problem and the two-step iterative shrinkage/thresholding algorithm (TwIST) is employed to solve this optimization problem. The simulated results about multiple binary and grayscale images encryption are demonstrated to verify the validity and robustness of our proposed method.

  1. Compression-RSA: New approach of encryption and decryption method

    NASA Astrophysics Data System (ADS)

    Hung, Chang Ee; Mandangan, Arif

    2013-04-01

    Rivest-Shamir-Adleman (RSA) cryptosystem is a well known asymmetric cryptosystem and it has been applied in a very wide area. Many researches with different approaches have been carried out in order to improve the security and performance of RSA cryptosystem. The enhancement of the performance of RSA cryptosystem is our main interest. In this paper, we propose a new method to increase the efficiency of RSA by shortening the number of plaintext before it goes under encryption process without affecting the original content of the plaintext. Concept of simple Continued Fraction and the new special relationship between it and Euclidean Algorithm have been applied on this newly proposed method. By reducing the number of plaintext-ciphertext, the encryption-decryption processes of a secret message can be accelerated.

  2. Compression-RSA technique: A more efficient encryption-decryption procedure

    NASA Astrophysics Data System (ADS)

    Mandangan, Arif; Mei, Loh Chai; Hung, Chang Ee; Che Hussin, Che Haziqah

    2014-06-01

    The efficiency of encryption-decryption procedures has become a major problem in asymmetric cryptography. Compression-RSA technique is developed to overcome the efficiency problem by compressing the numbers of kplaintext, where k∈Z+ and k > 2, becoming only 2 plaintext. That means, no matter how large the numbers of plaintext, they will be compressed to only 2 plaintext. The encryption-decryption procedures are expected to be more efficient since these procedures only receive 2 inputs to be processed instead of kinputs. However, it is observed that as the numbers of original plaintext are increasing, the size of the new plaintext becomes bigger. As a consequence, it will probably affect the efficiency of encryption-decryption procedures, especially for RSA cryptosystem since both of its encryption-decryption procedures involve exponential operations. In this paper, we evaluated the relationship between the numbers of original plaintext and the size of the new plaintext. In addition, we conducted several experiments to show that the RSA cryptosystem with embedded Compression-RSA technique is more efficient than the ordinary RSA cryptosystem.

  3. A secure approach for encrypting and compressing biometric information employing orthogonal code and steganography

    NASA Astrophysics Data System (ADS)

    Islam, Muhammad F.; Islam, Mohammed N.

    2012-04-01

    The objective of this paper is to develop a novel approach for encryption and compression of biometric information utilizing orthogonal coding and steganography techniques. Multiple biometric signatures are encrypted individually using orthogonal codes and then multiplexed together to form a single image, which is then embedded in a cover image using the proposed steganography technique. The proposed technique employs three least significant bits for this purpose and a secret key is developed to choose one from among these bits to be replaced by the corresponding bit of the biometric image. The proposed technique offers secure transmission of multiple biometric signatures in an identification document which will be protected from unauthorized steganalysis attempt.

  4. Compression of Encrypted Images Using Set Partitioning In Hierarchical Trees Algorithm

    NASA Astrophysics Data System (ADS)

    Sarika, G.; Unnithan, Harikuttan; Peter, Smitha

    2011-10-01

    When it is desired to transmit redundant data over an insecure channel, it is customary to encrypt the data. For encrypted real world sources such as images, the use of Markova properties in the slepian-wolf decoder does not work well for gray scale images. Here in this paper we propose a method of compression of an encrypted image. In the encoder section, the image is first encrypted and then it undergoes compression in resolution. The cipher function scrambles only the pixel values, but does not shuffle the pixel locations. After down sampling, each sub-image is encoded independently and the resulting syndrome bits are transmitted. The received image undergoes a joint decryption and decompression in the decoder section. By using the local statistics based on the image, it is recovered back. Here the decoder gets only lower resolution version of the image. In addition, this method provides only partial access to the current source at the decoder side, which improves the decoder's learning of the source statistics. The source dependency is exploited to improve the compression efficiency. This scheme provides better coding efficiency and less computational complexity.

  5. Simultaneous optical image compression and encryption using error-reduction phase retrieval algorithm

    NASA Astrophysics Data System (ADS)

    Liu, Wei; Liu, Zhengjun; Liu, Shutian

    2015-12-01

    We report a simultaneous image compression and encryption scheme based on solving a typical optical inverse problem. The secret images to be processed are multiplexed as the input intensities of a cascaded diffractive optical system. At the output plane, a compressed complex-valued data with a lot fewer measurements can be obtained by utilizing error-reduction phase retrieval algorithm. The magnitude of the output image can serve as the final ciphertext while its phase serves as the decryption key. Therefore the compression and encryption are simultaneously completed without additional encoding and filtering operations. The proposed strategy can be straightforwardly applied to the existing optical security systems that involve diffraction and interference. Numerical simulations are performed to demonstrate the validity and security of the proposal.

  6. Compression and Encryption of ECG Signal Using Wavelet and Chaotically Huffman Code in Telemedicine Application.

    PubMed

    Raeiatibanadkooki, Mahsa; Quchani, Saeed Rahati; KhalilZade, MohammadMahdi; Bahaadinbeigy, Kambiz

    2016-03-01

    In mobile health care monitoring, compression is an essential tool for solving storage and transmission problems. The important issue is able to recover the original signal from the compressed signal. The main purpose of this paper is compressing the ECG signal with no loss of essential data and also encrypting the signal to keep it confidential from everyone, except for physicians. In this paper, mobile processors are used and there is no need for any computers to serve this purpose. After initial preprocessing such as removal of the baseline noise, Gaussian noise, peak detection and determination of heart rate, the ECG signal is compressed. In compression stage, after 3 steps of wavelet transform (db04), thresholding techniques are used. Then, Huffman coding with chaos for compression and encryption of the ECG signal are used. The compression rates of proposed algorithm is 97.72 %. Then, the ECG signals are sent to a telemedicine center to acquire specialist diagnosis by TCP/IP protocol. PMID:26779641

  7. High performance optical encryption based on computational ghost imaging with QR code and compressive sensing technique

    NASA Astrophysics Data System (ADS)

    Zhao, Shengmei; Wang, Le; Liang, Wenqiang; Cheng, Weiwen; Gong, Longyan

    2015-10-01

    In this paper, we propose a high performance optical encryption (OE) scheme based on computational ghost imaging (GI) with QR code and compressive sensing (CS) technique, named QR-CGI-OE scheme. N random phase screens, generated by Alice, is a secret key and be shared with its authorized user, Bob. The information is first encoded by Alice with QR code, and the QR-coded image is then encrypted with the aid of computational ghost imaging optical system. Here, measurement results from the GI optical system's bucket detector are the encrypted information and be transmitted to Bob. With the key, Bob decrypts the encrypted information to obtain the QR-coded image with GI and CS techniques, and further recovers the information by QR decoding. The experimental and numerical simulated results show that the authorized users can recover completely the original image, whereas the eavesdroppers can not acquire any information about the image even the eavesdropping ratio (ER) is up to 60% at the given measurement times. For the proposed scheme, the number of bits sent from Alice to Bob are reduced considerably and the robustness is enhanced significantly. Meantime, the measurement times in GI system is reduced and the quality of the reconstructed QR-coded image is improved.

  8. Interference-based image encryption with silhouette removal by aid of compressive sensing

    NASA Astrophysics Data System (ADS)

    Gong, Qiong; Wang, Zhipeng; Lv, Xiaodong; Qin, Yi

    2016-01-01

    Compressive sensing (CS) offers the opportunity to reconstruct a signal from its sparse representation, either in the space domain or the transform domain. Exploiting this character, we propose a simple interference-based image encryption method. For encryption, a synthetic image, which contains sparse samples of the original image and the designated values, is analytically separated into two phase only masks (POMs). Consequently, only fragmentary data of the primary image can be directly collected in the traditional decryption scheme. However, the subsequent CS reconstruction will retrieve a high quality image from the fragmentary information. The proposed method has effectively suppressed the silhouette problem. Moreover, it has also some distinct advantages over the previous approaches.

  9. Efficient Lossy Compression for Compressive Sensing Acquisition of Images in Compressive Sensing Imaging Systems

    PubMed Central

    Li, Xiangwei; Lan, Xuguang; Yang, Meng; Xue, Jianru; Zheng, Nanning

    2014-01-01

    Compressive Sensing Imaging (CSI) is a new framework for image acquisition, which enables the simultaneous acquisition and compression of a scene. Since the characteristics of Compressive Sensing (CS) acquisition are very different from traditional image acquisition, the general image compression solution may not work well. In this paper, we propose an efficient lossy compression solution for CS acquisition of images by considering the distinctive features of the CSI. First, we design an adaptive compressive sensing acquisition method for images according to the sampling rate, which could achieve better CS reconstruction quality for the acquired image. Second, we develop a universal quantization for the obtained CS measurements from CS acquisition without knowing any a priori information about the captured image. Finally, we apply these two methods in the CSI system for efficient lossy compression of CS acquisition. Simulation results demonstrate that the proposed solution improves the rate-distortion performance by 0.4∼2 dB comparing with current state-of-the-art, while maintaining a low computational complexity. PMID:25490597

  10. Optical compression and encryption system combining multiple measurement matrices with fractional Fourier transform.

    PubMed

    Yi, Jiawang; Tan, Guanzheng

    2015-12-20

    Optical cryptosystems combined with compressed sensing can achieve compression and encryption simultaneously. But they usually use the same measurement matrix to sample all blocks of an image, which makes it easy to estimate the measurement matrix in the chosen plaintext attack. In this paper, we propose a robust scheme adopting multiple measurement matrices to overcome this shortcoming. The matrices can be efficiently derived by applying random row exchanging to a basic one, which is also encoded into the fractional Fourier transform (FrFT) domain to improve the visual effect of wrongly decrypted images. Chaos-based pixel scrambling is added into our double FrFT cryptosystem to guarantee its nonlinearity. Simulation results have shown the security and effectiveness of our scheme. PMID:26837032

  11. Exploiting root-mean-square time-frequency structure for multiple-image optical compression and encryption.

    PubMed

    Alfalou, A; Brosseau, C

    2010-06-01

    We report on an algorithm to compress and encrypt simultaneously multiple images (target images). This method, which is based upon a specific spectral multiplexing (fusion without overlapping) of the multiple images, aims to achieve a single encrypted image, at the output plane of our system, that contains all information needed to reconstruct the target images. For that purpose, we divide the Fourier plane of the image to transmit into two types of area, i.e., specific and common areas to each target image. A segmentation criterion taking into account the rms duration of each target image spectrum is proposed. This approach, which consists of merging the input target images together (in the Fourier plane) allows us to reduce the information to be stored and/or transmitted (compression) and induce noise on the output image (encryption). To achieve a good encryption level, a first key image (containing biometric information and providing the intellectual property of the target images) is used. A second encryption key is inserted in the Fourier plane to ensure a relevant phase distribution of the different merged spectra. We also discuss how the encoding information can be optimized by minimizing the number of bits required to encode each pixel. PMID:20517460

  12. Study on the key technology of optical encryption based on compressive ghost imaging with double random-phase encoding

    NASA Astrophysics Data System (ADS)

    Zhang, Leihong; Pan, Zilan; Liang, Dong; Ma, Xiuhua; Zhang, Dawei

    2015-12-01

    An optical encryption method based on compressive ghost imaging (CGI) with double random-phase encoding (DRPE), named DRPE-CGI, is proposed. The information is first encrypted by the sender with DRPE, the DRPE-coded image is encrypted by the system of computational ghost imaging with a secret key. The key of N random-phase vectors is generated by the sender and will be shared with the receiver who is the authorized user. The receiver decrypts the DRPE-coded image with the key, with the aid of CGI and a compressive sensing technique, and then reconstructs the original information by the technique of DRPE-decoding. The experiments suggest that cryptanalysts cannot get any useful information about the original image even if they eavesdrop 60% of the key at a given time, so the security of DRPE-CGI is higher than that of the security of conventional ghost imaging. Furthermore, this method can reduce 40% of the information quantity compared with ghost imaging while the qualities of reconstructing the information are the same. It can also improve the quality of the reconstructed plaintext information compared with DRPE-GI with the same sampling times. This technique can be immediately applied to encryption and data storage with the advantages of high security, fast transmission, and high quality of reconstructed information.

  13. Research on key technologies for data-interoperability-based metadata, data compression and encryption, and their application

    NASA Astrophysics Data System (ADS)

    Yu, Xu; Shao, Quanqin; Zhu, Yunhai; Deng, Yuejin; Yang, Haijun

    2006-10-01

    With the development of informationization and the separation between data management departments and application departments, spatial data sharing becomes one of the most important objectives for the spatial information infrastructure construction, and spatial metadata management system, data transmission security and data compression are the key technologies to realize spatial data sharing. This paper discusses the key technologies for metadata based on data interoperability, deeply researches the data compression algorithms such as adaptive Huffman algorithm, LZ77 and LZ78 algorithm, studies to apply digital signature technique to encrypt spatial data, which can not only identify the transmitter of spatial data, but also find timely whether the spatial data are sophisticated during the course of network transmission, and based on the analysis of symmetric encryption algorithms including 3DES,AES and asymmetric encryption algorithm - RAS, combining with HASH algorithm, presents a improved mix encryption method for spatial data. Digital signature technology and digital watermarking technology are also discussed. Then, a new solution of spatial data network distribution is put forward, which adopts three-layer architecture. Based on the framework, we give a spatial data network distribution system, which is efficient and safe, and also prove the feasibility and validity of the proposed solution.

  14. Review of digital fingerprint acquisition systems and wavelet compression

    NASA Astrophysics Data System (ADS)

    Hopper, Thomas

    2003-04-01

    Over the last decade many criminal justice agencies have replaced their fingerprint card based systems with electronic processing. We examine these new systems and find that image acquisition to support the identification application is consistently a challenge. Image capture and compression are widely dispersed and relatively new technologies within criminal justice information systems. Image quality assurance programs are just beginning to mature.

  15. Modeling of video compression effects on target acquisition performance

    NASA Astrophysics Data System (ADS)

    Cha, Jae H.; Preece, Bradley; Espinola, Richard L.

    2009-05-01

    The effect of video compression on image quality was investigated from the perspective of target acquisition performance modeling. Human perception tests were conducted recently at the U.S. Army RDECOM CERDEC NVESD, measuring identification (ID) performance on simulated military vehicle targets at various ranges. These videos were compressed with different quality and/or quantization levels utilizing motion JPEG, motion JPEG2000, and MPEG-4 encoding. To model the degradation on task performance, the loss in image quality is fit to an equivalent Gaussian MTF scaled by the Structural Similarity Image Metric (SSIM). Residual compression artifacts are treated as 3-D spatio-temporal noise. This 3-D noise is found by taking the difference of the uncompressed frame, with the estimated equivalent blur applied, and the corresponding compressed frame. Results show good agreement between the experimental data and the model prediction. This method has led to a predictive performance model for video compression by correlating various compression levels to particular blur and noise input parameters for NVESD target acquisition performance model suite.

  16. Multiscale Electrophysiology Format: An Open Open-source Electrophysiology Format Using Data Compression, Encryption, and Cyclic Redundancy Check

    PubMed Central

    Brinkmann, Benjamin H.; Bower, Mark R.; Stengel, Keith A.; Worrell, Gregory A.; Stead, Matt

    2010-01-01

    Continuous, long-term (up to 10 days) electrophysiological monitoring using hybrid intracranial electrodes is an emerging tool for presurgical epilepsy evaluation and fundamental investigations of seizure generation. Detection of high-frequency oscillations and microseizures could provide valuable insights into causes and therapies for the treatment of epilepsy, but requires high spatial and temporal resolution. Our group is currently using hybrid arrays composed of up to 320 micro- and clinical macroelectrode arrays sampled at 32 kHz per channel with 18-bits of A/D resolution. Such recordings produce approximately 3 terabytes of data per day. Existing file formats have limited data compression capabilities, and do not offer mechanisms for protecting patient identifying information or detecting data corruption during transmission or storage. We present a novel file format that employs range encoding to provide a high degree of data compression, a three-tiered 128-bit encryption system for patient information and data security, and a 32-bit cyclic redundancy check to verify the integrity of compressed data blocks. Open-source software to read, write, and process these files are provided. PMID:19963940

  17. Effects of video compression on target acquisition performance

    NASA Astrophysics Data System (ADS)

    Espinola, Richard L.; Cha, Jae; Preece, Bradley

    2008-04-01

    The bandwidth requirements of modern target acquisition systems continue to increase with larger sensor formats and multi-spectral capabilities. To obviate this problem, still and moving imagery can be compressed, often resulting in greater than 100 fold decrease in required bandwidth. Compression, however, is generally not error-free and the generated artifacts can adversely affect task performance. The U.S. Army RDECOM CERDEC Night Vision and Electronic Sensors Directorate recently performed an assessment of various compression techniques on static imagery for tank identification. In this paper, we expand this initial assessment by studying and quantifying the effect of various video compression algorithms and their impact on tank identification performance. We perform a series of controlled human perception tests using three dynamic simulated scenarios: target moving/sensor static, target static/sensor static, sensor tracking the target. Results of this study will quantify the effect of video compression on target identification and provide a framework to evaluate video compression on future sensor systems.

  18. Compressive image acquisition and classification via secant projections

    NASA Astrophysics Data System (ADS)

    Li, Yun; Hegde, Chinmay; Sankaranarayanan, Aswin C.; Baraniuk, Richard; Kelly, Kevin F.

    2015-06-01

    Given its importance in a wide variety of machine vision applications, extending high-speed object detection and recognition beyond the visible spectrum in a cost-effective manner presents a significant technological challenge. As a step in this direction, we developed a novel approach for target image classification using a compressive sensing architecture. Here we report the first implementation of this approach utilizing the compressive single-pixel camera system. The core of our approach rests on the design of new measurement patterns, or projections, that are tuned to objects of interest. Our measurement patterns are based on the notion of secant projections of image classes that are constructed using two different approaches. Both approaches show at least a twofold improvement in terms of the number of measurements over the conventional, data-oblivious compressive matched filter. As more noise is added to the image, the second method proves to be the most robust.

  19. Efficient multimedia encryption via entropy codec design

    NASA Astrophysics Data System (ADS)

    Wu, Chung-Ping; Kuo, C.-C. Jay

    2001-08-01

    Efficient encryption algorithms are essential to multimedia data security, since the data size is large and real-time processing is often required. After discussing limitations of previous work on multimedia encryption, we propose a novel methodology for confidentiality, which turns entropy coders into encryption ciphers by using multiple statistical models. The choice of statistical models and the order in which they are applied are kept secret as the key Two encryption schemes are constructed by applying this methodology to the Huffman coder and the QM coder. It is shown that security is achieved without sacrificing the compression performance and the computational speed. The schemes can be applied to most modern compression systems such as MPEG audio, MPEG video and JPEG/JPEG2000 image compression.

  20. Reducing acquisition time in clinical MRI by data undersampling and compressed sensing reconstruction

    NASA Astrophysics Data System (ADS)

    Hollingsworth, Kieren Grant

    2015-11-01

    MRI is often the most sensitive or appropriate technique for important measurements in clinical diagnosis and research, but lengthy acquisition times limit its use due to cost and considerations of patient comfort and compliance. Once an image field of view and resolution is chosen, the minimum scan acquisition time is normally fixed by the amount of raw data that must be acquired to meet the Nyquist criteria. Recently, there has been research interest in using the theory of compressed sensing (CS) in MR imaging to reduce scan acquisition times. The theory argues that if our target MR image is sparse, having signal information in only a small proportion of pixels (like an angiogram), or if the image can be mathematically transformed to be sparse then it is possible to use that sparsity to recover a high definition image from substantially less acquired data. This review starts by considering methods of k-space undersampling which have already been incorporated into routine clinical imaging (partial Fourier imaging and parallel imaging), and then explains the basis of using compressed sensing in MRI. The practical considerations of applying CS to MRI acquisitions are discussed, such as designing k-space undersampling schemes, optimizing adjustable parameters in reconstructions and exploiting the power of combined compressed sensing and parallel imaging (CS-PI). A selection of clinical applications that have used CS and CS-PI prospectively are considered. The review concludes by signposting other imaging acceleration techniques under present development before concluding with a consideration of the potential impact and obstacles to bringing compressed sensing into routine use in clinical MRI.

  1. Reducing acquisition time in clinical MRI by data undersampling and compressed sensing reconstruction.

    PubMed

    Hollingsworth, Kieren Grant

    2015-11-01

    MRI is often the most sensitive or appropriate technique for important measurements in clinical diagnosis and research, but lengthy acquisition times limit its use due to cost and considerations of patient comfort and compliance. Once an image field of view and resolution is chosen, the minimum scan acquisition time is normally fixed by the amount of raw data that must be acquired to meet the Nyquist criteria. Recently, there has been research interest in using the theory of compressed sensing (CS) in MR imaging to reduce scan acquisition times. The theory argues that if our target MR image is sparse, having signal information in only a small proportion of pixels (like an angiogram), or if the image can be mathematically transformed to be sparse then it is possible to use that sparsity to recover a high definition image from substantially less acquired data. This review starts by considering methods of k-space undersampling which have already been incorporated into routine clinical imaging (partial Fourier imaging and parallel imaging), and then explains the basis of using compressed sensing in MRI. The practical considerations of applying CS to MRI acquisitions are discussed, such as designing k-space undersampling schemes, optimizing adjustable parameters in reconstructions and exploiting the power of combined compressed sensing and parallel imaging (CS-PI). A selection of clinical applications that have used CS and CS-PI prospectively are considered. The review concludes by signposting other imaging acceleration techniques under present development before concluding with a consideration of the potential impact and obstacles to bringing compressed sensing into routine use in clinical MRI. PMID:26448064

  2. The experiments and analysis of several selective video encryption methods

    NASA Astrophysics Data System (ADS)

    Zhang, Yue; Yang, Cheng; Wang, Lei

    2013-07-01

    This paper presents four methods for selective video encryption based on the MPEG-2 video compression,including the slices, the I-frames, the motion vectors, and the DCT coefficients. We use the AES encryption method for simulation experiment for the four methods on VS2010 Platform, and compare the video effects and the processing speed of each frame after the video encrypted. The encryption depth can be arbitrarily selected, and design the encryption depth by using the double limit counting method, so the accuracy can be increased.

  3. Multiple image encryption by phase retrieval

    NASA Astrophysics Data System (ADS)

    Di, Hong; Kang, Yanmei; Liu, Yueqin; Zhang, Xin

    2016-07-01

    Multiple image encryption (MIE) was proposed to increase the efficiency of encrypting images by processing several images simultaneously. Because of the advantage of optical technology in processing twodimensional images at high throughput, MIE has been significantly improved by use of methods originating from optics. Phase retrieval was the process of algorithmically finding solutions to the phase loss problem due to light detectors only capturing the intensity. It was to retrieve phase information for the determination of a structure from diffraction data. Error-reduction algorithm is a typical phase retrieval method. Here, we employ it to illustrate that methods in phase retrieval are able to encrypt multiple images and compress them into encrypted data simultaneously. Moreover, the decryption is also designed to handle multiple images at the same time. The whole process including both the encryption and decryption is proposed to improve MIE with respect to the compression and efficiency. The feasibility and encryption of the MIE scheme is demonstrated with encryption experiments under Gaussian white noise and unauthorized access.

  4. Design and implementation of a compressive infrared sampling for motion acquisition

    NASA Astrophysics Data System (ADS)

    Liu, Tong; Liu, Jun

    2014-12-01

    This article proposes a compressive infrared sampling method in pursuit of the acquisition and processing of human motion simultaneously. The spatial-temporal changes caused by the movements of the human body are intrinsical clues for determining the semantics of motion, while the movements of short-term changes can be considered as a sparse distribution compared with the sensing region. Several pyroelectric infrared (PIR) sensors with pseudo-random-coded Fresnel lenses are introduced to acquire and compress motion information synchronously. The compressive PIR array has the ability to record the changes in the thermal radiation field caused by movements and encode the motion information into low-dimensional sensory outputs directly. Therefore, the problem of recognizing a high-dimensional image sequence is cast as a low-dimensional sequence recognition process. A database involving various kinds of motion played by several people is built. Hausdorff distance-based template matching is employed for motion recognition. Experimental studies are conducted to validate the proposed method.

  5. Dynamic video encryption algorithm for H.264/AVC based on a spatiotemporal chaos system.

    PubMed

    Xu, Hui; Tong, Xiao-Jun; Zhang, Miao; Wang, Zhu; Li, Ling-Hao

    2016-06-01

    Video encryption schemes mostly employ the selective encryption method to encrypt parts of important and sensitive video information, aiming to ensure the real-time performance and encryption efficiency. The classic block cipher is not applicable to video encryption due to the high computational overhead. In this paper, we propose the encryption selection control module to encrypt video syntax elements dynamically which is controlled by the chaotic pseudorandom sequence. A novel spatiotemporal chaos system and binarization method is used to generate a key stream for encrypting the chosen syntax elements. The proposed scheme enhances the resistance against attacks through the dynamic encryption process and high-security stream cipher. Experimental results show that the proposed method exhibits high security and high efficiency with little effect on the compression ratio and time cost. PMID:27409446

  6. 48 CFR 352.239-71 - Standard for encryption language.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... language. 352.239-71 Section 352.239-71 Federal Acquisition Regulations System HEALTH AND HUMAN SERVICES... Standard for encryption language. As prescribed in 339.101(d)(2), the Contracting Officer shall insert the following clause: Standard for Encryption Language (January 2010) (a) The Contractor shall use...

  7. 48 CFR 352.239-71 - Standard for encryption language.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ... language. 352.239-71 Section 352.239-71 Federal Acquisition Regulations System HEALTH AND HUMAN SERVICES... Standard for encryption language. As prescribed in 339.101(d)(2), the Contracting Officer shall insert the following clause: Standard for Encryption Language (January 2010) (a) The Contractor shall use...

  8. 48 CFR 352.239-71 - Standard for encryption language.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... language. 352.239-71 Section 352.239-71 Federal Acquisition Regulations System HEALTH AND HUMAN SERVICES... Standard for encryption language. As prescribed in 339.101(d)(2), the Contracting Officer shall insert the following clause: Standard for Encryption Language (January 2010) (a) The Contractor shall use...

  9. 48 CFR 352.239-71 - Standard for encryption language.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... language. 352.239-71 Section 352.239-71 Federal Acquisition Regulations System HEALTH AND HUMAN SERVICES... Standard for encryption language. As prescribed in 339.101(d)(2), the Contracting Officer shall insert the following clause: Standard for Encryption Language (January 2010) (a) The Contractor shall use...

  10. 48 CFR 352.239-71 - Standard for encryption language.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... language. 352.239-71 Section 352.239-71 Federal Acquisition Regulations System HEALTH AND HUMAN SERVICES... Standard for encryption language. As prescribed in 339.101(d)(2), the Contracting Officer shall insert the following clause: Standard for Encryption Language (January 2010) (a) The Contractor shall use...

  11. Selective video encryption of a distributed coded bitstream using LDPC codes

    NASA Astrophysics Data System (ADS)

    Um, Hwayoung; Delp, Edward J.

    2006-02-01

    Selective encryption is a technique that is used to minimizec omputational complexity or enable system functionality by only encrypting a portion of a compressed bitstream while still achieving reasonable security. For selective encryption to work, we need to rely not only on the beneficial effects of redundancy reduction, but also on the characteristics of the compression algorithm to concentrate important data representing the source in a relatively small fraction of the compressed bitstream. These important elements of the compressed data become candidates for selective encryption. In this paper, we combine encryption and distributed video source coding to consider the choices of which types of bits are most effective for selective encryption of a video sequence that has been compressed using a distributed source coding method based on LDPC codes. Instead of encrypting the entire video stream bit by bit, we encrypt only the highly sensitive bits. By combining the compression and encryption tasks and thus reducing the number of bits encrypted, we can achieve a reduction in system complexity.

  12. Implementation of the IDEA algorithm for image encryption

    NASA Astrophysics Data System (ADS)

    Dang, Philip P.; Chau, Paul M.

    2000-11-01

    In this paper, we present an implementation of the IDEA algorithm for image encryption. The image encryption is incorporated into the compression algorithm for transmission over a data network. In the proposed method, Embedded Wavelet Zero-tree Coding is used for image compression. Experimental results show that our proposed scheme enhances data security and reduces the network bandwidth required for video transmissions. A software implementation and system architecture for hardware implementation of the IDEA image encryption algorithm based on Field Programmable Gate Array (FPGA) technology are presented in this paper.

  13. Performance characterization of compressed sensing positron emission tomography detectors and data acquisition system

    NASA Astrophysics Data System (ADS)

    Chang, Chen-Ming; Grant, Alexander M.; Lee, Brian J.; Kim, Ealgoo; Hong, KeyJo; Levin, Craig S.

    2015-08-01

    In the field of information theory, compressed sensing (CS) had been developed to recover signals at a lower sampling rate than suggested by the Nyquist-Shannon theorem, provided the signals have a sparse representation with respect to some base. CS has recently emerged as a method to multiplex PET detector readouts thanks to the sparse nature of 511 keV photon interactions in a typical PET study. We have shown in our previous numerical studies that, at the same multiplexing ratio, CS achieves higher signal-to-noise ratio (SNR) compared to Anger and cross-strip multiplexing. In addition, unlike Anger logic, multiplexing by CS preserves the capability to resolve multi-hit events, in which multiple pixels are triggered within the resolving time of the detector. In this work, we characterized the time, energy and intrinsic spatial resolution of two CS detectors and a data acquisition system we have developed for a PET insert system for simultaneous PET/MRI. The CS detector comprises a 2× 4 mosaic of 4× 4 arrays of 3.2× 3.2× 20 mm3 lutetium-yttrium orthosilicate crystals coupled one-to-one to eight 4× 4 silicon photomultiplier arrays. The total number of 128 pixels is multiplexed down to 16 readout channels by CS. The energy, coincidence time and intrinsic spatial resolution achieved by two CS detectors were 15.4+/- 0.1 % FWHM at 511 keV, 4.5 ns FWHM and 2.3 mm FWHM, respectively. A series of experiments were conducted to measure the sources of time jitter that limit the time resolution of the current system, which provides guidance for potential system design improvements. These findings demonstrate the feasibility of compressed sensing as a promising multiplexing method for PET detectors.

  14. Performance characterization of compressed sensing positron emission tomography detectors and data acquisition system.

    PubMed

    Chang, Chen-Ming; Grant, Alexander M; Lee, Brian J; Kim, Ealgoo; Hong, KeyJo; Levin, Craig S

    2015-08-21

    In the field of information theory, compressed sensing (CS) had been developed to recover signals at a lower sampling rate than suggested by the Nyquist-Shannon theorem, provided the signals have a sparse representation with respect to some base. CS has recently emerged as a method to multiplex PET detector readouts thanks to the sparse nature of 511 keV photon interactions in a typical PET study. We have shown in our previous numerical studies that, at the same multiplexing ratio, CS achieves higher signal-to-noise ratio (SNR) compared to Anger and cross-strip multiplexing. In addition, unlike Anger logic, multiplexing by CS preserves the capability to resolve multi-hit events, in which multiple pixels are triggered within the resolving time of the detector. In this work, we characterized the time, energy and intrinsic spatial resolution of two CS detectors and a data acquisition system we have developed for a PET insert system for simultaneous PET/MRI. The CS detector comprises a 2 x 4 mosaic of 4 x 4 arrays of 3.2 x 3.2 x 20 mm(3) lutetium-yttrium orthosilicate crystals coupled one-to-one to eight 4 x 4 silicon photomultiplier arrays. The total number of 128 pixels is multiplexed down to 16 readout channels by CS. The energy, coincidence time and intrinsic spatial resolution achieved by two CS detectors were 15.4±0.1% FWHM at 511 keV, 4.5 ns FWHM and 2.3 mm FWHM, respectively. A series of experiments were conducted to measure the sources of time jitter that limit the time resolution of the current system, which provides guidance for potential system design improvements. These findings demonstrate the feasibility of compressed sensing as a promising multiplexing method for PET detectors. PMID:26237671

  15. Optical encryption interface

    NASA Technical Reports Server (NTRS)

    Jackson, Deborah J. (Inventor)

    1998-01-01

    An analog optical encryption system based on phase scrambling of two-dimensional optical images and holographic transformation for achieving large encryption keys and high encryption speed. An enciphering interface uses a spatial light modulator for converting a digital data stream into a two dimensional optical image. The optical image is further transformed into a hologram with a random phase distribution. The hologram is converted into digital form for transmission over a shared information channel. A respective deciphering interface at a receiver reverses the encrypting process by using a phase conjugate reconstruction of the phase scrambled hologram.

  16. An Attack on Wavelet Tree Shuffling Encryption Schemes

    NASA Astrophysics Data System (ADS)

    Assegie, Samuel; Salama, Paul; King, Brian

    With the ubiquity of the internet and advances in technology, especially digital consumer electronics, demand for online multimedia services is ever increasing. While it's possible to achieve a great reduction in bandwidth utilization of multimedia data such as image and video through compression, security still remains a great concern. Traditional cryptographic algorithms/systems for data security are often not fast enough to process the vast amounts of data generated by the multimedia applications to meet the realtime constraints. Selective encryption is a new scheme for multimedia content protection. It involves encrypting only a portion of the data to reduce computational complexity(the amount of data to encrypt)while preserving a sufficient level of security. To achieve this, many selective encryption schemes are presented in different literatures. One of them is Wavelet Tree Shuffling. In this paper we assess the security of a wavelet tree shuffling encryption scheme.

  17. Compressive sensing based high-speed time-stretch optical microscopy for two-dimensional image acquisition.

    PubMed

    Guo, Qiang; Chen, Hongwei; Weng, Zhiliang; Chen, Minghua; Yang, Sigang; Xie, Shizhong

    2015-11-16

    In this paper, compressive sensing based high-speed time-stretch optical microscopy for two-dimensional (2D) image acquisition is proposed and experimentally demonstrated for the first time. A section of dispersion compensating fiber (DCF) is used to perform wavelength-to-time conversion and then ultrafast spectral shaping of broadband optical pulses can be achieved via high-speed intensity modulation. A 2D spatial disperser comprising a pair of orthogonally oriented dispersers is employed to produce spatially structured illumination for 2D image acquisition and a section of single mode fiber (SMF) is utilized for pulse compression in the optical domain. In our scheme, a 1.2-GHz photodetector and a 50-MHz analog-to-digital converter (ADC) are used to acquire the energy of the compressed pulses. Image reconstructions are demonstrated at a frame rate of 500 kHz and a sixteen-fold image compression is achieved in our proof-of-concept demonstration. PMID:26698446

  18. Sandia Scalable Encryption Software

    SciTech Connect

    Tarman, Thomas D.

    1997-08-13

    Sandia Scalable Encryption Library (SSEL) Version 1.0 is a library of functions that implement Sandia''s scalable encryption algorithm. This algorithm is used to encrypt Asynchronous Transfer Mode (ATM) data traffic, and is capable of operating on an arbitrary number of bits at a time (which permits scaling via parallel implementations), while being interoperable with differently scaled versions of this algorithm. The routines in this library implement 8 bit and 32 bit versions of a non-linear mixer which is compatible with Sandia''s hardware-based ATM encryptor.

  19. Investigating Encrypted Material

    NASA Astrophysics Data System (ADS)

    McGrath, Niall; Gladyshev, Pavel; Kechadi, Tahar; Carthy, Joe

    When encrypted material is discovered during a digital investigation and the investigator cannot decrypt the material then s/he is faced with the problem of how to determine the evidential value of the material. This research is proposing a methodology of extracting probative value from the encrypted file of a hybrid cryptosystem. The methodology also incorporates a technique for locating the original plaintext file. Since child pornography (KP) images and terrorist related information (TI) are transmitted in encrypted format the digital investigator must ask the question Cui Bono? - who benefits or who is the recipient? By doing this the scope of the digital investigation can be extended to reveal the intended recipient.

  20. Sandia Scalable Encryption Software

    1997-08-13

    Sandia Scalable Encryption Library (SSEL) Version 1.0 is a library of functions that implement Sandia''s scalable encryption algorithm. This algorithm is used to encrypt Asynchronous Transfer Mode (ATM) data traffic, and is capable of operating on an arbitrary number of bits at a time (which permits scaling via parallel implementations), while being interoperable with differently scaled versions of this algorithm. The routines in this library implement 8 bit and 32 bit versions of a non-linearmore » mixer which is compatible with Sandia''s hardware-based ATM encryptor.« less

  1. Encrypting Digital Camera with Automatic Encryption Key Deletion

    NASA Technical Reports Server (NTRS)

    Oakley, Ernest C. (Inventor)

    2007-01-01

    A digital video camera includes an image sensor capable of producing a frame of video data representing an image viewed by the sensor, an image memory for storing video data such as previously recorded frame data in a video frame location of the image memory, a read circuit for fetching the previously recorded frame data, an encryption circuit having an encryption key input connected to receive the previously recorded frame data from the read circuit as an encryption key, an un-encrypted data input connected to receive the frame of video data from the image sensor and an encrypted data output port, and a write circuit for writing a frame of encrypted video data received from the encrypted data output port of the encryption circuit to the memory and overwriting the video frame location storing the previously recorded frame data.

  2. A Selective Encryption Algorithm Based on AES for Medical Information

    PubMed Central

    Oh, Ju-Young; Chon, Ki-Hwan

    2010-01-01

    Objectives The transmission of medical information is currently a daily routine. Medical information needs efficient, robust and secure encryption modes, but cryptography is primarily a computationally intensive process. Towards this direction, we design a selective encryption scheme for critical data transmission. Methods We expand the advandced encrytion stanard (AES)-Rijndael with five criteria: the first is the compression of plain data, the second is the variable size of the block, the third is the selectable round, the fourth is the optimization of software implementation and the fifth is the selective function of the whole routine. We have tested our selective encryption scheme by C++ and it was compiled with Code::Blocks using a MinGW GCC compiler. Results The experimental results showed that our selective encryption scheme achieves a faster execution speed of encryption/decryption. In future work, we intend to use resource optimization to enhance the round operations, such as SubByte/InvSubByte, by exploiting similarities between encryption and decryption. Conclusions As encryption schemes become more widely used, the concept of hardware and software co-design is also a growing new area of interest. PMID:21818420

  3. An overview on scalable encryption for wireless multimedia access

    NASA Astrophysics Data System (ADS)

    Yu, Hong Heather

    2003-08-01

    Wireless environments present many challenges for secure multimedia access, especial streaming media. The availability of varying network bandwidths and diverse receiver device processing powers and storage spaces demand scalable and flexible approaches that are capable of adapting to changing network conditions as well as device capabilities. To meet these requirements, scalable and fine granularity scalable (FGS) compression algorithms were proposed and widely adopted to provide scalable access of multimedia with interoperability between different services and flexible support to receivers with different device capabilities. Encryption is one of the most important security tools to protect content from unauthorized use. If a medium data stream is encrypted using non-scalable cryptography algorithms, decryption at arbitrary bit rate to provide scalable services can hardly be accomplished. If a medium compressed using scalable coding needs to be protected and non-scalable cryptography algorithms are used, the advantages of scalable coding may be lost. Therefore scalable encryption techniques are needed to provide scalability or to preserve the FGS adaptation capability (if the media stream is FGS coded) and enable intermediate processing of encrypted data without unnecessary decryption. In this paper, we will give an overview of scalable encryption schemes and present a fine grained scalable encryption algorithm. One desirable feature is its simplicity and flexibility in supporting scalable multimedia communication and multimedia content access control in wireless environments.

  4. Key Generation for Fast Inversion of the Paillier Encryption Function

    NASA Astrophysics Data System (ADS)

    Hirano, Takato; Tanaka, Keisuke

    We study fast inversion of the Paillier encryption function. Especially, we focus only on key generation, and do not modify the Paillier encryption function. We propose three key generation algorithms based on the speeding-up techniques for the RSA encryption function. By using our algorithms, the size of the private CRT exponent is half of that of Paillier-CRT. The first algorithm employs the extended Euclidean algorithm. The second algorithm employs factoring algorithms, and can construct the private CRT exponent with low Hamming weight. The third algorithm is a variant of the second one, and has some advantage such as compression of the private CRT exponent and no requirement for factoring algorithms. We also propose the settings of the parameters for these algorithms and analyze the security of the Paillier encryption function by these algorithms against known attacks. Finally, we give experimental results of our algorithms.

  5. Format-Preserving Encryption

    NASA Astrophysics Data System (ADS)

    Bellare, Mihir; Ristenpart, Thomas; Rogaway, Phillip; Stegers, Till

    Format-preserving encryption (FPE) encrypts a plaintext of some specified format into a ciphertext of identical format—for example, encrypting a valid credit-card number into a valid credit-card number. The problem has been known for some time, but it has lacked a fully general and rigorous treatment. We provide one, starting off by formally defining FPE and security goals for it. We investigate the natural approach for achieving FPE on complex domains, the “rank-then-encipher” approach, and explore what it can and cannot do. We describe two flavors of unbalanced Feistel networks that can be used for achieving FPE, and we prove new security results for each. We revisit the cycle-walking approach for enciphering on a non-sparse subset of an encipherable domain, showing that the timing information that may be divulged by cycle walking is not a damaging thing to leak.

  6. The fast encryption package

    NASA Technical Reports Server (NTRS)

    Bishop, Matt

    1988-01-01

    The organization of some tools to help improve passwork security at a UNIX-based site is described along with how to install and use them. These tools and their associated library enable a site to force users to pick reasonably safe passwords (safe being site configurable) and to enable site management to try to crack existing passworks. The library contains various versions of a very fast implementation of the Data Encryption Standard and of the one-way encryption functions used to encryp the password.

  7. Adsorption Compressor For Acquisition and Compression aof Atmospheric C02 on Mars

    NASA Technical Reports Server (NTRS)

    Rapp, Donald; Karlmann, Paul B.; Clark, David L.; Carr, Chad M.

    1997-01-01

    A flight-prototype zeolite adsorption compressor is being developed as a reliable, efficient, cost-effective means of extracting and compressing atmospheric C02 on the surface of Mars for use as the first stage of a Mars in-sity C02 to 02 chemical conversion process.

  8. Using Chaotic System in Encryption

    NASA Astrophysics Data System (ADS)

    Findik, Oğuz; Kahramanli, Şirzat

    In this paper chaotic systems and RSA encryption algorithm are combined in order to develop an encryption algorithm which accomplishes the modern standards. E.Lorenz's weather forecast' equations which are used to simulate non-linear systems are utilized to create chaotic map. This equation can be used to generate random numbers. In order to achieve up-to-date standards and use online and offline status, a new encryption technique that combines chaotic systems and RSA encryption algorithm has been developed. The combination of RSA algorithm and chaotic systems makes encryption system.

  9. Chaos based encryption system for encrypting electroencephalogram signals.

    PubMed

    Lin, Chin-Feng; Shih, Shun-Han; Zhu, Jin-De

    2014-05-01

    In the paper, we use the Microsoft Visual Studio Development Kit and C# programming language to implement a chaos-based electroencephalogram (EEG) encryption system involving three encryption levels. A chaos logic map, initial value, and bifurcation parameter for the map were used to generate Level I chaos-based EEG encryption bit streams. Two encryption-level parameters were added to these elements to generate Level II chaos-based EEG encryption bit streams. An additional chaotic map and chaotic address index assignment process was used to implement the Level III chaos-based EEG encryption system. Eight 16-channel EEG Vue signals were tested using the encryption system. The encryption was the most rapid and robust in the Level III system. The test yielded superior encryption results, and when the correct deciphering parameter was applied, the EEG signals were completely recovered. However, an input parameter error (e.g., a 0.00001 % initial point error) causes chaotic encryption bit streams, preventing the recovery of 16-channel EEG Vue signals. PMID:24733526

  10. ATM encryption testing

    NASA Astrophysics Data System (ADS)

    Capell, Joyce; Deeth, David

    1996-01-01

    This paper describes why encryption was selected by Lockheed Martin Missiles & Space as the means for securing ATM networks. The ATM encryption testing program is part of an ATM network trial provided by Pacific Bell under the California Research Education Network (CalREN). The problem being addressed is the threat to data security which results when changing from a packet switched network infrastructure to a circuit switched ATM network backbone. As organizations move to high speed cell-based networks, there is a break down in the traditional security model which is designed to protect packet switched data networks from external attacks. This is due to the fact that most data security firewalls filter IP packets, restricting inbound and outbound protocols, e.g. ftp. ATM networks, based on cell-switching over virtual circuits, does not support this method for restricting access since the protocol information is not carried by each cell. ATM switches set up multiple virtual connections, thus there is no longer a single point of entry into the internal network. The problem is further complicated by the fact that ATM networks support high speed multi-media applications, including real time video and video teleconferencing which are incompatible with packet switched networks. The ability to restrict access to Lockheed Martin networks in support of both unclassified and classified communications is required before ATM network technology can be fully deployed. The Lockheed Martin CalREN ATM testbed provides the opportunity to test ATM encryption prototypes with actual applications to assess the viability of ATM encryption methodologies prior to installing large scale ATM networks. Two prototype ATM encryptors are being tested: (1) `MILKBUSH' a prototype encryptor developed by NSA for transmission of government classified data over ATM networks, and (2) a prototype ATM encryptor developed by Sandia National Labs in New Mexico, for the encryption of proprietary data.

  11. A Literature Review on Image Encryption Techniques

    NASA Astrophysics Data System (ADS)

    Khan, Majid; Shah, Tariq

    2014-12-01

    Image encryption plays a paramount part to guarantee classified transmission and capacity of image over web. Then again, a real-time image encryption confronts a more noteworthy test because of vast measure of information included. This paper exhibits an audit on image encryption in spatial, frequency and hybrid domains with both full encryption and selective encryption strategy.

  12. A New Color Image Encryption Scheme Using CML and a Fractional-Order Chaotic System

    PubMed Central

    Wu, Xiangjun; Li, Yang; Kurths, Jürgen

    2015-01-01

    The chaos-based image cryptosystems have been widely investigated in recent years to provide real-time encryption and transmission. In this paper, a novel color image encryption algorithm by using coupled-map lattices (CML) and a fractional-order chaotic system is proposed to enhance the security and robustness of the encryption algorithms with a permutation-diffusion structure. To make the encryption procedure more confusing and complex, an image division-shuffling process is put forward, where the plain-image is first divided into four sub-images, and then the position of the pixels in the whole image is shuffled. In order to generate initial conditions and parameters of two chaotic systems, a 280-bit long external secret key is employed. The key space analysis, various statistical analysis, information entropy analysis, differential analysis and key sensitivity analysis are introduced to test the security of the new image encryption algorithm. The cryptosystem speed is analyzed and tested as well. Experimental results confirm that, in comparison to other image encryption schemes, the new algorithm has higher security and is fast for practical image encryption. Moreover, an extensive tolerance analysis of some common image processing operations such as noise adding, cropping, JPEG compression, rotation, brightening and darkening, has been performed on the proposed image encryption technique. Corresponding results reveal that the proposed image encryption method has good robustness against some image processing operations and geometric attacks. PMID:25826602

  13. Steganographic optical image encryption system based on reversible data hiding and double random phase encoding

    NASA Astrophysics Data System (ADS)

    Chuang, Cheng-Hung; Chen, Yen-Lin

    2013-02-01

    This study presents a steganographic optical image encryption system based on reversible data hiding and double random phase encoding (DRPE) techniques. Conventional optical image encryption systems can securely transmit valuable images using an encryption method for possible application in optical transmission systems. The steganographic optical image encryption system based on the DRPE technique has been investigated to hide secret data in encrypted images. However, the DRPE techniques vulnerable to attacks and many of the data hiding methods in the DRPE system can distort the decrypted images. The proposed system, based on reversible data hiding, uses a JBIG2 compression scheme to achieve lossless decrypted image quality and perform a prior encryption process. Thus, the DRPE technique enables a more secured optical encryption process. The proposed method extracts and compresses the bit planes of the original image using the lossless JBIG2 technique. The secret data are embedded in the remaining storage space. The RSA algorithm can cipher the compressed binary bits and secret data for advanced security. Experimental results show that the proposed system achieves a high data embedding capacity and lossless reconstruction of the original images.

  14. Encryption and networking applications

    SciTech Connect

    Long, J.P.

    1995-04-01

    The DOE requires that sensitive unclassified data be protected while being transmitted electronically. On most large networks it is difficult and expensive to provide the required level of physical protection. At Sandia National Laboratories, we are assembling the structure necessary to protect sensitive unclassified data using software-based encryption. This approach has the advantage that the data can be protected after arrival at its destination without additional investment While Sandia has expertise in cryptography, we had not used cryptography in this field. This discussion deals with the client-server model of file-based data exchange and interactive access to on-line data bases using Unix workstations, Macs and PCs.

  15. Optical asymmetric image encryption using gyrator wavelet transform

    NASA Astrophysics Data System (ADS)

    Mehra, Isha; Nishchal, Naveen K.

    2015-11-01

    In this paper, we propose a new optical information processing tool termed as gyrator wavelet transform to secure a fully phase image, based on amplitude- and phase-truncation approach. The gyrator wavelet transform constitutes four basic parameters; gyrator transform order, type and level of mother wavelet, and position of different frequency bands. These parameters are used as encryption keys in addition to the random phase codes to the optical cryptosystem. This tool has also been applied for simultaneous compression and encryption of an image. The system's performance and its sensitivity to the encryption parameters, such as, gyrator transform order, and robustness has also been analyzed. It is expected that this tool will not only update current optical security systems, but may also shed some light on future developments. The computer simulation results demonstrate the abilities of the gyrator wavelet transform as an effective tool, which can be used in various optical information processing applications, including image encryption, and image compression. Also this tool can be applied for securing the color image, multispectral, and three-dimensional images.

  16. Flexible Timed-Release Encryption

    NASA Astrophysics Data System (ADS)

    Yoshida, Maki; Fujiwara, Toru

    This paper presents a new scheme for Timed-Release Encryption (TRE), which is mainly designed for global use. TRE aims to control the timing of disclosing information. The major approach to TRE assumes that any participants can receive a time token broadcasted by a trusted agent, called a time server. Our scheme is based on this approach and allows participants to generate an encrypted message that can be decrypted using designated or any authenticated time servers including even those which are authenticated after encryption. In this sense, our scheme has a more flexible framework in terms of message decryption.

  17. Quantum computing on encrypted data

    NASA Astrophysics Data System (ADS)

    Fisher, K. A. G.; Broadbent, A.; Shalm, L. K.; Yan, Z.; Lavoie, J.; Prevedel, R.; Jennewein, T.; Resch, K. J.

    2014-01-01

    The ability to perform computations on encrypted data is a powerful tool for protecting privacy. Recently, protocols to achieve this on classical computing systems have been found. Here, we present an efficient solution to the quantum analogue of this problem that enables arbitrary quantum computations to be carried out on encrypted quantum data. We prove that an untrusted server can implement a universal set of quantum gates on encrypted quantum bits (qubits) without learning any information about the inputs, while the client, knowing the decryption key, can easily decrypt the results of the computation. We experimentally demonstrate, using single photons and linear optics, the encryption and decryption scheme on a set of gates sufficient for arbitrary quantum computations. As our protocol requires few extra resources compared with other schemes it can be easily incorporated into the design of future quantum servers. These results will play a key role in enabling the development of secure distributed quantum systems.

  18. Quantum computing on encrypted data.

    PubMed

    Fisher, K A G; Broadbent, A; Shalm, L K; Yan, Z; Lavoie, J; Prevedel, R; Jennewein, T; Resch, K J

    2014-01-01

    The ability to perform computations on encrypted data is a powerful tool for protecting privacy. Recently, protocols to achieve this on classical computing systems have been found. Here, we present an efficient solution to the quantum analogue of this problem that enables arbitrary quantum computations to be carried out on encrypted quantum data. We prove that an untrusted server can implement a universal set of quantum gates on encrypted quantum bits (qubits) without learning any information about the inputs, while the client, knowing the decryption key, can easily decrypt the results of the computation. We experimentally demonstrate, using single photons and linear optics, the encryption and decryption scheme on a set of gates sufficient for arbitrary quantum computations. As our protocol requires few extra resources compared with other schemes it can be easily incorporated into the design of future quantum servers. These results will play a key role in enabling the development of secure distributed quantum systems. PMID:24445949

  19. All-optical encrypted movie.

    PubMed

    Mosso, Fabian; Barrera, John Fredy; Tebaldi, Myrian; Bolognini, Néstor; Torroba, Roberto

    2011-03-14

    We introduce for the first time the concept of an all-optical encrypted movie. This movie joints several encrypted frames corresponding to a time evolving situation employing the same encoding mask. Thanks to a multiplexing operation we compact the encrypted movie information into a single package. But the decryption of this single package implies the existence of cross-talk if we do not adequately pre-process the encoded information before multiplexing. In this regard, we introduce a grating modulation to each encoded image, and then we proceed to multiplexing. After appropriate filtering and synchronizing procedures applied to the multiplexing, we are able to decrypt and to reproduce the movie. This movie is only properly decoded when in possession of the right decoding key. The concept development is carried-out in virtual optical systems, both for the encrypting and the filtering-decrypting stages. Experimental results are shown to confirm our approach. PMID:21445211

  20. Optimal encryption of quantum bits

    SciTech Connect

    Boykin, P. Oscar; Roychowdhury, Vwani

    2003-04-01

    We show that 2n random classical bits are both necessary and sufficient for encrypting any unknown state of n quantum bits in an informationally secure manner. We also characterize the complete set of optimal protocols in terms of a set of unitary operations that comprise an orthonormal basis in a canonical inner product space. Moreover, a connection is made between quantum encryption and quantum teleportation that allows for a different proof of optimality of teleportation.

  1. Scalable encryption using alpha rooting

    NASA Astrophysics Data System (ADS)

    Wharton, Eric J.; Panetta, Karen A.; Agaian, Sos S.

    2008-04-01

    Full and partial encryption methods are important for subscription based content providers, such as internet and cable TV pay channels. Providers need to be able to protect their products while at the same time being able to provide demonstrations to attract new customers without giving away the full value of the content. If an algorithm were introduced which could provide any level of full or partial encryption in a fast and cost effective manner, the applications to real-time commercial implementation would be numerous. In this paper, we present a novel application of alpha rooting, using it to achieve fast and straightforward scalable encryption with a single algorithm. We further present use of the measure of enhancement, the Logarithmic AME, to select optimal parameters for the partial encryption. When parameters are selected using the measure, the output image achieves a balance between protecting the important data in the image while still containing a good overall representation of the image. We will show results for this encryption method on a number of images, using histograms to evaluate the effectiveness of the encryption.

  2. Image encryption in the wavelet domain

    NASA Astrophysics Data System (ADS)

    Bao, Long; Zhou, Yicong; Chen, C. L. Philip

    2013-05-01

    Most existing image encryption algorithms often transfer the original image into a noise-like image which is an apparent visual sign indicating the presence of an encrypted image. Motivated by the data hiding technologies, this paper proposes a novel concept of image encryption, namely transforming an encrypted original image into another meaningful image which is the final resulting encrypted image and visually the same as the cover image, overcoming the mentioned problem. Using this concept, we introduce a new image encryption algorithm based on the wavelet decomposition. Simulations and security analysis are given to show the excellent performance of the proposed concept and algorithm.

  3. A symmetrical image encryption scheme in wavelet and time domain

    NASA Astrophysics Data System (ADS)

    Luo, Yuling; Du, Minghui; Liu, Junxiu

    2015-02-01

    There has been an increasing concern for effective storages and secure transactions of multimedia information over the Internet. Then a great variety of encryption schemes have been proposed to ensure the information security while transmitting, but most of current approaches are designed to diffuse the data only in spatial domain which result in reducing storage efficiency. A lightweight image encryption strategy based on chaos is proposed in this paper. The encryption process is designed in transform domain. The original image is decomposed into approximation and detail components using integer wavelet transform (IWT); then as the more important component of the image, the approximation coefficients are diffused by secret keys generated from a spatiotemporal chaotic system followed by inverse IWT to construct the diffused image; finally a plain permutation is performed for diffusion image by the Logistic mapping in order to reduce the correlation between adjacent pixels further. Experimental results and performance analysis demonstrate the proposed scheme is an efficient, secure and robust encryption mechanism and it realizes effective coding compression to satisfy desirable storage.

  4. Scalable ATM encryption

    SciTech Connect

    1995-04-01

    In order to provide needed security assurances for traffic carried in Asynchronous Transfer Mode (ATM) networks, methods of protecting the integrity and privacy of traffic must be employed. Cryptographic methods can be used to assure authenticity and privacy, but are hard to scale and the incorporation of these methods into computer networks can severely impact functionality, reliability, and performance. To study these trade-offs, a research prototype encryptor/decryptor is under development. This prototype is to demonstrate the viability of implementing certain encryption techniques in high speed networks by processing Asynchronous Transfer Mode (ATM) cells in a SONET OC-3 payload. This paper describes the objectives and design trade-offs intended to be investigated with the prototype. User requirements for high performance computing and communication have driven Sandia to do work in the areas of functionality, reliability, security, and performance of high speed communication networks. Adherence to standards (including emerging standards) achieves greater functionality of high speed computer networks by providing wide interoperability of applications, network hardware, and network software.

  5. 47 CFR 90.553 - Encryption.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ...) and 1 CFR part 51. Copies of the standard listed in this section that are incorporated by reference... employed then the following encryption protocol must be used: Project 25 DES Encryption Protocol,...

  6. 47 CFR 90.553 - Encryption.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ...) and 1 CFR part 51. Copies of the standard listed in this section that are incorporated by reference... employed then the following encryption protocol must be used: Project 25 DES Encryption Protocol,...

  7. Broadcast Encryption for Differently Privileged

    NASA Astrophysics Data System (ADS)

    Jin, Hongxia; Lotspiech, Jeffery

    Broadcast encryption is a primary technology that has been used for content protection. It enables a broadcaster to distribute content to a set of users so that only a privileged subset of users can access the content and another subset of revoked users cannot access the content. The main enabling block in a broadcast encryption scheme is the session key block, which each authorized user processes differently, but each gets the same valid session key. Currently all existing broadcast encryption schemes have assumed that the content and authorized users are equally privileged. There are emerging scenarios that demand protection for content with different privileges and for users with different privileges. In this paper we shall present a new broadcast encryption scheme that continues to employ single session key blocks but provides different privileged protections for different content and users. In particular we will expand the elegant subset-cover-based broadcast encryption scheme. We shall introduce a new concept called “security class” into the session key blocks. We use keys derived from a chain of one-way functions. Our approach is simple, efficient and secure.

  8. Testing a Variety of Encryption Technologies

    SciTech Connect

    Henson, T J

    2001-04-09

    Review and test speeds of various encryption technologies using Entrust Software. Multiple encryption algorithms are included in the product. Algorithms tested were IDEA, CAST, DES, and RC2. Test consisted of taking a 7.7 MB Word document file which included complex graphics and timing encryption, decryption and signing. Encryption is discussed in the GIAC Kickstart section: Information Security: The Big Picture--Part VI.

  9. Private predictive analysis on encrypted medical data.

    PubMed

    Bos, Joppe W; Lauter, Kristin; Naehrig, Michael

    2014-08-01

    Increasingly, confidential medical records are being stored in data centers hosted by hospitals or large companies. As sophisticated algorithms for predictive analysis on medical data continue to be developed, it is likely that, in the future, more and more computation will be done on private patient data. While encryption provides a tool for assuring the privacy of medical information, it limits the functionality for operating on such data. Conventional encryption methods used today provide only very restricted possibilities or none at all to operate on encrypted data without decrypting it first. Homomorphic encryption provides a tool for handling such computations on encrypted data, without decrypting the data, and without even needing the decryption key. In this paper, we discuss possible application scenarios for homomorphic encryption in order to ensure privacy of sensitive medical data. We describe how to privately conduct predictive analysis tasks on encrypted data using homomorphic encryption. As a proof of concept, we present a working implementation of a prediction service running in the cloud (hosted on Microsoft's Windows Azure), which takes as input private encrypted health data, and returns the probability for suffering cardiovascular disease in encrypted form. Since the cloud service uses homomorphic encryption, it makes this prediction while handling only encrypted data, learning nothing about the submitted confidential medical data. PMID:24835616

  10. Multichanneled puzzle-like encryption

    NASA Astrophysics Data System (ADS)

    Amaya, Dafne; Tebaldi, Myrian; Torroba, Roberto; Bolognini, Néstor

    2008-07-01

    In order to increase data security transmission we propose a multichanneled puzzle-like encryption method. The basic principle relies on the input information decomposition, in the same way as the pieces of a puzzle. Each decomposed part of the input object is encrypted separately in a 4 f double random phase mask architecture, by setting the optical parameters in a determined status. Each parameter set defines a channel. In order to retrieve the whole information it is necessary to properly decrypt and compose all channels. Computer simulations that confirm our proposal are presented.

  11. Enhancement of utilization of encryption engine

    DOEpatents

    Robertson, Robert J.; Witzke, Edward L.

    2008-04-22

    A method of enhancing throughput of a pipelined encryption/decryption engine for an encryption/decryption process has a predetermined number of stages and provides feedback around the stages (and of such an encryption/decryption engine) by receiving a source datablock for a given stage and encryption/decryption context identifier; indexing according to the encryption/decryption context identifier into a bank of initial variables to retrieve an initial variable for the source datablock; and generating an output datablock from the source datablock and its corresponding initial variable.

  12. Optical image encryption in phase space

    NASA Astrophysics Data System (ADS)

    Liu, Jun; Xu, Xiaobin; Situ, Guohai; Wu, Quanying

    2014-11-01

    In the field of optical information security, the research of double random phase encoding is becoming deeper with each passing day, however the encryption system is linear, and the dependencies between plaintext and ciphertext is not complicated, with leaving a great hidden danger to the security of the encryption system. In this paper, we encrypted the higher dimensional Wigner distribution function of low dimensional plaintext by using the bilinear property of Wigner distribution function. Computer simulation results show that this method can not only enlarge the key space, but also break through the linear characteristic of the traditional optical encryption technology. So it can significantly improve the safety of the encryption system.

  13. Simultaneous transmission for an encrypted image and a double random-phase encryption key

    NASA Astrophysics Data System (ADS)

    Yuan, Sheng; Zhou, Xin; Li, Da-Hai; Zhou, Ding-Fu

    2007-06-01

    We propose a method to simultaneously transmit double random-phase encryption key and an encrypted image by making use of the fact that an acceptable decryption result can be obtained when only partial data of the encrypted image have been taken in the decryption process. First, the original image data are encoded as an encrypted image by a double random-phase encryption technique. Second, a double random-phase encryption key is encoded as an encoded key by the Rivest-Shamir-Adelman (RSA) public-key encryption algorithm. Then the amplitude of the encrypted image is modulated by the encoded key to form what we call an encoded image. Finally, the encoded image that carries both the encrypted image and the encoded key is delivered to the receiver. Based on such a method, the receiver can have an acceptable result and secure transmission can be guaranteed by the RSA cipher system.

  14. Method for encryption and transmission of digital keying data

    SciTech Connect

    Mniszewski, S.M.; Springer, E.A.; Brenner, D.P.

    1988-03-29

    A cryptographic method for encrypting, transmitting and decrypting keying data between a master unit and at least one remote unit is described comprising the steps of: storing in the master unit and in the remote unit key encryption keys, generating a first storage address effective to identify a master key encryption key from the key encryption keys; indexing the first storage address by a first predetermined amount to define a second storage address effective to identify a first key encryption key from the key encryption keys; indexing the first storage address by a second predetermined amount to define a third storage address effective to identify a second key encryption key from the key encryption keys; generating a data encryption key in the master unit, using the first key encryption key; encrypting the data encryption key using the second key encryption key to produce an encrypted data encryption key; downloading to the remote unit the encrypted data encryption key together with a designator value for identifying the address of the second key encryption key at the remote unit; and decrypting the encrypted data encryption key at the remote unit to reproduce the data encryption key at the remote unit.

  15. Method for encryption and transmission of digital keying data

    DOEpatents

    Mniszewski, Susan M.; Springer, Edward A.; Brenner, David P.

    1988-01-01

    A method for the encryption, transmission, and subsequent decryption of digital keying data. The method utilizes the Data Encryption Standard and is implemented by means of a pair of apparatus, each of which is selectable to operate as either a master unit or remote unit. Each unit contains a set of key encryption keys which are indexed by a common indexing system. The master unit operates upon command from the remote unit to generate a data encryption key and encrypt the data encryption key using a preselected key encryption key. The encrypted data encryption key and an index designator are then downloaded to the remote unit, where the data encryption key is decrypted for subsequent use in the encryption and transmission data. Downloading of the encrypted data encryption key enables frequent change of keys without requiring manual entry or storage of keys at the remote unit.

  16. Optical encryption system using quadrature multiplexing

    NASA Astrophysics Data System (ADS)

    Islam, Mohammed Nazrul; Alam, Mohammad S.

    2006-08-01

    Optical security systems have attracted much research interest recently for information security and fraud deterrent applications. A number of encryption techniques have been proposed in the literature, which includes double random-phase encryption, polarization encoding, encryption and verification using a multiplexed minimum average correlation energy phase-encrypted filter. Most of these reports employ a pseudo-random code for each information to be encrypted, where it requires individual storage capacity or transmission channel for further processing of each information. The objective of this paper is to develop an optical encryption system employing quadrature multiplexing to enhance the storage/transmission capacity of the system. Two information signals are encrypted using the same code but employing two orthogonal functions and then they are multiplexed together in the same domain. As the orthogonal functions have zero cross-correlation between them, so the encrypted information are expected to be unaffected by each other. Each encryption and multiplexing process can accommodate two information signals for a single code and a single storage cell or transmission channel. The same process can be performed in multiple steps to increase the multiplexing capability of the system. For decryption purpose, the composite encoded signal is correlated using the appropriate code and the appropriate function. The proposed technique has been found to work excellent in computer simulation with binary as well as gray level images. It has also been verified that the encrypted images remain secure, because no unwanted reproduction is possible without having the appropriate code and function.

  17. A framework for MPEG-21 DIA based adaptation and perceptual encryption of H.264 video

    NASA Astrophysics Data System (ADS)

    Iqbal, Razib; Shirmohammadi, Shervin; El Saddik, Abdulmotaleb

    2007-01-01

    A ubiquitous computing concept permits end users to have access to multimedia and digital content anywhere, anytime and in any way they want. As a consequence, the importance of resource customization according to user preferences and device requirements set the primary challenge towards seamless access. Moreover, once a suitable customization approach has been decided (e.g. adaptation), deploying it in the existing network requires a generic and widely accepted standard applied to the process. With the advancement of time, performing encryption in the compressed domain should also be taken care of not only for serving sensitive digital contents but also for offering security as an embedded feature of the adaptation practice to ensure digital right management and confidentiality. In this paper, we present an architecture for temporal adaptation of ITU-T H.264 video conforming to ISO/IEC MPEG-21 DIA. In addition, we present a perceptual encryption scheme that is integrated in the system for video encryption. The framework enables video bitstreams to be adapted and encrypted in the compressed domain, eliminating cascaded adaptation (i.e. decoding - adaptation - encoding). The encryption framework is applied on the adapted video content, which reduces computational overhead compared to that on the original content. A prototype, based on the proposed architecture and experimental evaluations of the system as well as its performance supporting the architecture are also presented.

  18. Pure optical dynamical color encryption.

    PubMed

    Mosso, Fabian; Tebaldi, Myrian; Barrera, John Fredy; Bolognini, Néstor; Torroba, Roberto

    2011-07-18

    We introduce a way to encrypt-decrypt a color dynamical phenomenon using a pure optical alternative. We split the three basic chromatic channels composing the input, and then each channel is processed through a 4f encoding method and a theta modulation applied to the each encrypted frame in every channel. All frames for a single channel are multiplexed. The same phase mask is used to encode all the information. Unlike the usual procedure we do not multiplex the three chromatic channels into a single encoding media, because we want to decrypt the information in real time. Then, we send to the decoding station the phase mask and the three packages each one containing the multiplexing of a single channel. The end user synchronizes and decodes the information contained in the separate channels. Finally, the decoding information is conveyed together to bring the decoded dynamical color phenomenon in real-time. We present material that supports our concepts. PMID:21934738

  19. Pure optical dynamical color encryption

    NASA Astrophysics Data System (ADS)

    Mosso, Fabian; Tebaldi, Myrian; Fredy Barrera, John; Bolognini, Néstor; Torroba, Roberto

    2011-07-01

    We introduce a way to encrypt-decrypt a color dynamical phenomenon using a pure optical alternative. We split the three basic chromatic channels composing the input, and then each channel is processed through a 4f encoding method and a theta modulation applied to the each encrypted frame in every channel. All frames for a single channel are multiplexed. The same phase mask is used to encode all the information. Unlike the usual procedure we do not multiplex the three chromatic channels into a single encoding media, because we want to decrypt the information in real time. Then, we send to the decoding station the phase mask and the three packages each one containing the multiplexing of a single channel. The end user synchronizes and decodes the information contained in the separate channels. Finally, the decoding information is conveyed together to bring the decoded dynamical color phenomenon in real-time. We present material that supports our concepts.

  20. Multiplexing of encrypted data using fractal masks.

    PubMed

    Barrera, John F; Tebaldi, Myrian; Amaya, Dafne; Furlan, Walter D; Monsoriu, Juan A; Bolognini, Néstor; Torroba, Roberto

    2012-07-15

    In this Letter, we present to the best of our knowledge a new all-optical technique for multiple-image encryption and multiplexing, based on fractal encrypting masks. The optical architecture is a joint transform correlator. The multiplexed encrypted data are stored in a photorefractive crystal. The fractal parameters of the key can be easily tuned to lead to a multiplexing operation without cross talk effects. Experimental results that support the potential of the method are presented. PMID:22825170

  1. Novel Image Encryption based on Quantum Walks

    PubMed Central

    Yang, Yu-Guang; Pan, Qing-Xiang; Sun, Si-Jia; Xu, Peng

    2015-01-01

    Quantum computation has achieved a tremendous success during the last decades. In this paper, we investigate the potential application of a famous quantum computation model, i.e., quantum walks (QW) in image encryption. It is found that QW can serve as an excellent key generator thanks to its inherent nonlinear chaotic dynamic behavior. Furthermore, we construct a novel QW-based image encryption algorithm. Simulations and performance comparisons show that the proposal is secure enough for image encryption and outperforms prior works. It also opens the door towards introducing quantum computation into image encryption and promotes the convergence between quantum computation and image processing. PMID:25586889

  2. Advanced technologies for encryption of satellite links

    NASA Astrophysics Data System (ADS)

    McMahan, Sherry S.

    The use of encryption on satellite links is discussed. Advanced technology exists to provide transmission security for large earth station with data rates up to 50 megabits per second. One of the major concerns in the use of encryption equipment with very small aperture terminals (VSAT) is the key management issue and the related operational costs. The low cost requirement and the lack of physical protection of remote VSATs place severe constraints on the design of encryption equipment. Encryption may be accomplished by embedding a tamper proof encryption module into the baseband unit of each VSAT. VSAT networks are usually star networks where there is a single large earth station that serves as a hub and all satellite communications takes place between each VSAT and the hub earth station. The hub earth station has the secret master key of each VSAT. These master keys are used to downline load encrypted session keys to each VSAT. A more secure alternative is to use public key techniques where each embedded VSAT encryption module internally generates its own secret and public numbers. The secret number never leaves the module while the public number is sent to the hub at the time of initialization of the encryption module into the VSAT. Physical access control to encryption modules of VSAT systems can be implemented using passwords, smart cards or biometrics.

  3. Novel image encryption based on quantum walks.

    PubMed

    Yang, Yu-Guang; Pan, Qing-Xiang; Sun, Si-Jia; Xu, Peng

    2015-01-01

    Quantum computation has achieved a tremendous success during the last decades. In this paper, we investigate the potential application of a famous quantum computation model, i.e., quantum walks (QW) in image encryption. It is found that QW can serve as an excellent key generator thanks to its inherent nonlinear chaotic dynamic behavior. Furthermore, we construct a novel QW-based image encryption algorithm. Simulations and performance comparisons show that the proposal is secure enough for image encryption and outperforms prior works. It also opens the door towards introducing quantum computation into image encryption and promotes the convergence between quantum computation and image processing. PMID:25586889

  4. Decryption with incomplete cyphertext and multiple-information encryption in phase space.

    PubMed

    Xu, Xiaobin; Wu, Quanying; Liu, Jun; Situ, Guohai

    2016-01-25

    Recently, we have demonstrated that information encryption in phase space offers security enhancement over the traditional encryption schemes operating in real space. However, there is also an important issue with this technique: increasing the cost for data transmitting and storage. To address this issue, here we investigate the problem of decryption using incomplete cyphertext. We show that the analytic solution under the traditional framework set the lower limit of decryption performance. More importantly, we demonstrate that one just needs a small amount of cyphertext to recover the plaintext signal faithfully using compressive sensing, meaning that the amount of data that needs to transmit and store can be significantly reduced. This leads to multiple information encryption so that we can use the system bandwidth more effectively. We also provide an optical experimental result to demonstrate the plaintext recovered in phase space. PMID:26832552

  5. 15 CFR 742.15 - Encryption items.

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    ... 15 Commerce and Foreign Trade 2 2010-01-01 2010-01-01 false Encryption items. 742.15 Section 742.15 Commerce and Foreign Trade Regulations Relating to Commerce and Foreign Trade (Continued) BUREAU OF INDUSTRY AND SECURITY, DEPARTMENT OF COMMERCE EXPORT ADMINISTRATION REGULATIONS CONTROL POLICY-CCL BASED CONTROLS § 742.15 Encryption...

  6. 15 CFR 742.15 - Encryption items.

    Code of Federal Regulations, 2011 CFR

    2011-01-01

    ... 15 Commerce and Foreign Trade 2 2011-01-01 2011-01-01 false Encryption items. 742.15 Section 742.15 Commerce and Foreign Trade Regulations Relating to Commerce and Foreign Trade (Continued) BUREAU OF INDUSTRY AND SECURITY, DEPARTMENT OF COMMERCE EXPORT ADMINISTRATION REGULATIONS CONTROL POLICY-CCL BASED CONTROLS § 742.15 Encryption...

  7. Image encryption using the fractional wavelet transform

    NASA Astrophysics Data System (ADS)

    Vilardy, Juan M.; Useche, J.; Torres, C. O.; Mattos, L.

    2011-01-01

    In this paper a technique for the coding of digital images is developed using Fractional Wavelet Transform (FWT) and random phase masks (RPMs). The digital image to encrypt is transformed with the FWT, after the coefficients resulting from the FWT (Approximation, Details: Horizontal, vertical and diagonal) are multiplied each one by different RPMs (statistically independent) and these latest results is applied an Inverse Wavelet Transform (IWT), obtaining the encrypted digital image. The decryption technique is the same encryption technique in reverse sense. This technique provides immediate advantages security compared to conventional techniques, in this technique the mother wavelet family and fractional orders associated with the FWT are additional keys that make access difficult to information to an unauthorized person (besides the RPMs used), thereby the level of encryption security is extraordinarily increased. In this work the mathematical support for the use of the FWT in the computational algorithm for the encryption is also developed.

  8. Optical encryption for large-sized images

    NASA Astrophysics Data System (ADS)

    Sanpei, Takuho; Shimobaba, Tomoyoshi; Kakue, Takashi; Endo, Yutaka; Hirayama, Ryuji; Hiyama, Daisuke; Hasegawa, Satoki; Nagahama, Yuki; Sano, Marie; Oikawa, Minoru; Sugie, Takashige; Ito, Tomoyoshi

    2016-02-01

    We propose an optical encryption framework that can encrypt and decrypt large-sized images beyond the size of the encrypted image using our two methods: random phase-free method and scaled diffraction. In order to record the entire image information on the encrypted image, the large-sized images require the random phase to widely diffuse the object light over the encrypted image; however, the random phase gives rise to the speckle noise on the decrypted images, and it may be difficult to recognize the decrypted images. In order to reduce the speckle noise, we apply our random phase-free method to the framework. In addition, we employ scaled diffraction that calculates light propagation between planes with different sizes by changing the sampling rates.

  9. Selective encryption for H.264/AVC video coding

    NASA Astrophysics Data System (ADS)

    Shi, Tuo; King, Brian; Salama, Paul

    2006-02-01

    Due to the ease with which digital data can be manipulated and due to the ongoing advancements that have brought us closer to pervasive computing, the secure delivery of video and images has become a challenging problem. Despite the advantages and opportunities that digital video provide, illegal copying and distribution as well as plagiarism of digital audio, images, and video is still ongoing. In this paper we describe two techniques for securing H.264 coded video streams. The first technique, SEH264Algorithm1, groups the data into the following blocks of data: (1) a block that contains the sequence parameter set and the picture parameter set, (2) a block containing a compressed intra coded frame, (3) a block containing the slice header of a P slice, all the headers of the macroblock within the same P slice, and all the luma and chroma DC coefficients belonging to the all the macroblocks within the same slice, (4) a block containing all the ac coefficients, and (5) a block containing all the motion vectors. The first three are encrypted whereas the last two are not. The second method, SEH264Algorithm2, relies on the use of multiple slices per coded frame. The algorithm searches the compressed video sequence for start codes (0x000001) and then encrypts the next N bits of data.

  10. Quantum fully homomorphic encryption scheme based on universal quantum circuit

    NASA Astrophysics Data System (ADS)

    Liang, Min

    2015-08-01

    Fully homomorphic encryption enables arbitrary computation on encrypted data without decrypting the data. Here it is studied in the context of quantum information processing. Based on universal quantum circuit, we present a quantum fully homomorphic encryption (QFHE) scheme, which permits arbitrary quantum transformation on any encrypted data. The QFHE scheme is proved to be perfectly secure. In the scheme, the decryption key is different from the encryption key; however, the encryption key cannot be revealed. Moreover, the evaluation algorithm of the scheme is independent of the encryption key, so it is suitable for delegated quantum computing between two parties.

  11. Limitations on information-theoretically-secure quantum homomorphic encryption

    NASA Astrophysics Data System (ADS)

    Yu, Li; Pérez-Delgado, Carlos A.; Fitzsimons, Joseph F.

    2014-11-01

    Homomorphic encryption is a form of encryption which allows computation to be carried out on the encrypted data without the need for decryption. The success of quantum approaches to related tasks in a delegated computation setting has raised the question of whether quantum mechanics may be used to achieve information-theoretically-secure fully homomorphic encryption. Here we show, via an information localization argument, that deterministic fully homomorphic encryption necessarily incurs exponential overhead if perfect security is required.

  12. Video Encryption and Decryption on Quantum Computers

    NASA Astrophysics Data System (ADS)

    Yan, Fei; Iliyasu, Abdullah M.; Venegas-Andraca, Salvador E.; Yang, Huamin

    2015-08-01

    A method for video encryption and decryption on quantum computers is proposed based on color information transformations on each frame encoding the content of the encoding the content of the video. The proposed method provides a flexible operation to encrypt quantum video by means of the quantum measurement in order to enhance the security of the video. To validate the proposed approach, a tetris tile-matching puzzle game video is utilized in the experimental simulations. The results obtained suggest that the proposed method enhances the security and speed of quantum video encryption and decryption, both properties required for secure transmission and sharing of video content in quantum communication.

  13. Image encryption with chaotically coupled chaotic maps

    NASA Astrophysics Data System (ADS)

    Pisarchik, A. N.; Zanin, M.

    2008-10-01

    We present a novel secure cryptosystem for direct encryption of color images, based on chaotically coupled chaotic maps. The proposed cipher provides good confusion and diffusion properties that ensures extremely high security because of the chaotic mixing of pixels’ colors. Information is mixed and distributed over a complete image using a complex strategy that makes known plaintext attack unfeasible. The encryption algorithm guarantees the three main goals of cryptography: strong cryptographic security, short encryption/decryption time, and robustness against noise and other external disturbances. Due to the high speed, the proposed cryptosystem is suitable for application in real-time communication systems.

  14. 15 CFR 742.15 - Encryption items.

    Code of Federal Regulations, 2014 CFR

    2014-01-01

    ... classification, registration or self-classification reporting is a laptop computer that without encryption would...; home use networking commodities and software (e.g., personal firewalls, cable modems for...

  15. 15 CFR 742.15 - Encryption items.

    Code of Federal Regulations, 2012 CFR

    2012-01-01

    ... classification, registration or self-classification reporting is a laptop computer that without encryption would...; home use networking commodities and software (e.g., personal firewalls, cable modems for...

  16. 15 CFR 742.15 - Encryption items.

    Code of Federal Regulations, 2013 CFR

    2013-01-01

    ... classification, registration or self-classification reporting is a laptop computer that without encryption would...; home use networking commodities and software (e.g., personal firewalls, cable modems for...

  17. Quantum Secure Dialogue with Quantum Encryption

    NASA Astrophysics Data System (ADS)

    Ye, Tian-Yu

    2014-09-01

    How to solve the information leakage problem has become the research focus of quantum dialogue. In this paper, in order to overcome the information leakage problem in quantum dialogue, a novel approach for sharing the initial quantum state privately between communicators, i.e., quantum encryption sharing, is proposed by utilizing the idea of quantum encryption. The proposed protocol uses EPR pairs as the private quantum key to encrypt and decrypt the traveling photons, which can be repeatedly used after rotation. Due to quantum encryption sharing, the public announcement on the state of the initial quantum state is omitted, thus the information leakage problem is overcome. The information-theoretical efficiency of the proposed protocol is nearly 100%, much higher than previous information leakage resistant quantum dialogue protocols. Moreover, the proposed protocol only needs single-photon measurements and nearly uses single photons as quantum resource so that it is convenient to implement in practice.

  18. WEDDS: The WITS Encrypted Data Delivery System

    NASA Technical Reports Server (NTRS)

    Norris, J.; Backes, P.

    1999-01-01

    WEDDS, the WITS Encrypted Data Delivery System, is a framework for supporting distributed mission operations by automatically transferring sensitive mission data in a secure and efficient manner to and from remote mission participants over the internet.

  19. Multidimensional data encryption with virtual optics

    NASA Astrophysics Data System (ADS)

    Yu, Lingfeng

    Information security is very important in many application areas in the field of information technology. Recently, a number of optical encryption methods have been proposed for the purpose of information hiding and data security, because optical information processing techniques have obvious advantages such as high degrees of freedom (e.g. amplitude, phase, polarization, wavelength) for encryption and decryption, and high-level data security. However, the limitations of current optical encryption methods relate to the complexity of their optical hardware, the requirements of the information type, lack of flexibility, and the lack of compact and low-cost optoelectronics devices and systems. These problems make it difficult to move optical encryption out of the research lab and into real world application areas. In this thesis, a novel parameterized multidimensional data encryption method based on the concept of "virtual optics" is proposed. A strong motivation for the research in this thesis is to overcome the abovementioned problems currently existing in optical encryption and to retain most of the favorable features of optical encryption. The phrase "virtual optics" means that both the optical encryption and decryption processes are implemented in an all-digital manner, adopting optical information processing technologies such as optical holography, optical diffraction or other relevant optical processes. In addition to utilizing some geometric and physical parameters derived from a configuration of digital optics, some information disarrangement actions have also been suggested as tools for designing multiple locks and keys for data encryption in hyperspace. The sensitivities of these supposed keys are quantitatively analyzed and the possible security level of the proposed cryptosystem is assessed. Security of the cryptosystem is also analyzed by examining some possible attacks on the cryptosystem from the viewpoint of a cryptanalysis. This thesis has shown the

  20. ElGamal cryptosystem with embedded compression-crypto technique

    NASA Astrophysics Data System (ADS)

    Mandangan, Arif; Yin, Lee Souk; Hung, Chang Ee; Hussin, Che Haziqah Che

    2014-12-01

    Key distribution problem in symmetric cryptography has been solved by the emergence of asymmetric cryptosystem. Due to its mathematical complexity, computation efficiency becomes a major problem in the real life application of asymmetric cryptosystem. This scenario encourage various researches regarding the enhancement of computation efficiency of asymmetric cryptosystems. ElGamal cryptosystem is one of the most established asymmetric cryptosystem. By using proper parameters, ElGamal cryptosystem is able to provide a good level of information security. On the other hand, Compression-Crypto technique is a technique used to reduce the number of plaintext to be encrypted from k∈ Z+, k > 2 plaintext become only 2 plaintext. Instead of encrypting k plaintext, we only need to encrypt these 2 plaintext. In this paper, we embed the Compression-Crypto technique into the ElGamal cryptosystem. To show that the embedded ElGamal cryptosystem works, we provide proofs on the decryption processes to recover the encrypted plaintext.

  1. Dual-Layer Video Encryption using RSA Algorithm

    NASA Astrophysics Data System (ADS)

    Chadha, Aman; Mallik, Sushmit; Chadha, Ankit; Johar, Ravdeep; Mani Roja, M.

    2015-04-01

    This paper proposes a video encryption algorithm using RSA and Pseudo Noise (PN) sequence, aimed at applications requiring sensitive video information transfers. The system is primarily designed to work with files encoded using the Audio Video Interleaved (AVI) codec, although it can be easily ported for use with Moving Picture Experts Group (MPEG) encoded files. The audio and video components of the source separately undergo two layers of encryption to ensure a reasonable level of security. Encryption of the video component involves applying the RSA algorithm followed by the PN-based encryption. Similarly, the audio component is first encrypted using PN and further subjected to encryption using the Discrete Cosine Transform. Combining these techniques, an efficient system, invulnerable to security breaches and attacks with favorable values of parameters such as encryption/decryption speed, encryption/decryption ratio and visual degradation; has been put forth. For applications requiring encryption of sensitive data wherein stringent security requirements are of prime concern, the system is found to yield negligible similarities in visual perception between the original and the encrypted video sequence. For applications wherein visual similarity is not of major concern, we limit the encryption task to a single level of encryption which is accomplished by using RSA, thereby quickening the encryption process. Although some similarity between the original and encrypted video is observed in this case, it is not enough to comprehend the happenings in the video.

  2. Image encryption by redirection and cyclical shift

    NASA Astrophysics Data System (ADS)

    Grigoryan, Artyom M.; Wiatrek, Bryan A.; Agaian, Sos S.

    2015-05-01

    In this paper, we present a novel method for encrypting and decrypting large amounts of data such as two-dimensional (2-D) images, both gray-scale and color, without the loss of information, and using private keys of varying lengths. The proposed method is based on the concept of the tensor representation of an image and splitting the 2-D discrete Fourier transform (DFT) by one-dimensional (1-D) DFTs of signals from the tensor representation, or transform. The splitting of the transform is accomplished in a three-dimensional (3-D) space, namely on the 3-D lattice placed on the torus. Each splitting-signal of the image defines the 2-D DFT along the frequency-points located on the spirals on the torus. Spirals have different form and cover the lattice on the torus in a complex form, which makes them very effective when moving data through and between the spirals, and data along the spirals. The encryption consists of several iterative applications of mapping the 3-D torus into several ones of smaller sizes, and rotates then moves the data around the spirals on all tori. The encryption results in the image which is uncorrelated. The decryption algorithm uses the encrypted data, and processes them in inverse order with an identical number of iterations. The proposed method can be extended to encrypt and decrypt documents as well as other types of digital media. Simulation results of the purposed method are presented to show the performance for image encryption.

  3. Visual cryptography based on optical interference encryption technique

    NASA Astrophysics Data System (ADS)

    Seo, Dong-Hoan; Kim, Jong-Yun; Lee, Sang-Su; Park, Se-Joon; Cho, Woong H.; Kim, Soo-Joong

    2001-07-01

    In this paper, we proposed a new visual cryptography scheme based on optical interference that can improve the contrast and signal to noise ratio of reconstructed images when compared to conventional visual cryptography methods. The binary image being encrypted is divided into any number of n slides. For encryption, randomly independent keys are generated along with another random key based on a XOR process of random keys. The XOR process between each divided image and each random key produces the encryption of n encrypted images. These encrypted images are then used to make encrypted binary phase masks. For decryption, the phase masks are placed on the paths of a Mach-Zehnder interferometer.

  4. Optical encryption in spatially-incoherent light using two LC SLMs for both information input and encryption element imaging

    NASA Astrophysics Data System (ADS)

    Bondareva, Alyona P.; Cheremkhin, Pavel A.; Evtikhiev, Nikolay N.; Krasnov, Vitaly V.; Rodin, Vladislav G.; Starikov, Sergey N.

    2014-10-01

    At present time methods of optical encryption are actively developed. The majority of existing methods of optical encryption use not only light intensity distribution, easily registered with photosensors, but also its phase distribution which require application of complex holographic schemes in conjunction with spatially coherent monochromatic illumination. This leads to complex optical schemes and low decryption quality. To eliminate these disadvantages it is possible to implement optical encryption using spatially incoherent monochromatic illumination which requires registration of light intensity distribution only. Encryption is accomplished by means of optical convolution of image of scene to be encrypted and encryption diffractive optical element (DOE) point spread function (PSF) which serves as encryption key. Encryption process is described as follows. Scene is illuminated with spatially-incoherent monochromatic light. In the absence of encryption DOE lens forms image of scene in photosensor plane. DOE serves as encryption element, its PSF - encryption key. Light passing through DOE forms convolution of object image and DOE PSF. Registered by photosensor convolution is encrypted image. Decryption was conducted numerically on computer by means of inverse filtration with regularization. Kinoforms were used as encryption DOE because they have single diffraction order. Two liquid crystal (LC) spatial light modulators (SLM) were used to implement dynamic digital information input and dynamic encryption key change. As input scene amplitude LC SLM HoloEye LC2002 with 800×600 pixels 32×32 μm2 and 256 gray levels was used. To image synthesized encryption kinoforms phase LC SLM HoloEye PLUTO VIS with 1920×1080 pixels 8×8 μm2 and 256 phase levels was used. Set of test images was successfully optically encrypted and then numerically decrypted. Encrypted images contents are hidden. Decrypted images despite quite high noise levels are positively recognizable

  5. Implementation notes on bdes(1). [data encryption implementation

    NASA Technical Reports Server (NTRS)

    Bishop, Matt

    1991-01-01

    This note describes the implementation of bdes, the file encryption program being distributed in the 4.4 release of the Berkeley Software Distribution. It implements all modes of the Data Encryption Standard program.

  6. Selective image encryption using a spatiotemporal chaotic system.

    PubMed

    Xiang, Tao; Wong, Kwok-wo; Liao, Xiaofeng

    2007-06-01

    A universal selective image encryption algorithm, in which the spatiotemporal chaotic system is utilized, is proposed to encrypt gray-level images. In order to resolve the tradeoff between security and performance, the effectiveness of selective encryption is discussed based on simulation results. The scheme is then extended to encrypt RGB color images. Security analyses for both scenarios show that the proposed schemes achieve high security and efficiency. PMID:17614669

  7. A DRM based on renewable broadcast encryption

    NASA Astrophysics Data System (ADS)

    Ramkumar, Mahalingam; Memon, Nasir

    2005-07-01

    We propose an architecture for digital rights management based on a renewable, random key pre-distribution (KPD) scheme, HARPS (hashed random preloaded subsets). The proposed architecture caters for broadcast encryption by a trusted authority (TA) and by "parent" devices (devices used by vendors who manufacture compliant devices) for periodic revocation of devices. The KPD also facilitates broadcast encryption by peer devices, which permits peers to distribute content, and efficiently control access to the content encryption secret using subscription secrets. The underlying KPD also caters for broadcast authentication and mutual authentication of any two devices, irrespective of the vendors manufacturing the device, and thus provides a comprehensive solution for securing interactions between devices taking part in a DRM system.

  8. Optimal Symmetric Ternary Quantum Encryption Schemes

    NASA Astrophysics Data System (ADS)

    Wang, Yu-qi; She, Kun; Huang, Ru-fen; Ouyang, Zhong

    2016-07-01

    In this paper, we present two definitions of the orthogonality and orthogonal rate of an encryption operator, and we provide a verification process for the former. Then, four improved ternary quantum encryption schemes are constructed. Compared with Scheme 1 (see Section 2.3), these four schemes demonstrate significant improvements in term of calculation and execution efficiency. Especially, under the premise of the orthogonal rate ɛ as secure parameter, Scheme 3 (see Section 4.1) shows the highest level of security among them. Through custom interpolation functions, the ternary secret key source, which is composed of the digits 0, 1 and 2, is constructed. Finally, we discuss the security of both the ternary encryption operator and the secret key source, and both of them show a high level of security and high performance in execution efficiency.

  9. Photonic encryption using all optical logic.

    SciTech Connect

    Blansett, Ethan L.; Schroeppel, Richard Crabtree; Tang, Jason D.; Robertson, Perry J.; Vawter, Gregory Allen; Tarman, Thomas David; Pierson, Lyndon George

    2003-12-01

    With the build-out of large transport networks utilizing optical technologies, more and more capacity is being made available. Innovations in Dense Wave Division Multiplexing (DWDM) and the elimination of optical-electrical-optical conversions have brought on advances in communication speeds as we move into 10 Gigabit Ethernet and above. Of course, there is a need to encrypt data on these optical links as the data traverses public and private network backbones. Unfortunately, as the communications infrastructure becomes increasingly optical, advances in encryption (done electronically) have failed to keep up. This project examines the use of optical logic for implementing encryption in the photonic domain to achieve the requisite encryption rates. In order to realize photonic encryption designs, technology developed for electrical logic circuits must be translated to the photonic regime. This paper examines two classes of all optical logic (SEED, gain competition) and how each discrete logic element can be interconnected and cascaded to form an optical circuit. Because there is no known software that can model these devices at a circuit level, the functionality of the SEED and gain competition devices in an optical circuit were modeled in PSpice. PSpice allows modeling of the macro characteristics of the devices in context of a logic element as opposed to device level computational modeling. By representing light intensity as voltage, 'black box' models are generated that accurately represent the intensity response and logic levels in both technologies. By modeling the behavior at the systems level, one can incorporate systems design tools and a simulation environment to aid in the overall functional design. Each black box model of the SEED or gain competition device takes certain parameters (reflectance, intensity, input response), and models the optical ripple and time delay characteristics. These 'black box' models are interconnected and cascaded in an

  10. Non Breakable Data Encryption With Classical Information?

    NASA Astrophysics Data System (ADS)

    Kish, Laszlo B.; Sethuraman, Swaminathan; Heszler, Peter

    2005-11-01

    With the Kish-Sethuraman (KS) cipher an attempt was made, by using special operators and communication, to reach absolutely secure classical communication. First the message is bounced back with additional encryption by the Receiver and then the original encryption is removed and the message is resent by the Sender. The mechanical analogy of this operation is using two padlocks; one by the Sender and one by the Receiver. Klappenecker has pointed out that finding an efficient software realization of the operators is equivalent of proving the P ≠ NP problem. Various open problems are discussed.

  11. A new lossless digital image encryption scheme

    NASA Astrophysics Data System (ADS)

    Pareek, Narendra K.; Patidar, Vinod; Sud, Krishan K.

    2011-12-01

    We propose a new lossless digital image encryption scheme based on the permutation and substitution architecture. Initially, original image is divided into squared sub-images and then three layers of pixels corresponding to additive primary colours (RGB) of each sub-image are separated. Each layer of pixels of squared sub-images are scrambled by three different ways in the permutation process whereas a simple arithmetic, mainly sorting and differencing, is performed on each layer of pixels to achieve the substitution. The results of several experiments show that the proposed image cipher provides an efficient way for image encryption with high decryption rate.

  12. Identity-Based Verifiably Encrypted Signatures without Random Oracles

    NASA Astrophysics Data System (ADS)

    Zhang, Lei; Wu, Qianhong; Qin, Bo

    Fair exchange protocol plays an important role in electronic commerce in the case of exchanging digital contracts. Verifiably encrypted signatures provide an optimistic solution to these scenarios with an off-line trusted third party. In this paper, we propose an identity-based verifiably encrypted signature scheme. The scheme is non-interactive to generate verifiably encrypted signatures and the resulting encrypted signature consists of only four group elements. Based on the computational Diffie-Hellman assumption, our scheme is proven secure without using random oracles. To the best of our knowledge, this is the first identity-based verifiably encrypted signature scheme provably secure in the standard model.

  13. Double image encryption based on iterative fractional Fourier transform

    NASA Astrophysics Data System (ADS)

    Liu, Zhengjun; Liu, Shutian

    2007-07-01

    We present an image encryption algorithm to simultaneously encrypt two images into a single one as the amplitudes of fractional Fourier transform with different orders. From the encrypted image we can get two original images independently by fractional Fourier transforms with two different fractional orders. This algorithm can be independent of additional random phases as the encryption/decryption keys. Numerical results are given to analyze the capability of this proposed method. A possible extension to multi-image encryption with a fractional order multiplexing scheme has also been given.

  14. Public-key encryption with chaos

    NASA Astrophysics Data System (ADS)

    Kocarev, Ljupco; Sterjev, Marjan; Fekete, Attila; Vattay, Gabor

    2004-12-01

    We propose public-key encryption algorithms based on chaotic maps, which are generalization of well-known and commercially used algorithms: Rivest-Shamir-Adleman (RSA), ElGamal, and Rabin. For the case of generalized RSA algorithm we discuss in detail its software implementation and properties. We show that our algorithm is as secure as RSA algorithm.

  15. Public-key encryption with chaos.

    PubMed

    Kocarev, Ljupco; Sterjev, Marjan; Fekete, Attila; Vattay, Gabor

    2004-12-01

    We propose public-key encryption algorithms based on chaotic maps, which are generalization of well-known and commercially used algorithms: Rivest-Shamir-Adleman (RSA), ElGamal, and Rabin. For the case of generalized RSA algorithm we discuss in detail its software implementation and properties. We show that our algorithm is as secure as RSA algorithm. PMID:15568922

  16. Encryption and the loss of patient data.

    PubMed

    Miller, Amalia R; Tucker, Catherine E

    2011-01-01

    Fast-paced IT advances have made it increasingly possible and useful for firms to collect data on their customers on an unprecedented scale. One downside of this is that firms can experience negative publicity and financial damage if their data are breached. This is particularly the case in the medical sector, where we find empirical evidence that increased digitization of patient data is associated with more data breaches. The encryption of customer data is often presented as a potential solution, because encryption acts as a disincentive for potential malicious hackers, and can minimize the risk of breached data being put to malicious use. However, encryption both requires careful data management policies to be successful and does not ward off the insider threat. Indeed, we find no empirical evidence of a decrease in publicized instances of data loss associated with the use of encryption. Instead, there are actually increases in the cases of publicized data loss due to internal fraud or loss of computer equipment. PMID:21774164

  17. 47 CFR 90.553 - Encryption.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... incorporation by reference in accordance with 5 U.S.C. 552(a) and 1 CFR part 51. The standard can also be... approves this incorporation by reference in accordance with 5 U.S.C. 552(a) and 1 CFR part 51. Copies of... (AES) specified in ANSI/TIA-102.AAAD-A: Project 25 Digital Land Mobile Radio-Block Encryption...

  18. Attribute-based proxy re-encryption with keyword search.

    PubMed

    Shi, Yanfeng; Liu, Jiqiang; Han, Zhen; Zheng, Qingji; Zhang, Rui; Qiu, Shuo

    2014-01-01

    Keyword search on encrypted data allows one to issue the search token and conduct search operations on encrypted data while still preserving keyword privacy. In the present paper, we consider the keyword search problem further and introduce a novel notion called attribute-based proxy re-encryption with keyword search (ABRKS), which introduces a promising feature: In addition to supporting keyword search on encrypted data, it enables data owners to delegate the keyword search capability to some other data users complying with the specific access control policy. To be specific, ABRKS allows (i) the data owner to outsource his encrypted data to the cloud and then ask the cloud to conduct keyword search on outsourced encrypted data with the given search token, and (ii) the data owner to delegate other data users keyword search capability in the fine-grained access control manner through allowing the cloud to re-encrypted stored encrypted data with a re-encrypted data (embedding with some form of access control policy). We formalize the syntax and security definitions for ABRKS, and propose two concrete constructions for ABRKS: key-policy ABRKS and ciphertext-policy ABRKS. In the nutshell, our constructions can be treated as the integration of technologies in the fields of attribute-based cryptography and proxy re-encryption cryptography. PMID:25549257

  19. Attribute-Based Proxy Re-Encryption with Keyword Search

    PubMed Central

    Shi, Yanfeng; Liu, Jiqiang; Han, Zhen; Zheng, Qingji; Zhang, Rui; Qiu, Shuo

    2014-01-01

    Keyword search on encrypted data allows one to issue the search token and conduct search operations on encrypted data while still preserving keyword privacy. In the present paper, we consider the keyword search problem further and introduce a novel notion called attribute-based proxy re-encryption with keyword search (), which introduces a promising feature: In addition to supporting keyword search on encrypted data, it enables data owners to delegate the keyword search capability to some other data users complying with the specific access control policy. To be specific, allows (i) the data owner to outsource his encrypted data to the cloud and then ask the cloud to conduct keyword search on outsourced encrypted data with the given search token, and (ii) the data owner to delegate other data users keyword search capability in the fine-grained access control manner through allowing the cloud to re-encrypted stored encrypted data with a re-encrypted data (embedding with some form of access control policy). We formalize the syntax and security definitions for , and propose two concrete constructions for : key-policy and ciphertext-policy . In the nutshell, our constructions can be treated as the integration of technologies in the fields of attribute-based cryptography and proxy re-encryption cryptography. PMID:25549257

  20. NES++: number system for encryption based privacy preserving speaker verification

    NASA Astrophysics Data System (ADS)

    Xu, Lei; Feng, Tao; Zhao, Xi; Shi, Weidong

    2014-05-01

    As speech based operation becomes a main hand-free interaction solution between human and mobile devices (i.e., smartphones, Google Glass), privacy preserving speaker verification receives much attention nowadays. Privacy preserving speaker verification can be achieved through many different ways, such as fuzzy vault and encryption. Encryption based solutions are promising as cryptography is based on solid mathematic foundations and the security properties can be easily analyzed in a well established framework. Most current asymmetric encryption schemes work on finite algebraic structures, such as finite group and finite fields. However, the encryption scheme for privacy preserving speaker verification must handle floating point numbers. This gap must be filled to make the overall scheme practical. In this paper, we propose a number system that meets the requirements of both speaker verification and the encryption scheme used in the process. It also supports addition homomorphic property of Pailliers encryption, which is crucial for privacy preserving speaker verification. As asymmetric encryption is expensive, we propose a method of packing several numbers into one plain-text and the computation overhead is greatly reduced. To evaluate the performance of this method, we implement Pailliers encryption scheme over proposed number system and the packing technique. Our findings show that the proposed solution can fulfill the gap between speaker verification and encryption scheme very well, and the packing technique improves the overall performance. Furthermore, our solution is a building block of encryption based privacy preserving speaker verification, the privacy protection and accuracy rate are not affected.

  1. Image encryption using P-Fibonacci transform and decomposition

    NASA Astrophysics Data System (ADS)

    Zhou, Yicong; Panetta, Karen; Agaian, Sos; Chen, C. L. Philip

    2012-03-01

    Image encryption is an effective method to protect images or videos by transferring them into unrecognizable formats for different security purposes. To improve the security level of bit-plane decomposition based encryption approaches, this paper introduces a new image encryption algorithm by using a combination of parametric bit-plane decomposition along with bit-plane shuffling and resizing, pixel scrambling and data mapping. The algorithm utilizes the Fibonacci P-code for image bit-plane decomposition and the 2D P-Fibonacci transform for image encryption because they are parameter dependent. Any new or existing method can be used for shuffling the order of the bit-planes. Simulation analysis and comparisons are provided to demonstrate the algorithm's performance for image encryption. Security analysis shows the algorithm's ability against several common attacks. The algorithm can be used to encrypt images, biometrics and videos.

  2. An OFDM-Based Speech Encryption System without Residual Intelligibility

    NASA Astrophysics Data System (ADS)

    Tseng, Der-Chang; Chiu, Jung-Hui

    Since an FFT-based speech encryption system retains a considerable residual intelligibility, such as talk spurts and the original intonation in the encrypted speech, this makes it easy for eavesdroppers to deduce the information contents from the encrypted speech. In this letter, we propose a new technique based on the combination of an orthogonal frequency division multiplexing (OFDM) scheme and an appropriate QAM mapping method to remove the residual intelligibility from the encrypted speech by permuting several frequency components. In addition, the proposed OFDM-based speech encryption system needs only two FFT operations instead of the four required by the FFT-based speech encryption system. Simulation results are presented to show the effectiveness of this proposed technique.

  3. A high performance hardware implementation image encryption with AES algorithm

    NASA Astrophysics Data System (ADS)

    Farmani, Ali; Jafari, Mohamad; Miremadi, Seyed Sohrab

    2011-06-01

    This paper describes implementation of a high-speed encryption algorithm with high throughput for encrypting the image. Therefore, we select a highly secured symmetric key encryption algorithm AES(Advanced Encryption Standard), in order to increase the speed and throughput using pipeline technique in four stages, control unit based on logic gates, optimal design of multiplier blocks in mixcolumn phase and simultaneous production keys and rounds. Such procedure makes AES suitable for fast image encryption. Implementation of a 128-bit AES on FPGA of Altra company has been done and the results are as follow: throughput, 6 Gbps in 471MHz. The time of encrypting in tested image with 32*32 size is 1.15ms.

  4. High Capacity Reversible Data Hiding in Encrypted Images by Patch-Level Sparse Representation.

    PubMed

    Cao, Xiaochun; Du, Ling; Wei, Xingxing; Meng, Dan; Guo, Xiaojie

    2016-05-01

    Reversible data hiding in encrypted images has attracted considerable attention from the communities of privacy security and protection. The success of the previous methods in this area has shown that a superior performance can be achieved by exploiting the redundancy within the image. Specifically, because the pixels in the local structures (like patches or regions) have a strong similarity, they can be heavily compressed, thus resulting in a large hiding room. In this paper, to better explore the correlation between neighbor pixels, we propose to consider the patch-level sparse representation when hiding the secret data. The widely used sparse coding technique has demonstrated that a patch can be linearly represented by some atoms in an over-complete dictionary. As the sparse coding is an approximation solution, the leading residual errors are encoded and self-embedded within the cover image. Furthermore, the learned dictionary is also embedded into the encrypted image. Thanks to the powerful representation of sparse coding, a large vacated room can be achieved, and thus the data hider can embed more secret messages in the encrypted image. Extensive experiments demonstrate that the proposed method significantly outperforms the state-of-the-art methods in terms of the embedding rate and the image quality. PMID:25955861

  5. Steganography and encrypting based on immunochemical systems.

    PubMed

    Kim, Kyung-Woo; Bocharova, Vera; Halámek, Jan; Oh, Min-Kyu; Katz, Evgeny

    2011-05-01

    Steganography and encrypting were demonstrated with immuno-specific systems. IgG-proteins were used as invisible ink developed with complementary antibodies labeled with enzymes producing color spots. The information security was achieved by mixing the target protein-antigens used for the text encoding with masking proteins of similar composition but having different bioaffinity. Two different texts were simultaneously encoded by using two different encoding proteins in a mixture. Various encrypting techniques were exemplified with the immuno-systems used for the steganography. Future use of the developed approach for information protection and watermark-technology was proposed. Scaling down the encoded text to a micro-size is feasible with the use of nanotechnology. PMID:21449025

  6. Current status of link access control and encryption system

    SciTech Connect

    Springer, E.

    1984-01-01

    The purpose of this project is to develop necessary technologies for the secure protection of data communication networks. Data encryption equipment, using the federal government's Data Encryption Standard (DES) algorithm, was designed and developed. This equipment is the Link Access Control and Encryption (Link ACE) system. It protects unclassified sensitive data transmissions over unprotected lines between central computers and remote terminals. Link ACE units have been installed and are operational in the Department of Energy's Central Personnel Clearance Index (CPCI) system.

  7. Three-dimensional photon counting double-random-phase encryption.

    PubMed

    Cho, Myungjin; Javidi, Bahram

    2013-09-01

    In this Letter, we present a three-dimensional (3D) photon counting double-random-phase encryption (DRPE) technique using passive integral imaging. A 3D photon counting DRPE can encrypt a 3D scene and provides more security and authentications due to photon counting Poisson nonlinear transformation on the encrypted image. In addition, 3D imaging allows verification of the 3D object at different depths. Preliminary results and performance evaluation have been presented. PMID:23988912

  8. New Security Results on Encrypted Key Exchange

    SciTech Connect

    Bresson, Emmanuel; Chevassut, Olivier; Pointcheval, David

    2003-12-15

    Schemes for encrypted key exchange are designed to provide two entities communicating over a public network, and sharing a (short) password only, with a session key to be used to achieve data integrity and/or message confidentiality. An example of a very efficient and ''elegant'' scheme for encrypted key exchange considered for standardization by the IEEE P1363 Standard working group is AuthA. This scheme was conjectured secure when the symmetric-encryption primitive is instantiated via either a cipher that closely behaves like an ''ideal cipher,'' or a mask generation function that is the product of the message with a hash of the password. While the security of this scheme in the former case has been recently proven, the latter case was still an open problem. For the first time we prove in this paper that this scheme is secure under the assumptions that the hash function closely behaves like a random oracle and that the computational Diffie-Hellman problem is difficult. Furthermore, since Denial-of-Service (DoS) attacks have become a common threat we enhance AuthA with a mechanism to protect against them.

  9. Nanocrystalline cellulose for covert optical encryption

    NASA Astrophysics Data System (ADS)

    Zhang, Yu Ping; Chodavarapu, Vamsy P.; Kirk, Andrew G.; Andrews, Mark P.

    2012-02-01

    Nanocrystalline cellulose solid films derived from spruce pulp exhibit iridescence when cast from chiral nematic aqueous phase suspensions of the nanocrystals. Iridescence is a color travel phenomenon that might have potential for overt encryption as an anti-counterfeiting measure. The iridescent phase also offers an intrinsic level of covert encryption by virtue of the fact that films of NCC reflect left-circularly polarized light. Addition of TINOPAL, an optical brightening agent (OBA), adds a third level of (covert) encryption potential since the chromophore exhibits strong fluorescence when excited at ultra-violet wavelengths. The overall result is a selectively polarizing fluorescent iridescent film. We study the impact of additions of OBA on NCC iridescence, optical activity, and physical structure variation with polarized optical microscopy, circular dichroism spectropolarimetry and zeta potential analysis. Increasing OBA additions increase the chiral nematic pitch of NCC films, and this in turn alters chiral nematic domain structure in the solid film. Under low concentration conditions defined by our experiments, OBA yields intense UV fluorescence, without compromising the visible light iridescent properties of the film. The potential security offered by NCC and its optical responses can be authenticated using a UV light source such as is commonly used for banknote verification, a circular polarizer in conjunction with an iridescent feature which can be verified by the eye or by chiral spectrometry.

  10. Broadcast encryption: paving the road to practical content protection systems

    NASA Astrophysics Data System (ADS)

    Deen, G.; Ponceleon, D.; Leake, Donald, Jr.

    2009-02-01

    Broadcast encryption is a well established alternative to public key encryption for use in content protection systems. It offers significant performance benefits, as well as useful features such a one-to-many delivery, dynamic membership in the authorized receivers group, and provides anonymous access to content, permitting content protection systems to preserve privacy for consumers. Broadcast encryption has been successfully deployed to users for protection of commercial content on digital media such as flash memory devices and optical media for both standard-definition and high-definition content. In this paper, we present the Advanced Secure Content Cluster Technology which applies broadcast encryption to content protection for home media networks

  11. 15 CFR Supplement No. 5 to Part 742 - Encryption Registration

    Code of Federal Regulations, 2011 CFR

    2011-01-01

    ... platforms (d) Multimedia over IP (e) Trusted computing (f) Network infrastructure (g) Link layer encryption (h) Smartcards or other identity management (i) Computer or network forensics (j) Software...

  12. Multiply-agile encryption in high speed communication networks

    SciTech Connect

    Pierson, L.G.; Witzke, E.L.

    1997-05-01

    Different applications have different security requirements for data privacy, data integrity, and authentication. Encryption is one technique that addresses these requirements. Encryption hardware, designed for use in high-speed communications networks, can satisfy a wide variety of security requirements if that hardware is key-agile, robustness-agile and algorithm-agile. Hence, multiply-agile encryption provides enhanced solutions to the secrecy, interoperability and quality of service issues in high-speed networks. This paper defines these three types of agile encryption. Next, implementation issues are discussed. While single-algorithm, key-agile encryptors exist, robustness-agile and algorithm-agile encryptors are still research topics.

  13. Feasibility of Radon projection acquisition for compressive imaging in MMW region based new video rate 16×16 GDD FPA camera

    NASA Astrophysics Data System (ADS)

    Levanon, Assaf; Konstantinovsky, Michael; Kopeika, Natan S.; Yitzhaky, Yitzhak; Stern, A.; Turak, Svetlana; Abramovich, Amir

    2015-05-01

    In this article we present preliminary results for the combination of two interesting fields in the last few years: 1) Compressed imaging (CI), which is a joint sensing and compressing process, that attempts to exploit the large redundancy in typical images in order to capture fewer samples than usual. 2) Millimeter Waves (MMW) imaging. MMW based imaging systems are required for a large variety of applications in many growing fields such as medical treatments, homeland security, concealed weapon detection, and space technology. Moreover, the possibility to create a reliable imaging in low visibility conditions such as heavy cloud, smoke, fog and sandstorms in the MMW region, generate high interest from military groups in order to be ready for new combat. The lack of inexpensive room temperature imaging sensors makes it difficult to provide a suitable MMW system for many of the above applications. A system based on Glow Discharge Detector (GDD) Focal Plane Arrays (FPA) can be very efficient in real time imaging with significant results. The GDD is located in free space and it can detect MMW radiation almost isotropically. In this article, we present a new approach of reconstruction MMW imaging by rotation scanning of the target. The Collection process here, based on Radon projections allows implementation of the compressive sensing principles into the MMW region. Feasibility of concept was obtained as radon line imaging results. MMW imaging results with our resent sensor are also presented for the first time. The multiplexing frame rate of 16×16 GDD FPA permits real time video rate imaging of 30 frames per second and comprehensive 3D MMW imaging. It uses commercial GDD lamps with 3mm diameter, Ne indicator lamps as pixel detectors. Combination of these two fields should make significant improvement in MMW region imaging research, and new various of possibilities in compressing sensing technique.

  14. P-code enhanced method for processing encrypted GPS signals without knowledge of the encryption code

    NASA Technical Reports Server (NTRS)

    Meehan, Thomas K. (Inventor); Thomas, Jr., Jess Brooks (Inventor); Young, Lawrence E. (Inventor)

    2000-01-01

    In the preferred embodiment, an encrypted GPS signal is down-converted from RF to baseband to generate two quadrature components for each RF signal (L1 and L2). Separately and independently for each RF signal and each quadrature component, the four down-converted signals are counter-rotated with a respective model phase, correlated with a respective model P code, and then successively summed and dumped over presum intervals substantially coincident with chips of the respective encryption code. Without knowledge of the encryption-code signs, the effect of encryption-code sign flips is then substantially reduced by selected combinations of the resulting presums between associated quadrature components for each RF signal, separately and independently for the L1 and L2 signals. The resulting combined presums are then summed and dumped over longer intervals and further processed to extract amplitude, phase and delay for each RF signal. Precision of the resulting phase and delay values is approximately four times better than that obtained from straight cross-correlation of L1 and L2. This improved method provides the following options: separate and independent tracking of the L1-Y and L2-Y channels; separate and independent measurement of amplitude, phase and delay L1-Y channel; and removal of the half-cycle ambiguity in L1-Y and L2-Y carrier phase.

  15. Bit-oriented quantum public-key encryption based on quantum perfect encryption

    NASA Astrophysics Data System (ADS)

    Wu, Chenmiao; Yang, Li

    2016-05-01

    A bit-oriented quantum public-key encryption scheme is presented. We use Boolean functions as private-key and randomly changed pairs of quantum state and classical string as public-keys. Following the concept of quantum perfect encryption, we prepare the public-key with Hadamard transformation and Pauli transformation. The quantum part of public-keys is various with different classical strings. In contrast to the typical classical public-key scheme, one private-key in our scheme corresponds to an exponential number of public-keys. We investigate attack to the private-key and prove that the public-key is a totally mixed state. So the adversary cannot acquire any information about private-key from measurement of the public-key. Then, the attack to encryption is analyzed. Since the trace distance between two different ciphertexts is zero, the adversary cannot distinguish between the two ciphertext states and also obtains nothing about plaintext and private-key. Thus, we have the conclusion that the proposed scheme is information-theoretically secure under an attack of the private-key and encryption.

  16. Bit-oriented quantum public-key encryption based on quantum perfect encryption

    NASA Astrophysics Data System (ADS)

    Wu, Chenmiao; Yang, Li

    2016-08-01

    A bit-oriented quantum public-key encryption scheme is presented. We use Boolean functions as private-key and randomly changed pairs of quantum state and classical string as public-keys. Following the concept of quantum perfect encryption, we prepare the public-key with Hadamard transformation and Pauli transformation. The quantum part of public-keys is various with different classical strings. In contrast to the typical classical public-key scheme, one private-key in our scheme corresponds to an exponential number of public-keys. We investigate attack to the private-key and prove that the public-key is a totally mixed state. So the adversary cannot acquire any information about private-key from measurement of the public-key. Then, the attack to encryption is analyzed. Since the trace distance between two different ciphertexts is zero, the adversary cannot distinguish between the two ciphertext states and also obtains nothing about plaintext and private-key. Thus, we have the conclusion that the proposed scheme is information-theoretically secure under an attack of the private-key and encryption.

  17. Phase encryption of biometrics in diffractive optical elements.

    PubMed

    Johnson, E G; Brasher, J D

    1996-08-15

    A new technique for the optical encoding of images is presented. The method of generalized projections is used to design diffractive optical elements for the phase encryption of biometrics for security applications. The encryption algorithm converges rapidly, and the decryption is seen to be secure and tolerant to additive noise. PMID:19876322

  18. The Escrowed Encryption Standard: The Clipper Chip and Civil Liberties.

    ERIC Educational Resources Information Center

    Diamond, Ted

    1994-01-01

    The federal Escrowed Encryption Standard (EES) has been opposed by civil liberties advocates and the computer industry. The author argues that the standard does not threaten privacy as long as its use remains voluntary, alternative forms of encryption are allowed, and the power of government to intercept transmission is kept in check. (20…

  19. Phase encryption of biometrics in diffractive optical elements

    NASA Astrophysics Data System (ADS)

    Johnson, E. G.; Brasher, J. D.

    1996-08-01

    A new technique for the optical encoding of images is presented. The method of generalized projections is used to design diffractive optical elements for the phase encryption of biometrics for security applications. The encryption algorithm converges rapidly, and the decryption is seen to be secure and tolerant to additive noise.

  20. Optical image encryption based on multifractional Fourier transforms.

    PubMed

    Zhu, B; Liu, S; Ran, Q

    2000-08-15

    We propose a new image encryption algorithm based on a generalized fractional Fourier transform, to which we refer as a multifractional Fourier transform. We encrypt the input image simply by performing the multifractional Fourier transform with two keys. Numerical simulation results are given to verify the algorithm, and an optical implementation setup is also suggested. PMID:18066153

  1. An Inexpensive Device for Teaching Public Key Encryption

    ERIC Educational Resources Information Center

    Pendegraft, Norman

    2009-01-01

    An inexpensive device to assist in teaching the main ideas of Public Key encryption and its use in class to illustrate the operation of public key encryption is described. It illustrates that there are two keys, and is particularly useful for illustrating that privacy is achieved by using the public key. Initial data from in class use seem to…

  2. Private genome analysis through homomorphic encryption

    PubMed Central

    2015-01-01

    Background The rapid development of genome sequencing technology allows researchers to access large genome datasets. However, outsourcing the data processing o the cloud poses high risks for personal privacy. The aim of this paper is to give a practical solution for this problem using homomorphic encryption. In our approach, all the computations can be performed in an untrusted cloud without requiring the decryption key or any interaction with the data owner, which preserves the privacy of genome data. Methods We present evaluation algorithms for secure computation of the minor allele frequencies and χ2 statistic in a genome-wide association studies setting. We also describe how to privately compute the Hamming distance and approximate Edit distance between encrypted DNA sequences. Finally, we compare performance details of using two practical homomorphic encryption schemes - the BGV scheme by Gentry, Halevi and Smart and the YASHE scheme by Bos, Lauter, Loftus and Naehrig. Results The approach with the YASHE scheme analyzes data from 400 people within about 2 seconds and picks a variant associated with disease from 311 spots. For another task, using the BGV scheme, it took about 65 seconds to securely compute the approximate Edit distance for DNA sequences of size 5K and figure out the differences between them. Conclusions The performance numbers for BGV are better than YASHE when homomorphically evaluating deep circuits (like the Hamming distance algorithm or approximate Edit distance algorithm). On the other hand, it is more efficient to use the YASHE scheme for a low-degree computation, such as minor allele frequencies or χ2 test statistic in a case-control study. PMID:26733152

  3. A complete classification of quantum public-key encryption protocols

    NASA Astrophysics Data System (ADS)

    Wu, Chenmiao; Yang, Li

    2015-10-01

    We present a classification of quantum public-key encryption protocols. There are six elements in quantum public-key encryption: plaintext, ciphertext, public-key, private-key, encryption algorithm and decryption algorithm. According to the property of each element which is either quantum or classical, the quantum public-key encryption protocols can be divided into 64 kinds. Among 64 kinds of protocols, 8 kinds have already been constructed, 52 kinds can be proved to be impossible to construct and the remaining 4 kinds have not been presented effectively yet. This indicates that the research on quantum public-key encryption protocol should be focus on the existed kinds and the unproposed kinds.

  4. A Contents Encryption Mechanism Using Reused Key in IPTV

    NASA Astrophysics Data System (ADS)

    Jeong, Yoon-Su; Kim, Yong-Tae; Cho, Young-Bok; Lee, Ki-Jeong; Park, Gil-Cheol; Lee, Sang-Ho

    Recently IPTV is being spotlighted as a new stream service to stably provide video, audio and control signals to subscribers through the application of IP protocol. However, the IPTV system is facing more security threats than the traditional TV. This study proposes a multicasting encryption mechanism for secure transmission of the contents of IPTV by which the content provider encrypts their contents and send the encrypted contents and the key used for encryption of the contents to the user. In order to reduce the time and cost of Head-End, the proposed mechanism encrypts the media contents at the Head-End, embeds the code of the IPTV terminal used at the Head-End in the media contents for user tracking, and performs desynchronization for protection of the media contents from various attacks.

  5. Host-to-host encryption using commercial networking products

    SciTech Connect

    Not Available

    1980-10-06

    The report considers three commercial devices in a setting of host-to-host encryption. The basic questions considered are: (1) can this local networking product be modified to provide host-to-host encryption; (2) how could host-to-host encryption be achieved without modifying this local networking product. The HYPERchannel adapter from Network Systems Corporation, the Net/One from Ungermann-Bass, and the Computrol's Megalink product are each be examined. Section 2 discusses the general issues of host-to-host encryption. A generic host-to-host cryptosystem is developed, to be used later in the analysis of the specific products. Section 3 presents in turn the HYPERchannel, Net/One, and Megalink, considering the possibilities of host-to-host encryption with and without product modification. The report's conclusions are summarized in Section 4.

  6. Three-dimensional optical encryption based on ptychography

    NASA Astrophysics Data System (ADS)

    Zhang, Jun; Li, Tuo; Wang, Yali; Qiao, Liang; Yang, Xiubo; Shi, Yishi

    2015-10-01

    We propose a novel optical encryption system for three-dimension imaging combined with three-dimension Ptychography. Employing the proposed cryptosystem, a 3D object can be encrypted and decrypted successfully. Compared with the conventional three-dimensional cryptosystem, not only encrypting the pure amplitude 3D object is available, but also the encryption of complex amplitude 3D object is achievable. Considering that the probes overlapping with each other is the crucial factor in ptychography, their complex-amplitude functions can serve as a kind of secret keys that lead to the enlarged key space and the enhanced system security. Varies of simulation results demonstrate that the feasibility and robust of the cryptosystem. Furthermore, the proposed system could also be used for other potential applications, such as three-dimensional information hiding and multiple images encryption.

  7. Color image encryption based on joint fractional Fourier transform correlator

    NASA Astrophysics Data System (ADS)

    Lu, Ding; Jin, Weimin

    2011-06-01

    In this paper, an optical color image encryption/decryption technology based on joint fractional Fourier transform correlator and double random phase encoding (DRPE) is developed. In this method, the joint fractional power spectrum of the image to be encrypted and the key codes is recorded as the encrypted data. Different from the case with classical DRPE, the same key code was used both in the encryption and decryption. The security of the system is enhanced because of the fractional order as a new added key. This method takes full advantage of the parallel processing features of the optical system, and could optically realize single-channel color image encryption. The experimental results indicate that the new method is feasible.

  8. A Cryptosystem for Encryption and Decryption of Long Confidential Messages

    NASA Astrophysics Data System (ADS)

    Giri, Debasis; Barua, Prithayan; Srivastava, P. D.; Jana, Biswapati

    In this paper, we propose a cryptosystem which can encrypt and decrypt long (text) messages in efficient manner. The proposed cryptosystem is a combination of symmetric-key and asymmetric-key cryptography, where asymmetric-key cryptography is used to transmit the secret key to an intended receiver and the sender/receiver encrypts/decrypts messages using that secret key. In 2002, Hwang et al. proposed a scheme for encrypting long messages. The main drawback of their scheme is that it requires more computational overhead. Our proposed scheme is more efficient from the computational point of view compared to that of their scheme. Our scheme is a block cipher, long messages are broken into fixed length plaintext blocks for encryption. It supports parallel computation, since encryption/decryption of all the blocks of plaintext/plaintext are independent and thus can be carried out simultaneously. In addition, our scheme retains the same security level as their scheme.

  9. Secure Obfuscation for Encrypted Group Signatures

    PubMed Central

    Fan, Hongfei; Liu, Qin

    2015-01-01

    In recent years, group signature techniques are widely used in constructing privacy-preserving security schemes for various information systems. However, conventional techniques keep the schemes secure only in normal black-box attack contexts. In other words, these schemes suppose that (the implementation of) the group signature generation algorithm is running in a platform that is perfectly protected from various intrusions and attacks. As a complementary to existing studies, how to generate group signatures securely in a more austere security context, such as a white-box attack context, is studied in this paper. We use obfuscation as an approach to acquire a higher level of security. Concretely, we introduce a special group signature functionality-an encrypted group signature, and then provide an obfuscator for the proposed functionality. A series of new security notions for both the functionality and its obfuscator has been introduced. The most important one is the average-case secure virtual black-box property w.r.t. dependent oracles and restricted dependent oracles which captures the requirement of protecting the output of the proposed obfuscator against collision attacks from group members. The security notions fit for many other specialized obfuscators, such as obfuscators for identity-based signatures, threshold signatures and key-insulated signatures. Finally, the correctness and security of the proposed obfuscator have been proven. Thereby, the obfuscated encrypted group signature functionality can be applied to variants of privacy-preserving security schemes and enhance the security level of these schemes. PMID:26167686

  10. Symmetric weak ternary quantum homomorphic encryption schemes

    NASA Astrophysics Data System (ADS)

    Wang, Yuqi; She, Kun; Luo, Qingbin; Yang, Fan; Zhao, Chao

    2016-03-01

    Based on a ternary quantum logic circuit, four symmetric weak ternary quantum homomorphic encryption (QHE) schemes were proposed. First, for a one-qutrit rotation gate, a QHE scheme was constructed. Second, in view of the synthesis of a general 3 × 3 unitary transformation, another one-qutrit QHE scheme was proposed. Third, according to the one-qutrit scheme, the two-qutrit QHE scheme about generalized controlled X (GCX(m,n)) gate was constructed and further generalized to the n-qutrit unitary matrix case. Finally, the security of these schemes was analyzed in two respects. It can be concluded that the attacker can correctly guess the encryption key with a maximum probability pk = 1/33n, thus it can better protect the privacy of users’ data. Moreover, these schemes can be well integrated into the future quantum remote server architecture, and thus the computational security of the users’ private quantum information can be well protected in a distributed computing environment.

  11. Perceptual security of encrypted images based on wavelet scaling analysis

    NASA Astrophysics Data System (ADS)

    Vargas-Olmos, C.; Murguía, J. S.; Ramírez-Torres, M. T.; Mejía Carlos, M.; Rosu, H. C.; González-Aguilar, H.

    2016-08-01

    The scaling behavior of the pixel fluctuations of encrypted images is evaluated by using the detrended fluctuation analysis based on wavelets, a modern technique that has been successfully used recently for a wide range of natural phenomena and technological processes. As encryption algorithms, we use the Advanced Encryption System (AES) in RBT mode and two versions of a cryptosystem based on cellular automata, with the encryption process applied both fully and partially by selecting different bitplanes. In all cases, the results show that the encrypted images in which no understandable information can be visually appreciated and whose pixels look totally random present a persistent scaling behavior with the scaling exponent α close to 0.5, implying no correlation between pixels when the DFA with wavelets is applied. This suggests that the scaling exponents of the encrypted images can be used as a perceptual security criterion in the sense that when their values are close to 0.5 (the white noise value) the encrypted images are more secure also from the perceptual point of view.

  12. Key management for large scale end-to-end encryption

    SciTech Connect

    Witzke, E.L.

    1994-07-01

    Symmetric end-to-end encryption requires separate keys for each pair of communicating confidants. This is a problem of Order N{sup 2}. Other factors, such as multiple sessions per pair of confidants and multiple encryption points in the ISO Reference Model complicate key management by linear factors. Public-key encryption can reduce the number of keys managed to a linear problem which is good for scaleability of key management, but comes with complicating issues and performance penalties. Authenticity is the primary ingredient of key management. If each potential pair of communicating confidants can authenticate data from each other, then any number of public encryption keys of any type can be communicated with requisite integrity. These public encryption keys can be used with the corresponding private keys to exchange symmetric cryptovariables for high data rate privacy protection. The Digital Signature Standard (DSS), which has been adopted by the United States Government, has both public and private components, similar to a public-key cryptosystem. The Digital Signature Algorithm of the DSS is intended for authenticity but not for secrecy. In this paper, the authors will show how the use of the Digital Signature Algorithm combined with both symmetric and asymmetric (public-key) encryption techniques can provide a practical solution to key management scaleability problems, by reducing the key management complexity to a problem of order N, without sacrificing the encryption speed necessary to operate in high performance networks.

  13. Encryption of QR code and grayscale image in interference-based scheme with high quality retrieval and silhouette problem removal

    NASA Astrophysics Data System (ADS)

    Qin, Yi; Wang, Hongjuan; Wang, Zhipeng; Gong, Qiong; Wang, Danchen

    2016-09-01

    In optical interference-based encryption (IBE) scheme, the currently available methods have to employ the iterative algorithms in order to encrypt two images and retrieve cross-talk free decrypted images. In this paper, we shall show that this goal can be achieved via an analytical process if one of the two images is QR code. For decryption, the QR code is decrypted in the conventional architecture and the decryption has a noisy appearance. Nevertheless, the robustness of QR code against noise enables the accurate acquisition of its content from the noisy retrieval, as a result of which the primary QR code can be exactly regenerated. Thereafter, a novel optical architecture is proposed to recover the grayscale image by aid of the QR code. In addition, the proposal has totally eliminated the silhouette problem existing in the previous IBE schemes, and its effectiveness and feasibility have been demonstrated by numerical simulations.

  14. Quantum Image Encryption Algorithm Based on Quantum Image XOR Operations

    NASA Astrophysics Data System (ADS)

    Gong, Li-Hua; He, Xiang-Tao; Cheng, Shan; Hua, Tian-Xiang; Zhou, Nan-Run

    2016-03-01

    A novel encryption algorithm for quantum images based on quantum image XOR operations is designed. The quantum image XOR operations are designed by using the hyper-chaotic sequences generated with the Chen's hyper-chaotic system to control the control-NOT operation, which is used to encode gray-level information. The initial conditions of the Chen's hyper-chaotic system are the keys, which guarantee the security of the proposed quantum image encryption algorithm. Numerical simulations and theoretical analyses demonstrate that the proposed quantum image encryption algorithm has larger key space, higher key sensitivity, stronger resistance of statistical analysis and lower computational complexity than its classical counterparts.

  15. SSEL1.0. Sandia Scalable Encryption Software

    SciTech Connect

    Tarman, T.D.

    1996-08-29

    Sandia Scalable Encryption Library (SSEL) Version 1.0 is a library of functions that implement Sandia`s scalable encryption algorithm. This algorithm is used to encrypt Asynchronous Transfer Mode (ATM) data traffic, and is capable of operating on an arbitrary number of bits at a time (which permits scaling via parallel implementations), while being interoperable with differently scaled versions of this algorithm. The routines in this library implement 8 bit and 32 bit versions of a non-linear mixer which is compatible with Sandia`s hardware-based ATM encryptor.

  16. A lossless encryption method for medical images using edge maps.

    PubMed

    Zhou, Yicong; Panetta, Karen; Agaian, Sos

    2009-01-01

    Image encryption is an effective approach for providing security and privacy protection for medical images. This paper introduces a new lossless approach, called EdgeCrypt, to encrypt medical images using the information contained within an edge map. The algorithm can fully protect the selected objects/regions within medical images or the entire medical images. It can also encrypt other types of images such as grayscale images or color images. The algorithm can be used for privacy protection in the real-time medical applications such as wireless medical networking and mobile medical services. PMID:19965008

  17. A Novel Image Encryption Algorithm Based on DNA Subsequence Operation

    PubMed Central

    Zhang, Qiang; Xue, Xianglian; Wei, Xiaopeng

    2012-01-01

    We present a novel image encryption algorithm based on DNA subsequence operation. Different from the traditional DNA encryption methods, our algorithm does not use complex biological operation but just uses the idea of DNA subsequence operations (such as elongation operation, truncation operation, deletion operation, etc.) combining with the logistic chaotic map to scramble the location and the value of pixel points from the image. The experimental results and security analysis show that the proposed algorithm is easy to be implemented, can get good encryption effect, has a wide secret key's space, strong sensitivity to secret key, and has the abilities of resisting exhaustive attack and statistic attack. PMID:23093912

  18. Quantum Image Encryption Algorithm Based on Quantum Image XOR Operations

    NASA Astrophysics Data System (ADS)

    Gong, Li-Hua; He, Xiang-Tao; Cheng, Shan; Hua, Tian-Xiang; Zhou, Nan-Run

    2016-07-01

    A novel encryption algorithm for quantum images based on quantum image XOR operations is designed. The quantum image XOR operations are designed by using the hyper-chaotic sequences generated with the Chen's hyper-chaotic system to control the control-NOT operation, which is used to encode gray-level information. The initial conditions of the Chen's hyper-chaotic system are the keys, which guarantee the security of the proposed quantum image encryption algorithm. Numerical simulations and theoretical analyses demonstrate that the proposed quantum image encryption algorithm has larger key space, higher key sensitivity, stronger resistance of statistical analysis and lower computational complexity than its classical counterparts.

  19. Multiple Lookup Table-Based AES Encryption Algorithm Implementation

    NASA Astrophysics Data System (ADS)

    Gong, Jin; Liu, Wenyi; Zhang, Huixin

    Anew AES (Advanced Encryption Standard) encryption algorithm implementation was proposed in this paper. It is based on five lookup tables, which are generated from S-box(the substitution table in AES). The obvious advantages are reducing the code-size, improving the implementation efficiency, and helping new learners to understand the AES encryption algorithm and GF(28) multiplication which are necessary to correctly implement AES[1]. This method can be applied on processors with word length 32 or above, FPGA and others. And correspondingly we can implement it by VHDL, Verilog, VB and other languages.

  20. A novel image encryption algorithm based on DNA subsequence operation.

    PubMed

    Zhang, Qiang; Xue, Xianglian; Wei, Xiaopeng

    2012-01-01

    We present a novel image encryption algorithm based on DNA subsequence operation. Different from the traditional DNA encryption methods, our algorithm does not use complex biological operation but just uses the idea of DNA subsequence operations (such as elongation operation, truncation operation, deletion operation, etc.) combining with the logistic chaotic map to scramble the location and the value of pixel points from the image. The experimental results and security analysis show that the proposed algorithm is easy to be implemented, can get good encryption effect, has a wide secret key's space, strong sensitivity to secret key, and has the abilities of resisting exhaustive attack and statistic attack. PMID:23093912

  1. System for processing an encrypted instruction stream in hardware

    DOEpatents

    Griswold, Richard L.; Nickless, William K.; Conrad, Ryan C.

    2016-04-12

    A system and method of processing an encrypted instruction stream in hardware is disclosed. Main memory stores the encrypted instruction stream and unencrypted data. A central processing unit (CPU) is operatively coupled to the main memory. A decryptor is operatively coupled to the main memory and located within the CPU. The decryptor decrypts the encrypted instruction stream upon receipt of an instruction fetch signal from a CPU core. Unencrypted data is passed through to the CPU core without decryption upon receipt of a data fetch signal.

  2. A Layered Searchable Encryption Scheme with Functional Components Independent of Encryption Methods

    PubMed Central

    Luo, Guangchun; Qin, Ke

    2014-01-01

    Searchable encryption technique enables the users to securely store and search their documents over the remote semitrusted server, which is especially suitable for protecting sensitive data in the cloud. However, various settings (based on symmetric or asymmetric encryption) and functionalities (ranked keyword query, range query, phrase query, etc.) are often realized by different methods with different searchable structures that are generally not compatible with each other, which limits the scope of application and hinders the functional extensions. We prove that asymmetric searchable structure could be converted to symmetric structure, and functions could be modeled separately apart from the core searchable structure. Based on this observation, we propose a layered searchable encryption (LSE) scheme, which provides compatibility, flexibility, and security for various settings and functionalities. In this scheme, the outputs of the core searchable component based on either symmetric or asymmetric setting are converted to some uniform mappings, which are then transmitted to loosely coupled functional components to further filter the results. In such a way, all functional components could directly support both symmetric and asymmetric settings. Based on LSE, we propose two representative and novel constructions for ranked keyword query (previously only available in symmetric scheme) and range query (previously only available in asymmetric scheme). PMID:24719565

  3. Compressed hyperspectral sensing

    NASA Astrophysics Data System (ADS)

    Tsagkatakis, Grigorios; Tsakalides, Panagiotis

    2015-03-01

    Acquisition of high dimensional Hyperspectral Imaging (HSI) data using limited dimensionality imaging sensors has led to restricted capabilities designs that hinder the proliferation of HSI. To overcome this limitation, novel HSI architectures strive to minimize the strict requirements of HSI by introducing computation into the acquisition process. A framework that allows the integration of acquisition with computation is the recently proposed framework of Compressed Sensing (CS). In this work, we propose a novel HSI architecture that exploits the sampling and recovery capabilities of CS to achieve a dramatic reduction in HSI acquisition requirements. In the proposed architecture, signals from multiple spectral bands are multiplexed before getting recorded by the imaging sensor. Reconstruction of the full hyperspectral cube is achieved by exploiting a dictionary of elementary spectral profiles in a unified minimization framework. Simulation results suggest that high quality recovery is possible from a single or a small number of multiplexed frames.

  4. Public-key encryption and authentication of quantum information

    NASA Astrophysics Data System (ADS)

    Liang, Min; Yang, Li

    2012-09-01

    Public-key cryptosystems for quantum messages are considered from two aspects: public-key encryption and public-key authentication. Firstly, we propose a general construction of quantum public-key encryption scheme, and then construct an information-theoretic secure instance. Then, we propose a quantum public-key authentication scheme, which can protect the integrity of quantum messages. This scheme can both encrypt and authenticate quantum messages. It is information-theoretic secure with regard to encryption, and the success probability of tampering decreases exponentially with the security parameter with regard to authentication. Compared with classical public-key cryptosystems, one private-key in our schemes corresponds to an exponential number of public-keys, and every quantum public-key used by the sender is an unknown quantum state to the sender.

  5. Optical image encryption using multilevel Arnold transform and noninterferometric imaging

    NASA Astrophysics Data System (ADS)

    Chen, Wen; Chen, Xudong

    2011-11-01

    Information security has attracted much current attention due to the rapid development of modern technologies, such as computer and internet. We propose a novel method for optical image encryption using multilevel Arnold transform and rotatable-phase-mask noninterferometric imaging. An optical image encryption scheme is developed in the gyrator transform domain, and one phase-only mask (i.e., phase grating) is rotated and updated during image encryption. For the decryption, an iterative retrieval algorithm is proposed to extract high-quality plaintexts. Conventional encoding methods (such as digital holography) have been proven vulnerably to the attacks, and the proposed optical encoding scheme can effectively eliminate security deficiency and significantly enhance cryptosystem security. The proposed strategy based on the rotatable phase-only mask can provide a new alternative for data/image encryption in the noninterferometric imaging.

  6. Video encryption using chaotic masks in joint transform correlator

    NASA Astrophysics Data System (ADS)

    Saini, Nirmala; Sinha, Aloka

    2015-03-01

    A real-time optical video encryption technique using a chaotic map has been reported. In the proposed technique, each frame of video is encrypted using two different chaotic random phase masks in the joint transform correlator architecture. The different chaotic random phase masks can be obtained either by using different iteration levels or by using different seed values of the chaotic map. The use of different chaotic random phase masks makes the decryption process very complex for an unauthorized person. Optical, as well as digital, methods can be used for video encryption but the decryption is possible only digitally. To further enhance the security of the system, the key parameters of the chaotic map are encoded using RSA (Rivest-Shamir-Adleman) public key encryption. Numerical simulations are carried out to validate the proposed technique.

  7. Research on medical image encryption in telemedicine systems.

    PubMed

    Dai, Yin; Wang, Huanzhen; Zhou, Zixia; Jin, Ziyi

    2016-04-29

    Recently, advances in computers and high-speed communication tools have led to enhancements in remote medical consultation research. Laws in some localities require hospitals to encrypt patient information (including images of the patient) before transferring the data over a network. Therefore, developing suitable encryption algorithms is quite important for modern medicine. This paper demonstrates a digital image encryption algorithm based on chaotic mapping, which uses the no-period and no-convergence properties of a chaotic sequence to create image chaos and pixel averaging. Then, the chaotic sequence is used to encrypt the image, thereby improving data security. With this method, the security of data and images can be improved. PMID:27163302

  8. Attribute-Based Encryption with Partially Hidden Ciphertext Policies

    NASA Astrophysics Data System (ADS)

    Nishide, Takashi; Yoneyama, Kazuki; Ohta, Kazuo

    We propose attribute-based encryption schemes where encryptor-specified policies (called ciphertext policies) are hidden. By using our schemes, an encryptor can encrypt data with a hidden access control policy. A decryptor obtains her secret key associated with her attributes from a trusted authority in advance and if the attributes associated with the decryptor's secret key do not satisfy the access control policy associated with the encrypted data, the decryptor cannot decrypt the data or guess even what access control policy was specified by the encryptor. We prove security of our construction based on the Decisional Bilinear Diffie-Hellman assumption and the Decision Linear assumption. In our security notion, even the legitimate decryptor cannot obtain the information about the access control policy associated with the encrypted data more than the fact that she can decrypt the data.

  9. An image encryption based on elementary cellular automata

    NASA Astrophysics Data System (ADS)

    Jin, Jun

    2012-12-01

    This paper presents a new image encryption/decryption scheme. The behavior of a number of elementary cellular automata (ECA) of length 8 with periodic boundary conditions is investigated. It is found in the state-transition diagram that some ECA rules result in state attractors which satisfies basic requirement of the encryption scheme that can perform encrypting function to transform the pixel values. The generation of these attractors depending only on the rule and initial state of the CA, without any additional hardware cost for the implementation, and requires minimized computational resources. Simulation results on some grayscale and color images show that the proposed image encryption method satisfies the properties of confusion and diffusion, execution speed and has perfect information concealing.

  10. Multiple-image encryption based on computational ghost imaging

    NASA Astrophysics Data System (ADS)

    Wu, Jingjing; Xie, Zhenwei; Liu, Zhengjun; Liu, Wei; Zhang, Yan; Liu, Shutian

    2016-01-01

    We propose an optical multiple-image encryption scheme based on computational ghost imaging with the position multiplexing. In the encryption process, each plain image is encrypted into an intensity vector by using the computational ghost imaging with a different diffraction distance. The final ciphertext is generated by superposing all the intensity vectors together. Different from common multiple-image cryptosystems, the ciphertext in the proposed scheme is simply an intensity vector instead of a complex amplitude. Simulation results are presented to demonstrate the validity and security of the proposed multiple-image encryption method. The multiplexing capacity of the proposed method is also investigated. Optical experiment is presented to verify the validity of the proposed scheme in practical application.

  11. Optoelectronic information encryption with phase-shifting interferometry.

    PubMed

    Tajahuerce, E; Matoba, O; Verrall, S C; Javidi, B

    2000-05-10

    A technique that combines the high speed and the high security of optical encryption with the advantages of electronic transmission, storage, and decryption is introduced. Digital phase-shifting interferometry is used for efficient recording of phase and amplitude information with an intensity recording device. The encryption is performed by use of two random phase codes, one in the object plane and another in the Fresnel domain, providing high security in the encrypted image and a key with many degrees of freedom. We describe how our technique can be adapted to encrypt either the Fraunhofer or the Fresnel diffraction pattern of the input. Electronic decryption can be performed with a one-step fast Fourier transform reconstruction procedure. Experimental results for both systems including a lensless setup are shown. PMID:18345139

  12. Noise removing in encrypted color images by statistical analysis

    NASA Astrophysics Data System (ADS)

    Islam, N.; Puech, W.

    2012-03-01

    Cryptographic techniques are used to secure confidential data from unauthorized access but these techniques are very sensitive to noise. A single bit change in encrypted data can have catastrophic impact over the decrypted data. This paper addresses the problem of removing bit error in visual data which are encrypted using AES algorithm in the CBC mode. In order to remove the noise, a method is proposed which is based on the statistical analysis of each block during the decryption. The proposed method exploits local statistics of the visual data and confusion/diffusion properties of the encryption algorithm to remove the errors. Experimental results show that the proposed method can be used at the receiving end for the possible solution for noise removing in visual data in encrypted domain.

  13. Experimental multiplexing of encrypted movies using a JTC architecture.

    PubMed

    Barrera, John Fredy; Tebaldi, Myrian; Ríos, Carlos; Rueda, Edgar; Bolognini, Néstor; Torroba, Roberto

    2012-02-13

    We present the first experimental technique to encrypt a movie under a joint transform correlator architecture. We also extend the method to multiplex several movies in a single package. We use a Mach-Zehnder interferometer to encrypt experimentally each movie. One arm of the interferometer is the joint transform correlator and the other arm is the reference wave. We include the complete description of the procedure along with experimental results supporting the proposal. PMID:22418097

  14. Hyperchaotic Encryption for Secure E-Mail Communication

    NASA Astrophysics Data System (ADS)

    Aguilar-Bustos, A. Y.; Cruz-Hernández, C.; López-Gutiérrez, R. M.; Tlelo-Cuautle, E.; Posadas-Castillo, C.

    In this chapter, secure computer communication based on synchronized hyperchaotic maps is presented. In particular, we appeal to model-matching approach from nonlinear control theory to synchronize the outputs of two coupled hyperchaotic Rössler maps. An application to secure e-mail communication for confidential information is given. By using a hyperchaotic encryption scheme, we show that output synchronization of hyperchaotic Rössler maps is indeed suitable for encryption, transmission, and decryption of information.

  15. Optical design of cipher block chaining (CBC) encryption mode by using digital holography

    NASA Astrophysics Data System (ADS)

    Gil, Sang Keun; Jeon, Seok Hee; Jung, Jong Rae; Kim, Nam

    2016-03-01

    We propose an optical design of cipher block chaining (CBC) encryption by using digital holographic technique, which has higher security than the conventional electronic method because of the analog-type randomized cipher text with 2-D array. In this paper, an optical design of CBC encryption mode is implemented by 2-step quadrature phase-shifting digital holographic encryption technique using orthogonal polarization. A block of plain text is encrypted with the encryption key by applying 2-step phase-shifting digital holography, and it is changed into cipher text blocks which are digital holograms. These ciphered digital holograms with the encrypted information are Fourier transform holograms and are recorded on CCDs with 256 gray levels quantized intensities. The decryption is computed by these encrypted digital holograms of cipher texts, the same encryption key and the previous cipher text. Results of computer simulations are presented to verify that the proposed method shows the feasibility in the high secure CBC encryption system.

  16. The role of decimated sequences in scaling encryption speeds through parallelism

    SciTech Connect

    Witzke, E.L.

    1995-09-01

    Encryption performance, in terms of bits per second encrypted, has not scaled well as network performance has increased. The authors felt that multiple encryption modules operating in parallel would be the cornerstone of scalable encryption. One major problem with parallelizing encryption is ensuring that each encryption module is getting the proper portion of the key sequence at the correct point in the encryption or decryption of the message. Many encryption schemes use linear recurring sequences, which may be generated by a linear feedback shift register. Instead of using a linear feedback shift register, the authors describe a method to generate the linear recurring sequence by using parallel decimated sequences, one per encryption module. Computing decimated sequences can be time consuming, so the authors have also described a way to compute these sequences with logic gates rather than arithmetic operations.

  17. A New Quaternion-Based Encryption Method for DICOM Images.

    PubMed

    Dzwonkowski, Mariusz; Papaj, Michal; Rykaczewski, Roman

    2015-11-01

    In this paper, a new quaternion-based lossless encryption technique for digital image and communication on medicine (DICOM) images is proposed. We have scrutinized and slightly modified the concept of the DICOM network to point out the best location for the proposed encryption scheme, which significantly improves speed of DICOM images encryption in comparison with those originally embedded into DICOM advanced encryption standard and triple data encryption standard algorithms. The proposed algorithm decomposes a DICOM image into two 8-bit gray-tone images in order to perform encryption. The algorithm implements Feistel network like the scheme proposed by Sastry and Kumar. It uses special properties of quaternions to perform rotations of data sequences in 3D space for each of the cipher rounds. The images are written as Lipschitz quaternions, and modular arithmetic was implemented for operations with the quaternions. A computer-based analysis has been carried out, and the obtained results are shown at the end of this paper. PMID:26276993

  18. Experimental multiplexing protocol to encrypt messages of any length

    NASA Astrophysics Data System (ADS)

    Fredy Barrera, John; Vélez, Alejandro; Torroba, Roberto

    2013-05-01

    As optical systems are diffraction limited, it is not possible to encrypt in a single step texts containing a large amount of characters. We overcome this situation by separately encrypting several characters, along with a multiplexing procedure to obtain an encrypted keyboard. The experimental application is performed in a joint transform correlator architecture and using digital holography. We combine the different characters into a keyboard encrypted with a single phase mask together with a selection-position key that gives the right sequence to recover safe encrypted messages. The multiplexing operation we suggest is advantageous in the sense that the technique enables processing of messages that otherwise the optical system could not process in a single step. We also employ a repositioning technique to prevent both the natural background noise over recovered characters and the possible cross talk. The lack of any single key avoids the correct message recovery. Experimental results are presented to show the feasibility of our proposal, representing an actual application of the optical encrypting protocols.

  19. Secure data aggregation in wireless sensor networks using homomorphic encryption

    NASA Astrophysics Data System (ADS)

    Kumar, Manish; Verma, Shekhar; Lata, Kusum

    2015-04-01

    In a Wireless Sensor Network (WSN), aggregation exploits the correlation between spatially and temporally proximate sensor data to reduce the total data volume to be transmitted to the sink. Mobile agents (MAs) fit into this paradigm, and data can be aggregated and collected by an MA from different sensor nodes using context specific codes. The MA-based data collection suffers due to large size of a typical WSN and is prone to security problems. In this article, homomorphic encryption in a clustered WSN has been proposed for secure and efficient data collection using MAs. The nodes keep encrypted data that are given to an MA for data aggregation tasks. The MA performs all the data aggregation operations upon encrypted data as it migrates between nodes in a tree-like structure in which the nodes are leafs and the cluster head is the root of the tree. It returns and deposits the encrypted aggregated data to the cluster head after traversing through all the intra cluster nodes over a shortest path route. The homomorphic encryption and aggregation processing in encrypted domain makes the data collection process secure. Simulation results confirm the effectiveness of the proposed secure data aggregation mechanism. In addition to security, MA-based mechanism leads to lesser delay and bandwidth requirements.

  20. Research of storage encryption based on multi-protocol RAID

    NASA Astrophysics Data System (ADS)

    Pei, Canhao; Xie, Changsheng; Zhang, Le

    2009-08-01

    Traditional RAID gradually becomes unable to satisfy most applications. It is reflected in two main respects, one is the security problem of data in RAID system, the other is that one RAID controller can not use several devices of different protocol. Now, the performance of RAID controller gets faster and faster, therefore, it is the right time to use software encryption module instead of hardware encryption to guarantee the data confidentiality. Furthermore, with the development of storage device, different disk interface appears. How to use the disk of different protocol in the same RAID controller is becoming a new research hotspot. As to the problems mentioned above, this paper presents a new multi-protocol disk array architecture that provides encryption on RAID, referred to as Encryption Multi-protocol RAID (EMRAID). EMRAID solution not only uses different interface to management the different kinds of device, but also adopts SEAL algorithm which is an efficient pseudorandom function family encryption algorithm. Analysis result indicates that EMRAID performs more efficiently than the single-protocol RAID, and the experiment shows that the encryption algorithm has certain loss (not very large) on I/O performance.

  1. A joint watermarking/encryption algorithm for verifying medical image integrity and authenticity in both encrypted and spatial domains.

    PubMed

    Bouslimi, D; Coatrieux, G; Roux, Ch

    2011-01-01

    In this paper, we propose a new joint watermarking/encryption algorithm for the purpose of verifying the reliability of medical images in both encrypted and spatial domains. It combines a substitutive watermarking algorithm, the quantization index modulation (QIM), with a block cipher algorithm, the Advanced Encryption Standard (AES), in CBC mode of operation. The proposed solution gives access to the outcomes of the image integrity and of its origins even though the image is stored encrypted. Experimental results achieved on 8 bits encoded Ultrasound images illustrate the overall performances of the proposed scheme. By making use of the AES block cipher in CBC mode, the proposed solution is compliant with or transparent to the DICOM standard. PMID:22256213

  2. Forensic watermarking and bit-rate conversion of partially encrypted AAC bitstreams

    NASA Astrophysics Data System (ADS)

    Lemma, Aweke; Katzenbeisser, Stefan; Celik, Mehmet U.; Kirbiz, S.

    2008-02-01

    Electronic Music Distribution (EMD) is undergoing two fundamental shifts. The delivery over wired broadband networks to personal computers is being replaced by delivery over heterogeneous wired and wireless networks, e.g. 3G and Wi-Fi, to a range of devices such as mobile phones, game consoles and in-car players. Moreover, restrictive DRM models bound to a limited set of devices are being replaced by flexible standards-based DRM schemes and increasingly forensic tracking technologies based on watermarking. Success of these EMD services will partially depend on scalable, low-complexity and bandwidth eficient content protection systems. In this context, we propose a new partial encryption scheme for Advanced Audio Coding (AAC) compressed audio which is particularly suitable for emerging EMD applications. The scheme encrypts only the scale-factor information in the AAC bitstream with an additive one-time-pad. This allows intermediate network nodes to transcode the bitstream to lower data rates without accessing the decryption keys, by increasing the scale-factor values and re-quantizing the corresponding spectral coeficients. Furthermore, the decryption key for each user is customized such that the decryption process imprints the audio with a unique forensic tracking watermark. This constitutes a secure, low-complexity watermark embedding process at the destination node, i.e. the player. As opposed to server-side embedding methods, the proposed scheme lowers the computational burden on servers and allows for network level bandwidth saving measures such as multi-casting and caching.

  3. Computed Tomography Image Compressibility and Limitations of Compression Ratio-Based Guidelines.

    PubMed

    Pambrun, Jean-François; Noumeir, Rita

    2015-12-01

    Finding optimal compression levels for diagnostic imaging is not an easy task. Significant compressibility variations exist between modalities, but little is known about compressibility variations within modalities. Moreover, compressibility is affected by acquisition parameters. In this study, we evaluate the compressibility of thousands of computed tomography (CT) slices acquired with different slice thicknesses, exposures, reconstruction filters, slice collimations, and pitches. We demonstrate that exposure, slice thickness, and reconstruction filters have a significant impact on image compressibility due to an increased high frequency content and a lower acquisition signal-to-noise ratio. We also show that compression ratio is not a good fidelity measure. Therefore, guidelines based on compression ratio should ideally be replaced with other compression measures better correlated with image fidelity. Value-of-interest (VOI) transformations also affect the perception of quality. We have studied the effect of value-of-interest transformation and found significant masking of artifacts when window is widened. PMID:25804842

  4. Applications of data compression techniques to a communication system

    NASA Astrophysics Data System (ADS)

    Choi, Junho; Grunes, Michael R.

    1995-06-01

    A brief overview of current status of data compression technologies are presented with the interim development of compression software and tests of effectiveness on the selected digitized data types. Several algorithms such as Rice, LZ-family, and run-length codings are examined for selected digitized packet data streams. These algorithms are able to compress most data available with a fairly good compression factor except for Tape A and encrypted data. Tape A data contains a mixture of several data formats in very short runs (several packets), rather than the long runs (typically hundreds of packets), for which the current version of the software was designed. The remaining data sets were compressed with a compression factor of over 2.74.

  5. Secure Data Aggregation with Fully Homomorphic Encryption in Large-Scale Wireless Sensor Networks.

    PubMed

    Li, Xing; Chen, Dexin; Li, Chunyan; Wang, Liangmin

    2015-01-01

    With the rapid development of wireless communication technology, sensor technology, information acquisition and processing technology, sensor networks will finally have a deep influence on all aspects of people's lives. The battery resources of sensor nodes should be managed efficiently in order to prolong network lifetime in large-scale wireless sensor networks (LWSNs). Data aggregation represents an important method to remove redundancy as well as unnecessary data transmission and hence cut down the energy used in communication. As sensor nodes are deployed in hostile environments, the security of the sensitive information such as confidentiality and integrity should be considered. This paper proposes Fully homomorphic Encryption based Secure data Aggregation (FESA) in LWSNs which can protect end-to-end data confidentiality and support arbitrary aggregation operations over encrypted data. In addition, by utilizing message authentication codes (MACs), this scheme can also verify data integrity during data aggregation and forwarding processes so that false data can be detected as early as possible. Although the FHE increase the computation overhead due to its large public key size, simulation results show that it is implementable in LWSNs and performs well. Compared with other protocols, the transmitted data and network overhead are reduced in our scheme. PMID:26151208

  6. Secure Data Aggregation with Fully Homomorphic Encryption in Large-Scale Wireless Sensor Networks

    PubMed Central

    Li, Xing; Chen, Dexin; Li, Chunyan; Wang, Liangmin

    2015-01-01

    With the rapid development of wireless communication technology, sensor technology, information acquisition and processing technology, sensor networks will finally have a deep influence on all aspects of people’s lives. The battery resources of sensor nodes should be managed efficiently in order to prolong network lifetime in large-scale wireless sensor networks (LWSNs). Data aggregation represents an important method to remove redundancy as well as unnecessary data transmission and hence cut down the energy used in communication. As sensor nodes are deployed in hostile environments, the security of the sensitive information such as confidentiality and integrity should be considered. This paper proposes Fully homomorphic Encryption based Secure data Aggregation (FESA) in LWSNs which can protect end-to-end data confidentiality and support arbitrary aggregation operations over encrypted data. In addition, by utilizing message authentication codes (MACs), this scheme can also verify data integrity during data aggregation and forwarding processes so that false data can be detected as early as possible. Although the FHE increase the computation overhead due to its large public key size, simulation results show that it is implementable in LWSNs and performs well. Compared with other protocols, the transmitted data and network overhead are reduced in our scheme. PMID:26151208

  7. Image encryption based on nonlinear encryption system and public-key cryptography

    NASA Astrophysics Data System (ADS)

    Zhao, Tieyu; Ran, Qiwen; Chi, Yingying

    2015-03-01

    Recently, optical asymmetric cryptosystem (OACS) has became the focus of discussion and concern of researchers. Some researchers pointed out that OACS was not tenable because of misunderstanding the concept of asymmetric cryptosystem (ACS). We propose an improved cryptosystem using RSA public-key algorithm based on existing OACS and the new system conforms to the basic agreement of public key cryptosystem. At the beginning of the encryption process, the system will produce an independent phase matrix and allocate the input image, which also conforms to one-time pad cryptosystem. The simulation results show that the validity of the improved cryptosystem and the high robustness against attack scheme using phase retrieval technique.

  8. Key management of the double random-phase-encoding method using public-key encryption

    NASA Astrophysics Data System (ADS)

    Saini, Nirmala; Sinha, Aloka

    2010-03-01

    Public-key encryption has been used to encode the key of the encryption process. In the proposed technique, an input image has been encrypted by using the double random-phase-encoding method using extended fractional Fourier transform. The key of the encryption process have been encoded by using the Rivest-Shamir-Adelman (RSA) public-key encryption algorithm. The encoded key has then been transmitted to the receiver side along with the encrypted image. In the decryption process, first the encoded key has been decrypted using the secret key and then the encrypted image has been decrypted by using the retrieved key parameters. The proposed technique has advantage over double random-phase-encoding method because the problem associated with the transmission of the key has been eliminated by using public-key encryption. Computer simulation has been carried out to validate the proposed technique.

  9. Photonic encryption : modeling and functional analysis of all optical logic.

    SciTech Connect

    Tang, Jason D.; Schroeppel, Richard Crabtree; Robertson, Perry J.

    2004-10-01

    With the build-out of large transport networks utilizing optical technologies, more and more capacity is being made available. Innovations in Dense Wave Division Multiplexing (DWDM) and the elimination of optical-electrical-optical conversions have brought on advances in communication speeds as we move into 10 Gigabit Ethernet and above. Of course, there is a need to encrypt data on these optical links as the data traverses public and private network backbones. Unfortunately, as the communications infrastructure becomes increasingly optical, advances in encryption (done electronically) have failed to keep up. This project examines the use of optical logic for implementing encryption in the photonic domain to achieve the requisite encryption rates. This paper documents the innovations and advances of work first detailed in 'Photonic Encryption using All Optical Logic,' [1]. A discussion of underlying concepts can be found in SAND2003-4474. In order to realize photonic encryption designs, technology developed for electrical logic circuits must be translated to the photonic regime. This paper examines S-SEED devices and how discrete logic elements can be interconnected and cascaded to form an optical circuit. Because there is no known software that can model these devices at a circuit level, the functionality of S-SEED devices in an optical circuit was modeled in PSpice. PSpice allows modeling of the macro characteristics of the devices in context of a logic element as opposed to device level computational modeling. By representing light intensity as voltage, 'black box' models are generated that accurately represent the intensity response and logic levels in both technologies. By modeling the behavior at the systems level, one can incorporate systems design tools and a simulation environment to aid in the overall functional design. Each black box model takes certain parameters (reflectance, intensity, input response), and models the optical ripple and time delay

  10. Encryption in TECB Mode: Modeling, Simulation and Synthesis

    NASA Astrophysics Data System (ADS)

    Reaz, M. B. I.; Ibrahimy, M. I.; Mohd-Yasin, F.; Wei, C. S.; Kamada, M.

    The growth of the Internet as a vehicle for secure communication has resulted in Data Encryption Standard (DES) no longer capable of providing high-level security for data protection. Triple Data Encryption Standard (3DES) is a symmetric block cipher with 192 bits key proposed to further enhance DES. Many applications crave for the speed of a hardware encryption implementation while trying to preserve the flexibility and low cost of a software implementation. This project used single core module to implement encryption in Triple DES Electronic Code Book (TECB) mode, which was modeled using hardware description language VHDL. The architecture was mapped in Altera EPF10K100EFC484-1 and EP20K200EFC672-1X for performance investigations and resulted in achieving encryption rate of 102.56 Mbps, area utilization of 2111 logic cells (25%) and a higher maximum operating frequency of 78.59 MHz by implementing on the larger FPGA device EP20K200EFC672-1X. It also suggested that 3DES hardware was 2.4 times faster than its software counterpart.

  11. Cancelable face verification using optical encryption and authentication.

    PubMed

    Taheri, Motahareh; Mozaffari, Saeed; Keshavarzi, Parviz

    2015-10-01

    In a cancelable biometric system, each instance of enrollment is distorted by a transform function, and the output should not be retransformed to the original data. This paper presents a new cancelable face verification system in the encrypted domain. Encrypted facial images are generated by a double random phase encoding (DRPE) algorithm using two keys (RPM1 and RPM2). To make the system noninvertible, a photon counting (PC) method is utilized, which requires a photon distribution mask for information reduction. Verification of sparse images that are not recognizable by direct visual inspection is performed by unconstrained minimum average correlation energy filter. In the proposed method, encryption keys (RPM1, RPM2, and PDM) are used in the sender side, and the receiver needs only encrypted images and correlation filters. In this manner, the system preserves privacy if correlation filters are obtained by an adversary. Performance of PC-DRPE verification system is evaluated under illumination variation, pose changes, and facial expression. Experimental results show that utilizing encrypted images not only increases security concerns but also enhances verification performance. This improvement can be attributed to the fact that, in the proposed system, the face verification problem is converted to key verification tasks. PMID:26479930

  12. Optical Encryption of Arrays of Binary Digits in Spatially Incoherent Light

    NASA Astrophysics Data System (ADS)

    Krasnov, V. V.; Starikov, S. N.; Starikov, R. S.; Cheremkhin, P. A.

    2016-02-01

    Optical encryption of arrays of binary digits in spatially incoherent light is experimentally implemented. Successful optical encryption and numerical decryption of images of binary arrays using a developed setup is demonstrated. Faultless decryption of arrays with normalized average energies (NAEs) up to 0.3 inclusive has been implemented. It is demonstrated that a decrease in the NAE of arrays to be encrypted leads to a decrease in the encryption error rate.

  13. An Image Encryption Scheme Based on Lorenz System for Low Profile Applications

    NASA Astrophysics Data System (ADS)

    Anees, Amir

    2015-09-01

    Advanced encryption standard being a benchmark for encryption is very ideal for digital images encryption for its security reasons but might not be effective for low profile applications due to its high computational and hardware complexity. In this paper, we presents a robust image encryption scheme for these types of applications based on chaotic sequences of Lorenz system, also ensuring the system security as well. The security strength is evident from the results of statistical and key analysis done in this paper.

  14. Compression embedding

    DOEpatents

    Sandford, II, Maxwell T.; Handel, Theodore G.; Bradley, Jonathan N.

    1998-01-01

    A method and apparatus for embedding auxiliary information into the digital representation of host data created by a lossy compression technique and a method and apparatus for constructing auxiliary data from the correspondence between values in a digital key-pair table with integer index values existing in a representation of host data created by a lossy compression technique. The methods apply to data compressed with algorithms based on series expansion, quantization to a finite number of symbols, and entropy coding. Lossy compression methods represent the original data as ordered sequences of blocks containing integer indices having redundancy and uncertainty of value by one unit, allowing indices which are adjacent in value to be manipulated to encode auxiliary data. Also included is a method to improve the efficiency of lossy compression algorithms by embedding white noise into the integer indices. Lossy compression methods use loss-less compression to reduce to the final size the intermediate representation as indices. The efficiency of the loss-less compression, known also as entropy coding compression, is increased by manipulating the indices at the intermediate stage. Manipulation of the intermediate representation improves lossy compression performance by 1 to 10%.

  15. Compression embedding

    DOEpatents

    Sandford, M.T. II; Handel, T.G.; Bradley, J.N.

    1998-07-07

    A method and apparatus for embedding auxiliary information into the digital representation of host data created by a lossy compression technique and a method and apparatus for constructing auxiliary data from the correspondence between values in a digital key-pair table with integer index values existing in a representation of host data created by a lossy compression technique are disclosed. The methods apply to data compressed with algorithms based on series expansion, quantization to a finite number of symbols, and entropy coding. Lossy compression methods represent the original data as ordered sequences of blocks containing integer indices having redundancy and uncertainty of value by one unit, allowing indices which are adjacent in value to be manipulated to encode auxiliary data. Also included is a method to improve the efficiency of lossy compression algorithms by embedding white noise into the integer indices. Lossy compression methods use loss-less compression to reduce to the final size the intermediate representation as indices. The efficiency of the loss-less compression, known also as entropy coding compression, is increased by manipulating the indices at the intermediate stage. Manipulation of the intermediate representation improves lossy compression performance by 1 to 10%. 21 figs.

  16. Compression embedding

    DOEpatents

    Sandford, II, Maxwell T.; Handel, Theodore G.; Bradley, Jonathan N.

    1998-01-01

    A method of embedding auxiliary information into the digital representation of host data created by a lossy compression technique. The method applies to data compressed with lossy algorithms based on series expansion, quantization to a finite number of symbols, and entropy coding. Lossy compression methods represent the original data as integer indices having redundancy and uncertainty in value by one unit. Indices which are adjacent in value are manipulated to encode auxiliary data. By a substantially reverse process, the embedded auxiliary data can be retrieved easily by an authorized user. Lossy compression methods use loss-less compressions known also as entropy coding, to reduce to the final size the intermediate representation as indices. The efficiency of the compression entropy coding, known also as entropy coding is increased by manipulating the indices at the intermediate stage in the manner taught by the method.

  17. Compression embedding

    DOEpatents

    Sandford, M.T. II; Handel, T.G.; Bradley, J.N.

    1998-03-10

    A method of embedding auxiliary information into the digital representation of host data created by a lossy compression technique is disclosed. The method applies to data compressed with lossy algorithms based on series expansion, quantization to a finite number of symbols, and entropy coding. Lossy compression methods represent the original data as integer indices having redundancy and uncertainty in value by one unit. Indices which are adjacent in value are manipulated to encode auxiliary data. By a substantially reverse process, the embedded auxiliary data can be retrieved easily by an authorized user. Lossy compression methods use loss-less compressions known also as entropy coding, to reduce to the final size the intermediate representation as indices. The efficiency of the compression entropy coding, known also as entropy coding is increased by manipulating the indices at the intermediate stage in the manner taught by the method. 11 figs.

  18. Content-based image retrieval in homomorphic encryption domain.

    PubMed

    Bellafqira, Reda; Coatrieux, Gouenou; Bouslimi, Dalel; Quellec, Gwenole

    2015-08-01

    In this paper, we propose a secure implementation of a content-based image retrieval (CBIR) method that makes possible diagnosis aid systems to work in externalized environment and with outsourced data as in cloud computing. This one works with homomorphic encrypted images from which it extracts wavelet based image features next used for subsequent image comparison. By doing so, our system allows a physician to retrieve the most similar images to a query image in an outsourced database while preserving data confidentiality. Our Secure CBIR is the first one that proposes to work with global image features extracted from encrypted images and does not induce extra communications in-between the client and the server. Experimental results show it achieves retrieval performance as good as if images were processed non-encrypted. PMID:26736909

  19. Image encryption using random sequence generated from generalized information domain

    NASA Astrophysics Data System (ADS)

    Xia-Yan, Zhang; Guo-Ji, Zhang; Xuan, Li; Ya-Zhou, Ren; Jie-Hua, Wu

    2016-05-01

    A novel image encryption method based on the random sequence generated from the generalized information domain and permutation–diffusion architecture is proposed. The random sequence is generated by reconstruction from the generalized information file and discrete trajectory extraction from the data stream. The trajectory address sequence is used to generate a P-box to shuffle the plain image while random sequences are treated as keystreams. A new factor called drift factor is employed to accelerate and enhance the performance of the random sequence generator. An initial value is introduced to make the encryption method an approximately one-time pad. Experimental results show that the random sequences pass the NIST statistical test with a high ratio and extensive analysis demonstrates that the new encryption scheme has superior security.

  20. Secure Holographic Memory by Double-Random Polarization Encryption

    NASA Astrophysics Data System (ADS)

    Matoba, Osamu; Javidi, Bahram

    2004-05-01

    A novel optical encryption based on polarization is proposed and applied to a holographic memory system. Original binary data are described as two orthogonal linear polarization states. These input polarization states can be modulated by use of two polarization-modulation masks located at the input and the Fourier planes. Each modulation mask can convert an input polarization state into a random polarization state. Once encrypted, the polarization state is recorded as a hologram. For the decryption, the hologram can generate a vector phase-conjugate beam. When the same polarization-modulation masks are used, the vector phase-conjugate readout can cancel the polarization modulation at each mask, and the original polarization state can be recovered. The encryption of the proposed method is evaluated numerically. We also present experimental results by demonstrating holographic recording in a bacteriorhodopsin film.

  1. Secure Genomic Computation through Site-Wise Encryption.

    PubMed

    Zhao, Yongan; Wang, XiaoFeng; Tang, Haixu

    2015-01-01

    Commercial clouds provide on-demand IT services for big-data analysis, which have become an attractive option for users who have no access to comparable infrastructure. However, utilizing these services for human genome analysis is highly risky, as human genomic data contains identifiable information of human individuals and their disease susceptibility. Therefore, currently, no computation on personal human genomic data is conducted on public clouds. To address this issue, here we present a site-wise encryption approach to encrypt whole human genome sequences, which can be subject to secure searching of genomic signatures on public clouds. We implemented this method within the Hadoop framework, and tested it on the case of searching disease markers retrieved from the ClinVar database against patients' genomic sequences. The secure search runs only one order of magnitude slower than the simple search without encryption, indicating our method is ready to be used for secure genomic computation on public clouds. PMID:26306278

  2. Secure Genomic Computation through Site-Wise Encryption

    PubMed Central

    Zhao, Yongan; Wang, XiaoFeng; Tang, Haixu

    2015-01-01

    Commercial clouds provide on-demand IT services for big-data analysis, which have become an attractive option for users who have no access to comparable infrastructure. However, utilizing these services for human genome analysis is highly risky, as human genomic data contains identifiable information of human individuals and their disease susceptibility. Therefore, currently, no computation on personal human genomic data is conducted on public clouds. To address this issue, here we present a site-wise encryption approach to encrypt whole human genome sequences, which can be subject to secure searching of genomic signatures on public clouds. We implemented this method within the Hadoop framework, and tested it on the case of searching disease markers retrieved from the ClinVar database against patients’ genomic sequences. The secure search runs only one order of magnitude slower than the simple search without encryption, indicating our method is ready to be used for secure genomic computation on public clouds. PMID:26306278

  3. An Image Encryption Algorithm Utilizing Julia Sets and Hilbert Curves

    PubMed Central

    Sun, Yuanyuan; Chen, Lina; Xu, Rudan; Kong, Ruiqing

    2014-01-01

    Image encryption is an important and effective technique to protect image security. In this paper, a novel image encryption algorithm combining Julia sets and Hilbert curves is proposed. The algorithm utilizes Julia sets’ parameters to generate a random sequence as the initial keys and gets the final encryption keys by scrambling the initial keys through the Hilbert curve. The final cipher image is obtained by modulo arithmetic and diffuse operation. In this method, it needs only a few parameters for the key generation, which greatly reduces the storage space. Moreover, because of the Julia sets’ properties, such as infiniteness and chaotic characteristics, the keys have high sensitivity even to a tiny perturbation. The experimental results indicate that the algorithm has large key space, good statistical property, high sensitivity for the keys, and effective resistance to the chosen-plaintext attack. PMID:24404181

  4. Optical cryptanalysis of DRPE-based encryption systems

    NASA Astrophysics Data System (ADS)

    Qin, Wan; He, Wenqi; Meng, Xiangfeng; Peng, Xiang

    2009-11-01

    In this paper, we analyze the security of the classical double random phase encoding (DRPE) technique in Fourier domain, as well as its extended schemes in Fresnel and fractional Fourier domains. These schemes are resistant to bruteforce attacks, for their large key spaces. However, due to the linearity property of their encryption transformations, they are vulnerable to other attacks, such as chosen-plaintext attack and known-plaintext attack. We successfully break each of the three encryption schemes with the help of a certain quantity of plaintext-ciphertext pairs. Each attack is validated by computer simulations. The cryptanalysis indicates that, to minimize the risks, it is recommendable to introduce nonlinear operations to optical encryption systems.

  5. A palmprint-based cryptosystem using double encryption

    NASA Astrophysics Data System (ADS)

    Kumar, Amioy; Kumar, Ajay

    2008-03-01

    We propose a novel cryptographic construct incorporating biometrics which insures a secure communication between two channels just by using Palmprint. The cryptosystem utilizes the advantages of both symmetric and asymmetric cryptographic approaches simultaneously; we denote it as double encryption. Any document in communication is first encrypted using symmetric cryptographic approach; the symmetric key involved is then encrypted using Asymmetric approach. Finally, the concept of fuzzy vault is explored to create a secure vault around the asymmetric key. We investigate the possible usage of palmprints in fuzzy vault to develop a user friendly and reliable crypto system. The experimental results from the proposed approach on the real palmprint images suggest its possible usage in an automated palmprint based key generation system.

  6. Encryption of covert information into multiple statistical distributions

    NASA Astrophysics Data System (ADS)

    Venkatesan, R. C.

    2007-10-01

    A novel strategy to encrypt covert information (code) via unitary projections into the null spaces of ill-conditioned eigenstructures of multiple host statistical distributions, inferred from incomplete constraints, is presented. The host pdf's are inferred using the maximum entropy principle. The projection of the covert information is dependent upon the pdf's of the host statistical distributions. The security of the encryption/decryption strategy is based on the extreme instability of the encoding process. A self-consistent procedure to derive keys for both symmetric and asymmetric cryptography is presented. The advantages of using a multiple pdf model to achieve encryption of covert information are briefly highlighted. Numerical simulations exemplify the efficacy of the model.

  7. Packet loss due to encryption in space data systems

    NASA Astrophysics Data System (ADS)

    Kwon, Hyuck M.

    1994-05-01

    This paper analyzes the probabilities of data packet loss for both an encrypted channel in self-synchronous cipher feedback mode and a nonencrypted channel, in the space data systems. Simulation results show reasonable agreement with analytical results. When channel bit error probability is 10(sup - 5) and the total number of packets per frame is 3, the analytical model gives 0.39% packet loss while the simulation gives 0.22% packet loss due to encryption. Although the analysis is performed for the space data systems, the resulting derived equations with minor change will be useful in many packet communication applications.

  8. Special encryption considerations for unattended ground sensor systems

    NASA Astrophysics Data System (ADS)

    Drummond, Allen P.

    2004-09-01

    Requirements in Unattended Ground Sensor (UGS) systems have grown to include data privacy, message authentication, and anti-spoofing measures. This presents a challenge to the systems architect to consider approaches that defend against known and unknown attacks designed to compromise the system integrity. Encryption has been the preferred method to address these requirements. Encryption may be used to increase our confidence in the data transmitted in sensor networks, but requires greater, not less, attention to system security. After all, in an unencrypted network, at least we "know" that an adversary can read our data.

  9. Image/video encryption using single shot digital holography

    NASA Astrophysics Data System (ADS)

    Li, Xiaoyu; Tang, Chen; Zhu, Xinjun; Li, Biyuan; Wang, Linlin; Yan, Xiusheng

    2015-05-01

    We propose a method for image/video encryption that combines double random-phase encoding in the Fresnel domain with a single shot digital holography. In this method, a complex object field can be reconstructed with only single frame hologram based on a constrained optimization method. The system without multiple shots and Fourier lens is simple, and allows to dynamically encrypt information. We test the proposed method on a computer simulated image, a grayscale image and a video in AVI format. Also we investigate the quality of the decryption process and the performance against noise attacks. The experimental results demonstrate the performance of the method.

  10. Multiple-image encryption based on optical asymmetric key cryptosystem

    NASA Astrophysics Data System (ADS)

    Liu, Wei; Xie, Zhenwei; Liu, Zhengjun; Zhang, Yan; Liu, Shutian

    2015-01-01

    We propose a multiple-image encryption scheme with asymmetric keys and demonstrate it by optical experiments. The original secret images are multiplexed and encoded into a real-valued ciphertext using only one public encryption key. In the decryption process, each secret image can only be de-multiplexed by its corresponding private decryption key. The multiplexing capacity is analyzed through examining the distribution of cross-talk noise and the key space of private decryption key. Numerical simulations and optical experiments have been carried out to demonstrate the validity, high security, and large multiplexing capacity of the proposed method.

  11. Compressive Holography

    NASA Astrophysics Data System (ADS)

    Lim, Se Hoon

    Compressive holography estimates images from incomplete data by using sparsity priors. Compressive holography combines digital holography and compressive sensing. Digital holography consists of computational image estimation from data captured by an electronic focal plane array. Compressive sensing enables accurate data reconstruction by prior knowledge on desired signal. Computational and optical co-design optimally supports compressive holography in the joint computational and optical domain. This dissertation explores two examples of compressive holography: estimation of 3D tomographic images from 2D data and estimation of images from under sampled apertures. Compressive holography achieves single shot holographic tomography using decompressive inference. In general, 3D image reconstruction suffers from underdetermined measurements with a 2D detector. Specifically, single shot holographic tomography shows the uniqueness problem in the axial direction because the inversion is ill-posed. Compressive sensing alleviates the ill-posed problem by enforcing some sparsity constraints. Holographic tomography is applied for video-rate microscopic imaging and diffuse object imaging. In diffuse object imaging, sparsity priors are not valid in coherent image basis due to speckle. So incoherent image estimation is designed to hold the sparsity in incoherent image basis by support of multiple speckle realizations. High pixel count holography achieves high resolution and wide field-of-view imaging. Coherent aperture synthesis can be one method to increase the aperture size of a detector. Scanning-based synthetic aperture confronts a multivariable global optimization problem due to time-space measurement errors. A hierarchical estimation strategy divides the global problem into multiple local problems with support of computational and optical co-design. Compressive sparse aperture holography can be another method. Compressive sparse sampling collects most of significant field

  12. Subsampling technique to enhance the decoded output of JTC encrypting system

    NASA Astrophysics Data System (ADS)

    Barrera, John Fredy; Rueda, Edgar; Ríos, Carlos; Tebaldi, Myrian; Bolognini, Nestor; Torroba, Roberto

    2011-08-01

    Optical systems have physical restrictions that impose limits in the finest spatial feature that can be processed. In this work we combine a subsampling procedure with a multiplexing technique to overtake the limit on the information that is processed in a JTC encryption system. In the process the object is divided in subsamples and each subsample is encrypted separately. Then the encrypted subsamples are multiplexed. The encryption of the subsamples is performed in a real optical JTC encrypting system. The multiplexing and the decryption process are carried out by means of a virtual optical system. Experimental results are presented to show the validity of the proposal.

  13. Double color image encryption using iterative phase retrieval algorithm in quaternion gyrator domain.

    PubMed

    Shao, Zhuhong; Shu, Huazhong; Wu, Jiasong; Dong, Zhifang; Coatrieux, Gouenou; Coatrieux, Jean Louis

    2014-03-10

    This paper describes a novel algorithm to encrypt double color images into a single undistinguishable image in quaternion gyrator domain. By using an iterative phase retrieval algorithm, the phase masks used for encryption are obtained. Subsequently, the encrypted image is generated via cascaded quaternion gyrator transforms with different rotation angles. The parameters in quaternion gyrator transforms and phases serve as encryption keys. By knowing these keys, the original color images can be fully restituted. Numerical simulations have demonstrated the validity of the proposed encryption system as well as its robustness against loss of data and additive Gaussian noise. PMID:24663832

  14. All-optical encryption based on interleaved waveband switching modulation for optical network security.

    PubMed

    Fok, Mable P; Prucnal, Paul R

    2009-05-01

    All-optical encryption for optical code-division multiple-access systems with interleaved waveband-switching modulation is experimentally demonstrated. The scheme explores dual-pump four-wave mixing in a 35 cm highly nonlinear bismuth oxide fiber to achieve XOR operation of the plaintext and the encryption key. Bit 0 and bit 1 of the encrypted data are represented by two different wavebands. Unlike on-off keying encryption methods, the encrypted data in this approach has the same intensity for both bit 0 and bit 1. Thus no plaintext or ciphertext signatures are observed. PMID:19412257

  15. An arbitrated quantum signature protocol based on the chained CNOT operations encryption

    NASA Astrophysics Data System (ADS)

    Li, Feng-Guang; Shi, Jian-Hong

    2015-06-01

    At present, the encryption scheme used by most arbitrated quantum signature (AQS) protocols is quantum one-time pad (QOTP) which encrypts data qubit by qubit. Though QOTP can achieve high security for data encryption, it is not suitable for AQS. There are many attacks on AQS using QOTP. In this paper, we propose an AQS protocol based on another encryption scheme called the chained CNOT operations, which encrypts quantum message ensemble. Our protocol preserves all merits in the similar AQS schemes and has better security. Security analysis shows that our protocol cannot be forged and disavowed under the existing attacks.

  16. An Identity-Based (IDB) Broadcast Encryption Scheme with Personalized Messages (BEPM)

    PubMed Central

    Xu, Ke; Liao, Yongjian; Qiao, Li

    2015-01-01

    A broadcast encryption scheme with personalized messages (BEPM) is a scheme in which a broadcaster transmits not only encrypted broadcast messages to a subset of recipients but also encrypted personalized messages to each user individually. Several broadcast encryption (BE) schemes allow a broadcaster encrypts a message for a subset S of recipients with public keys and any user in S can decrypt the message with his/her private key. However, these BE schemes can not provide an efficient way to transmit encrypted personalized messages to each user individually. In this paper, we propose a broadcast encryption scheme with a transmission of personalized messages. Besides, the scheme is based on multilinear maps ensure constant ciphertext size and private key size of each user and the scheme can achieve statically security. More realistically, the scheme can be applied to the Conditional Access System (CAS) of pay television (pay-TV) efficiently and safely. PMID:26629817

  17. An Identity-Based (IDB) Broadcast Encryption Scheme with Personalized Messages (BEPM).

    PubMed

    Xu, Ke; Liao, Yongjian; Qiao, Li; Liu, Zhangyun; Yang, Xiaowei

    2015-01-01

    A broadcast encryption scheme with personalized messages (BEPM) is a scheme in which a broadcaster transmits not only encrypted broadcast messages to a subset of recipients but also encrypted personalized messages to each user individually. Several broadcast encryption (BE) schemes allow a broadcaster encrypts a message for a subset S of recipients with public keys and any user in S can decrypt the message with his/her private key. However, these BE schemes can not provide an efficient way to transmit encrypted personalized messages to each user individually. In this paper, we propose a broadcast encryption scheme with a transmission of personalized messages. Besides, the scheme is based on multilinear maps ensure constant ciphertext size and private key size of each user and the scheme can achieve statically security. More realistically, the scheme can be applied to the Conditional Access System (CAS) of pay television (pay-TV) efficiently and safely. PMID:26629817

  18. Portable RSA encryption-decryption subprogram for protecting proprietary text

    SciTech Connect

    Hanson, R.J.

    1981-09-01

    A virtually portable (FORTRAN) version of the RSA (Rivest, Shamir, Adleman) algorithm for encryption and decryption of proprietary text has been written. This system uses three previously developed software packages. These are an extended precision integer arithmetic package, an error processing package, and machine-sensitive input/output subprograms from the Text Exchange System.

  19. Masking property of quantum random cipher with phase mask encryption

    NASA Astrophysics Data System (ADS)

    Sohma, Masaki; Hirota, Osamu

    2014-10-01

    The security analysis of physical encryption protocol based on coherent pulse position modulation (CPPM) originated by Yuen is one of the most interesting topics in the study of cryptosystem with a security level beyond the Shannon limit. Although the implementation of CPPM scheme has certain difficulty, several methods have been proposed recently. This paper deals with the CPPM encryption in terms of symplectic transformation, which includes a phase mask encryption as a special example, and formulates a unified security analysis for such encryption schemes. Specifically, we give a lower bound of Eve's symbol error probability using reliability function theory to ensure that our proposed system exceeds the Shannon limit. Then we assume the secret key is given to Eve after her heterodyne measurement. Since this assumption means that Eve has a great advantage in the sense of the conventional cryptography, the lower bound of her error indeed ensures the security level beyond the Shannon limit. In addition, we show some numerical examples of the security performance.

  20. Experimental protocol for packaging and encrypting multiple data

    NASA Astrophysics Data System (ADS)

    Fredy Barrera, John; Trejos, Sorayda; Tebaldi, Myrian; Torroba, Roberto

    2013-05-01

    We present a novel single optical packaging and encryption (SOPE) procedure for multiple inputs. This procedure is based on a merging of a 2f scheme with a digital holographic technique to achieve efficient handling of multiple data. Through the 2f system with a random phase mask attached in its input plane, and the holographic technique, we obtain each processed input. A posteriori filtering and repositioning protocol on each hologram followed by an addition of all processed data, allows storing these data to form a single package. The final package is digitally multiplied by a second random phase mask acting as an encryption mask. In this way, the final user receives only one encrypted information unit and a single key, instead of a conventional multiple-image collecting method and several keys. Processing of individual images is cast into an optimization problem. The proposed optimization aims to simplify the handling and recovery of images while packing all of them into a single unit. The decoding process does not have the usual cross-talk or noise problems involved in other methods, as filtering and repositioning precedes the encryption step. All data are recovered in just one step at the same time by applying a simple Fourier transform operation and the decoding key. The proposed protocol takes advantage of optical processing and the versatility of the digital format. Experiments have been conducted using a Mach-Zehnder interferometer. An application is subsequently demonstrated to illustrate the feasibility of the SOPE procedure.

  1. Query-Biased Preview over Outsourced and Encrypted Data

    PubMed Central

    Luo, Guangchun; Qin, Ke; Chen, Aiguo

    2013-01-01

    For both convenience and security, more and more users encrypt their sensitive data before outsourcing it to a third party such as cloud storage service. However, searching for the desired documents becomes problematic since it is costly to download and decrypt each possibly needed document to check if it contains the desired content. An informative query-biased preview feature, as applied in modern search engine, could help the users to learn about the content without downloading the entire document. However, when the data are encrypted, securely extracting a keyword-in-context snippet from the data as a preview becomes a challenge. Based on private information retrieval protocol and the core concept of searchable encryption, we propose a single-server and two-round solution to securely obtain a query-biased snippet over the encrypted data from the server. We achieve this novel result by making a document (plaintext) previewable under any cryptosystem and constructing a secure index to support dynamic computation for a best matched snippet when queried by some keywords. For each document, the scheme has O(d) storage complexity and O(log(d/s) + s + d/s) communication complexity, where d is the document size and s is the snippet length. PMID:24078798

  2. Helping Students Adapt to Computer-Based Encrypted Examinations

    ERIC Educational Resources Information Center

    Baker-Eveleth, Lori; Eveleth, Daniel M.; O'Neill, Michele; Stone, Robert W.

    2006-01-01

    The College of Business and Economics at the University of Idaho conducted a pilot study that used commercially available encryption software called Securexam to deliver computer-based examinations. A multi-step implementation procedure was developed, implemented, and then evaluated on the basis of what students viewed as valuable. Two key aspects…

  3. 15 CFR Supplement No. 5 to Part 742 - Encryption Registration

    Code of Federal Regulations, 2014 CFR

    2014-01-01

    .../WLAN (iv) Satellite (v) Radios (vi) Mobile communications, n.e.s. (b) Mobile applications (c) Computing... storage (m) Gaming (n) Cryptanalytic tools (o) “Open cryptographic interface” (or other support for user... body. (If unsure, please explain.) (5) Will your company be exporting “encryption source code”? (6)...

  4. Image encryption using the two-dimensional logistic chaotic map

    NASA Astrophysics Data System (ADS)

    Wu, Yue; Yang, Gelan; Jin, Huixia; Noonan, Joseph P.

    2012-01-01

    Chaos maps and chaotic systems have been proved to be useful and effective for cryptography. In our study, the two-dimensional logistic map with complicated basin structures and attractors are first used for image encryption. The proposed method adopts the classic framework of the permutation-substitution network in cryptography and thus ensures both confusion and diffusion properties for a secure cipher. The proposed method is able to encrypt an intelligible image into a random-like one from the statistical point of view and the human visual system point of view. Extensive simulation results using test images from the USC-SIPI image database demonstrate the effectiveness and robustness of the proposed method. Security analysis results of using both the conventional and the most recent tests show that the encryption quality of the proposed method reaches or excels the current state-of-the-art methods. Similar encryption ideas can be applied to digital data in other formats (e.g., digital audio and video). We also publish the cipher MATLAB open-source-code under the web page https://sites.google.com/site/tuftsyuewu/source-code.

  5. Lithographically Encrypted Inverse Opals for Anti-Counterfeiting Applications.

    PubMed

    Heo, Yongjoon; Kang, Hyelim; Lee, Joon-Seok; Oh, You-Kwan; Kim, Shin-Hyun

    2016-07-01

    Colloidal photonic crystals possess inimitable optical properties of iridescent structural colors and unique spectral shape, which render them useful for security materials. This work reports a novel method to encrypt graphical and spectral codes in polymeric inverse opals to provide advanced security. To accomplish this, this study prepares lithographically featured micropatterns on the top surface of hydrophobic inverse opals, which serve as shadow masks against the surface modification of air cavities to achieve hydrophilicity. The resultant inverse opals allow rapid infiltration of aqueous solution into the hydrophilic cavities while retaining air in the hydrophobic cavities. Therefore, the structural color of inverse opals is regioselectively red-shifted, disclosing the encrypted graphical codes. The decoded inverse opals also deliver unique reflectance spectral codes originated from two distinct regions. The combinatorial code composed of graphical and optical codes is revealed only when the aqueous solution agreed in advance is used for decoding. In addition, the encrypted inverse opals are chemically stable, providing invariant codes with high reproducibility. In addition, high mechanical stability enables the transfer of the films onto any surfaces. This novel encryption technology will provide a new opportunity in a wide range of security applications. PMID:27259060

  6. Selectively Encrypted Pull-Up Based Watermarking of Biometric data

    NASA Astrophysics Data System (ADS)

    Shinde, S. A.; Patel, Kushal S.

    2012-10-01

    Biometric authentication systems are becoming increasingly popular due to their potential usage in information security. However, digital biometric data (e.g. thumb impression) are themselves vulnerable to security attacks. There are various methods are available to secure biometric data. In biometric watermarking the data are embedded in an image container and are only retrieved if the secrete key is available. This container image is encrypted to have more security against the attack. As wireless devices are equipped with battery as their power supply, they have limited computational capabilities; therefore to reduce energy consumption we use the method of selective encryption of container image. The bit pull-up-based biometric watermarking scheme is based on amplitude modulation and bit priority which reduces the retrieval error rate to great extent. By using selective Encryption mechanism we expect more efficiency in time at the time of encryption as well as decryption. Significant reduction in error rate is expected to be achieved by the bit pull-up method.

  7. Quantum Encryption Protocol Based on Continuous Variable EPR Correlations

    NASA Astrophysics Data System (ADS)

    He, Guang-Qiang; Zeng, Gui-Hua

    2006-07-01

    A quantum encryption protocol based on Gaussian-modulated continuous variable EPR correlations is proposed. The security is guaranteed by continuous variable EPR entanglement correlations produced by nondegenerate optical parametric amplifier (NOPA). For general beam splitter eavesdropping strategy, the mutual information I(α,epsilon) between Alice and Eve is calculated by employing Shannon information theory. Finally the security analysis is presented.

  8. Progressive compressive imager

    NASA Astrophysics Data System (ADS)

    Evladov, Sergei; Levi, Ofer; Stern, Adrian

    2012-06-01

    We have designed and built a working automatic progressive sampling imaging system based on the vector sensor concept, which utilizes a unique sampling scheme of Radon projections. This sampling scheme makes it possible to progressively add information resulting in tradeoff between compression and the quality of reconstruction. The uniqueness of our sampling is that in any moment of the acquisition process the reconstruction can produce a reasonable version of the image. The advantage of the gradual addition of the samples is seen when the sparsity rate of the object is unknown, and thus the number of needed measurements. We have developed the iterative algorithm OSO (Ordered Sets Optimization) which employs our sampling scheme for creation of nearly uniform distributed sets of samples, which allows the reconstruction of Mega-Pixel images. We present the good quality reconstruction from compressed data ratios of 1:20.

  9. Compressible halftoning

    NASA Astrophysics Data System (ADS)

    Anderson, Peter G.; Liu, Changmeng

    2003-01-01

    We present a technique for converting continuous gray-scale images to halftone (black and white) images that lend themselves to lossless data compression with compression factor of three or better. Our method involves using novel halftone mask structures which consist of non-repeated threshold values. We have versions of both dispersed-dot and clustered-dot masks, which produce acceptable images for a variety of printers. Using the masks as a sort key allows us to reversibly rearrange the image pixels and partition them into groups with a highly skewed distribution allowing Huffman compression coding techniques to be applied. This gives compression ratios in the range 3:1 to 10:1.

  10. Fast Video Encryption Using the H.264 Error Propagation Property for Smart Mobile Devices

    PubMed Central

    Chung, Yongwha; Lee, Sungju; Jeon, Taewoong; Park, Daihee

    2015-01-01

    In transmitting video data securely over Video Sensor Networks (VSNs), since mobile handheld devices have limited resources in terms of processor clock speed and battery size, it is necessary to develop an efficient method to encrypt video data to meet the increasing demand for secure connections. Selective encryption methods can reduce the amount of computation needed while satisfying high-level security requirements. This is achieved by selecting an important part of the video data and encrypting it. In this paper, to ensure format compliance and security, we propose a special encryption method for H.264, which encrypts only the DC/ACs of I-macroblocks and the motion vectors of P-macroblocks. In particular, the proposed new selective encryption method exploits the error propagation property in an H.264 decoder and improves the collective performance by analyzing the tradeoff between the visual security level and the processing speed compared to typical selective encryption methods (i.e., I-frame, P-frame encryption, and combined I-/P-frame encryption). Experimental results show that the proposed method can significantly reduce the encryption workload without any significant degradation of visual security. PMID:25850068

  11. Quantitative security evaluation of optical encryption using hybrid phase- and amplitude-modulated keys.

    PubMed

    Sarkadi, Tamás; Koppa, Pál

    2012-02-20

    In the increasing number of system approaches published in the field of optical encryption, the security level of the system is evaluated by qualitative and empirical methods. To quantify the security of the optical system, we propose to use the equivalent of the key length routinely used in algorithmic encryption. We provide a calculation method of the number of independent keys and deduce the binary key length for optical data encryption. We then investigate and optimize the key length of the combined phase- and amplitude-modulated key encryption in the holographic storage environment, which is one of the promising solutions for the security enhancement of single- and double-random phase-encoding encryption and storage systems. We show that a substantial growth of the key length can be achieved by optimized phase and amplitude modulation compared to phase-only encryption. We also provide experimental confirmation of the model results. PMID:22358164

  12. Fresnel domain double-phase encoding encryption of color image via ptychography

    NASA Astrophysics Data System (ADS)

    Qiao, Liang; Wang, Yali; Li, Tuo; Shi, Yishi

    2015-10-01

    In this paper, color image encryption combined with ptychography has been investigated. Ptychographic imaging possesses a remarkable advantage of simple optics architecture and complex amplitude of object can be reconstructed just by a series of diffraction intensity patterns via aperture movement. Traditional technique of three primary color synthesis is applied for encrypting color image. In order to reduce physical limitations, the encryption's algorithm is based on Fresnel transformation domain. It is illustrated that the proposed optical encryption scheme has well ability to recover the encrypted color plaintext and advances in security enhancement thanks to introducing ptychography, since light probe as key factor enlarges the key space. Finally, the encryption's immunity to noise and reconstruction impact from lateral offset of probe has been investigated.

  13. Triple image encryption scheme in fractional Fourier transform domains

    NASA Astrophysics Data System (ADS)

    Liu, Zhengjun; Dai, Jingmin; Sun, Xiaogang; Liu, Shutian

    2009-02-01

    We proposed a triple image encryption scheme by use of fractional Fourier transform. In this algorithm, an original image is encoded in amplitude part and other two images are encoded into phase information. The key of encryption algorithm is obtained from the difference between the third image and the output phase of transform. In general case, random phase encoding technology is not required in the proposed algorithm. Moreover, all information of images is preserved in theory when image are decrypted with correct key. The optical implementation of the algorithm is presented with an electro-optical hybrid structure. Numerical simulations have demonstrated the efficiency and the security of this algorithm. Based on this scheme a multiple image algorithm is expanded and designed.

  14. Efficient multiparty quantum key agreement protocol based on commutative encryption

    NASA Astrophysics Data System (ADS)

    Sun, Zhiwei; Huang, Jiwu; Wang, Ping

    2016-05-01

    A secure multiparty quantum key agreement protocol using single-qubit states is proposed. The agreement key is computed by performing exclusive-OR operation on all the participants' secret keys. Based on the commutative property of the commutative encryption, the exclusive-OR operation can be performed on the plaintext in the encrypted state without decrypting it. Thus, it not only protects the final shared key, but also reduces the complexity of the computation. The efficiency of the proposed protocol, compared with previous multiparty QKA protocols, is also improved. In the presented protocol, entanglement states, joint measurement and even the unitary operations are not needed, and only rotation operations and single-state measurement are required, which are easier to be realized with current technology.

  15. Experimental color encryption in a joint transform correlator architecture

    NASA Astrophysics Data System (ADS)

    Tebaldi, Myrian; Horrillo, Sergi; Pérez-Cabré, Elisabet; Millán, María S.; Amaya, Dafne; Torroba, Roberto; Bolognini, Néstor

    2011-01-01

    We present an experimental color image encryption by using a photorefractive crystal and a joint transform correlator (JTC) architecture. We achieve the color storing by changing the illumination wavelength. One JTC aperture has the input image information corresponding to a determined color channel bonded to a random phase mask (object aperture), and the other JTC aperture contains the key code mask. The joint power spectrum is stored in a photorefractive crystal. Each color data is stored as a modulation of birefringence in this photosensitive medium. The adequate wavelength change produces a corresponding power spectrum modification that avoids image encryption cross talk in the read out step. An analysis in terms of the sensitivity of the photorefractive silenite crystal for different recording wavelengths is carried out. It should be highlighted that the multiplexed power spectrum shows neither the multiplexing operation nor the amount of stored information increasing the system security. We present experimental results that support our approach

  16. Novel implementation of memristive systems for data encryption and obfuscation

    NASA Astrophysics Data System (ADS)

    Du, Nan; Manjunath, Niveditha; Shuai, Yao; Bürger, Danilo; Skorupa, Ilona; Schüffny, René; Mayr, Christian; Basov, Dimitri N.; Di Ventra, Massimiliano; Schmidt, Oliver G.; Schmidt, Heidemarie

    2014-03-01

    With the rise of big data handling, new solutions are required to drive cryptographic algorithms for maintaining data security. Here, we exploit the nonvolatile, nonlinear resistance change in BiFeO3 memristors [Shuai et al., J. Appl. Phys. 109, 124117 (2011)] by applying a voltage for the generation of second and higher harmonics and develop a new memristor-based encoding system from it to encrypt and obfuscate data. It is found that a BiFeO3 memristor in high and low resistance state can be used to generate two clearly distinguishable sets of second and higher harmonics as recently predicted theoretically [Cohen et al., Appl. Phys. Lett. 100, 133109 (2012)]. The computed autocorrelation of encrypted data using higher harmonics generated by a BiFeO3 memristor shows that the encoded data distribute randomly.

  17. Digital information encrypted in an image using binary encoding

    NASA Astrophysics Data System (ADS)

    Lin, Kuang Tsan

    2008-07-01

    This paper proposes a new type of encoding methods to encrypt hidden (covert) information in host images. The encrypted information can be plot, fax, word, or network data, and it must be encoded with binary codes. All the pixels in an encoded (overt) image modulated from a host image are classified into three groups. The first group of pixels is called identification codes, used to judge whether the overt image is encoded by a method proposed in this paper or not. The second group of pixels is called type codes, used to judge the encoding type. The third group of pixels is called information codes, used to decode the encoded information. Applying the proposed encoding methods is quite convenient, and host images are not needed for decoding. Decoding covert information from overt images is rather difficult for un-authorized persons, whereas it is very easy for designers or authorized persons. Therefore, the proposed methods are very useful.

  18. Implementing Improved Security and Encryption for Balloon Flight Systems

    NASA Astrophysics Data System (ADS)

    Denney, Andrew; Stilwell, Bryan D.

    The Columbia Scientific Balloon Facility uses a broad array of communication techniques be-tween its balloon-borne flight systems and ground command and control systems. These com-munication mediums vary from commercially available routing such as e-mail and IP based TCP/UDP protocols to military grade proprietary line-of-sight configurations; each with their own unique benefits and shortfalls. While each new advancement in technology improves secu-rity in some capacity, it does not always address the limitation of older, less advanced security or encryption capabilities. As the proliferation of newer, more commercially viable technologies become common place, safeguarding mission critical applications from unauthorized access and improve data integrity in the process becomes ever more necessary. Therefore, this paper will evaluate several security measures and methods of data encryption; including formalizing a standardized security philosophy that improves and addresses the mixture of established and emerging technologies.

  19. Iterative phase retrieval algorithms. Part II: Attacking optical encryption systems.

    PubMed

    Guo, Changliang; Liu, Shi; Sheridan, John T

    2015-05-20

    The modified iterative phase retrieval algorithms developed in Part I [Guo et al., Appl. Opt.54, 4698 (2015)] are applied to perform known plaintext and ciphertext attacks on amplitude encoding and phase encoding Fourier-transform-based double random phase encryption (DRPE) systems. It is shown that the new algorithms can retrieve the two random phase keys (RPKs) perfectly. The performances of the algorithms are tested by using the retrieved RPKs to decrypt a set of different ciphertexts encrypted using the same RPKs. Significantly, it is also shown that the DRPE system is, under certain conditions, vulnerable to ciphertext-only attack, i.e., in some cases an attacker can decrypt DRPE data successfully when only the ciphertext is intercepted. PMID:26192505

  20. An improved piecewise linear chaotic map based image encryption algorithm.

    PubMed

    Hu, Yuping; Zhu, Congxu; Wang, Zhijian

    2014-01-01

    An image encryption algorithm based on improved piecewise linear chaotic map (MPWLCM) model was proposed. The algorithm uses the MPWLCM to permute and diffuse plain image simultaneously. Due to the sensitivity to initial key values, system parameters, and ergodicity in chaotic system, two pseudorandom sequences are designed and used in the processes of permutation and diffusion. The order of processing pixels is not in accordance with the index of pixels, but it is from beginning or end alternately. The cipher feedback was introduced in diffusion process. Test results and security analysis show that not only the scheme can achieve good encryption results but also its key space is large enough to resist against brute attack. PMID:24592159

  1. Multiple-image encryption using spectral cropping and spatial multiplexing

    NASA Astrophysics Data System (ADS)

    Deng, Pingke; Diao, Ming; Shan, Mingguang; Zhong, Zhi; Zhang, Yabin

    2016-01-01

    A multiple-image encryption scheme is proposed using spectral cropping and space multiplexing based on discrete multiple-parameter fractional Fourier transform (DMPFRFT). Spectrum of each original image is firstly cropped by a low-pass filter, and the image is then recovered with the same size of the filter. The recovered images are spatially shifted and multiplexed into a complex signal with the same size of original image. The complex signal is multiplied by a pixel scrambling operation and random phase mask, and then encrypted into one image by DMPFRFT. The multiplexing images can be retrieved with correct keys, and the original images can be then obtained by enlarging the demultiplexing images. Numerical simulations have been done to demonstrate the validity and the security of the proposed method.

  2. An Improved Piecewise Linear Chaotic Map Based Image Encryption Algorithm

    PubMed Central

    Hu, Yuping; Wang, Zhijian

    2014-01-01

    An image encryption algorithm based on improved piecewise linear chaotic map (MPWLCM) model was proposed. The algorithm uses the MPWLCM to permute and diffuse plain image simultaneously. Due to the sensitivity to initial key values, system parameters, and ergodicity in chaotic system, two pseudorandom sequences are designed and used in the processes of permutation and diffusion. The order of processing pixels is not in accordance with the index of pixels, but it is from beginning or end alternately. The cipher feedback was introduced in diffusion process. Test results and security analysis show that not only the scheme can achieve good encryption results but also its key space is large enough to resist against brute attack. PMID:24592159

  3. Color image encryption scheme using CML and DNA sequence operations.

    PubMed

    Wang, Xing-Yuan; Zhang, Hui-Li; Bao, Xue-Mei

    2016-06-01

    In this paper, an encryption algorithm for color images using chaotic system and DNA (Deoxyribonucleic acid) sequence operations is proposed. Three components for the color plain image is employed to construct a matrix, then perform confusion operation on the pixels matrix generated by the spatiotemporal chaos system, i.e., CML (coupled map lattice). DNA encoding rules, and decoding rules are introduced in the permutation phase. The extended Hamming distance is proposed to generate new initial values for CML iteration combining color plain image. Permute the rows and columns of the DNA matrix and then get the color cipher image from this matrix. Theoretical analysis and experimental results prove the cryptosystem secure and practical, and it is suitable for encrypting color images of any size. PMID:27026385

  4. Report on the Development of the Advanced Encryption Standard (AES).

    PubMed

    Nechvatal, J; Barker, E; Bassham, L; Burr, W; Dworkin, M; Foti, J; Roback, E

    2001-01-01

    In 1997, the National Institute of Standards and Technology (NIST) initiated a process to select a symmetric-key encryption algorithm to be used to protect sensitive (unclassified) Federal information in furtherance of NIST's statutory responsibilities. In 1998, NIST announced the acceptance of 15 candidate algorithms and requested the assistance of the cryptographic research community in analyzing the candidates. This analysis included an initial examination of the security and efficiency characteristics for each algorithm. NIST reviewed the results of this preliminary research and selected MARS, RC™, Rijndael, Serpent and Twofish as finalists. Having reviewed further public analysis of the finalists, NIST has decided to propose Rijndael as the Advanced Encryption Standard (AES). The research results and rationale for this selection are documented in this report. PMID:27500035

  5. Report on the Development of the Advanced Encryption Standard (AES)

    PubMed Central

    Nechvatal, James; Barker, Elaine; Bassham, Lawrence; Burr, William; Dworkin, Morris; Foti, James; Roback, Edward

    2001-01-01

    In 1997, the National Institute of Standards and Technology (NIST) initiated a process to select a symmetric-key encryption algorithm to be used to protect sensitive (unclassified) Federal information in furtherance of NIST’s statutory responsibilities. In 1998, NIST announced the acceptance of 15 candidate algorithms and requested the assistance of the cryptographic research community in analyzing the candidates. This analysis included an initial examination of the security and efficiency characteristics for each algorithm. NIST reviewed the results of this preliminary research and selected MARS, RC™, Rijndael, Serpent and Twofish as finalists. Having reviewed further public analysis of the finalists, NIST has decided to propose Rijndael as the Advanced Encryption Standard (AES). The research results and rationale for this selection are documented in this report.

  6. Data encryption standard ASIC design and development report.

    SciTech Connect

    Robertson, Perry J.; Pierson, Lyndon George; Witzke, Edward L.

    2003-10-01

    This document describes the design, fabrication, and testing of the SNL Data Encryption Standard (DES) ASIC. This device was fabricated in Sandia's Microelectronics Development Laboratory using 0.6 {micro}m CMOS technology. The SNL DES ASIC was modeled using VHDL, then simulated, and synthesized using Synopsys, Inc. software and finally IC layout was performed using Compass Design Automation's CAE tools. IC testing was performed by Sandia's Microelectronic Validation Department using a HP 82000 computer aided test system. The device is a single integrated circuit, pipelined realization of DES encryption and decryption capable of throughputs greater than 6.5 Gb/s. Several enhancements accommodate ATM or IP network operation and performance scaling. This design is the latest step in the evolution of DES modules.

  7. A technique for image encryption using digital signature

    NASA Astrophysics Data System (ADS)

    Sinha, Aloka; Singh, Kehar

    2003-04-01

    We propose a new technique to encrypt an image for secure image transmission. The digital signature of the original image is added to the encoded version of the original image. The encoding of the image is done using an appropriate error control code, such as a Bose-Chaudhuri Hochquenghem (BCH) code. At the receiver end, after the decryption of the image, the digital signature can be used to verify the authenticity of the image. Detailed simulations have been carried out to test the encryption technique. An optical correlator, in either the JTC or the VanderLugt geometry, or a digital correlation technique, can be used to verify the authenticity of the decrypted image.

  8. Video Compression

    NASA Technical Reports Server (NTRS)

    1996-01-01

    Optivision developed two PC-compatible boards and associated software under a Goddard Space Flight Center Small Business Innovation Research grant for NASA applications in areas such as telerobotics, telesciences and spaceborne experimentation. From this technology, the company used its own funds to develop commercial products, the OPTIVideo MPEG Encoder and Decoder, which are used for realtime video compression and decompression. They are used in commercial applications including interactive video databases and video transmission. The encoder converts video source material to a compressed digital form that can be stored or transmitted, and the decoder decompresses bit streams to provide high quality playback.

  9. On applying molecular computation to the data encryption standard.

    PubMed

    Adleman, L M; Rothemund, P W; Roweis, S; Winfree, E

    1999-01-01

    Recently, Boneh, Dunworth, and Lipton (1996) described the potential use of molecular computation in attacking the United States Data Encryption Standard (DES). Here, we provide a description of such an attack using the sticker model of molecular computation. Our analysis suggests that such an attack might be mounted on a tabletop machine using approximately a gram of DNA and might succeed even in the presence of a large number of errors. PMID:10223664

  10. A New Multisignature Scheme Using Re-Encryption Technique

    NASA Astrophysics Data System (ADS)

    Aboud, Sattar J.; Al-Fayoumi, Mohammed A.

    Anew multisignature scheme using re-encryption technique based on the RSA algorithm is suggested what enhance version of Okamoto scheme. The suggested scheme results bit expansion in block length of the multisignature, but the bit size of the expansion is not larger than the number of signers irrespective of their modulus. In addition, the new scheme has no limitations in signing order and in fact is more efficient than the Okamoto scheme.

  11. TEM Video Compressive Sensing

    SciTech Connect

    Stevens, Andrew J.; Kovarik, Libor; Abellan, Patricia; Yuan, Xin; Carin, Lawrence; Browning, Nigel D.

    2015-08-02

    One of the main limitations of imaging at high spatial and temporal resolution during in-situ TEM experiments is the frame rate of the camera being used to image the dynamic process. While the recent development of direct detectors has provided the hardware to achieve frame rates approaching 0.1ms, the cameras are expensive and must replace existing detectors. In this paper, we examine the use of coded aperture compressive sensing methods [1, 2, 3, 4] to increase the framerate of any camera with simple, low-cost hardware modifications. The coded aperture approach allows multiple sub-frames to be coded and integrated into a single camera frame during the acquisition process, and then extracted upon readout using statistical compressive sensing inversion. Our simulations show that it should be possible to increase the speed of any camera by at least an order of magnitude. Compressive Sensing (CS) combines sensing and compression in one operation, and thus provides an approach that could further improve the temporal resolution while correspondingly reducing the electron dose rate. Because the signal is measured in a compressive manner, fewer total measurements are required. When applied to TEM video capture, compressive imaging couled improve acquisition speed and reduce the electron dose rate. CS is a recent concept, and has come to the forefront due the seminal work of Candès [5]. Since the publication of Candès, there has been enormous growth in the application of CS and development of CS variants. For electron microscopy applications, the concept of CS has also been recently applied to electron tomography [6], and reduction of electron dose in scanning transmission electron microscopy (STEM) imaging [7]. To demonstrate the applicability of coded aperture CS video reconstruction for atomic level imaging, we simulate compressive sensing on observations of Pd nanoparticles and Ag nanoparticles during exposure to high temperatures and other environmental

  12. Butterfly Encryption Scheme for Resource-Constrained Wireless Networks †

    PubMed Central

    Sampangi, Raghav V.; Sampalli, Srinivas

    2015-01-01

    Resource-constrained wireless networks are emerging networks such as Radio Frequency Identification (RFID) and Wireless Body Area Networks (WBAN) that might have restrictions on the available resources and the computations that can be performed. These emerging technologies are increasing in popularity, particularly in defence, anti-counterfeiting, logistics and medical applications, and in consumer applications with growing popularity of the Internet of Things. With communication over wireless channels, it is essential to focus attention on securing data. In this paper, we present an encryption scheme called Butterfly encryption scheme. We first discuss a seed update mechanism for pseudorandom number generators (PRNG), and employ this technique to generate keys and authentication parameters for resource-constrained wireless networks. Our scheme is lightweight, as in it requires less resource when implemented and offers high security through increased unpredictability, owing to continuously changing parameters. Our work focuses on accomplishing high security through simplicity and reuse. We evaluate our encryption scheme using simulation, key similarity assessment, key sequence randomness assessment, protocol analysis and security analysis. PMID:26389899

  13. Fault tolerant channel-encrypting quantum dialogue against collective noise

    NASA Astrophysics Data System (ADS)

    Ye, TianYu

    2015-04-01

    In this paper, two fault tolerant channel-encrypting quantum dialogue (QD) protocols against collective noise are presented. One is against collective-dephasing noise, while the other is against collective-rotation noise. The decoherent-free states, each of which is composed of two physical qubits, act as traveling states combating collective noise. Einstein-Podolsky-Rosen pairs, which play the role of private quantum key, are securely shared between two participants over a collective-noise channel in advance. Through encryption and decryption with private quantum key, the initial state of each traveling two-photon logical qubit is privately shared between two participants. Due to quantum encryption sharing of the initial state of each traveling logical qubit, the issue of information leakage is overcome. The private quantum key can be repeatedly used after rotation as long as the rotation angle is properly chosen, making quantum resource economized. As a result, their information-theoretical efficiency is nearly up to 66.7%. The proposed QD protocols only need single-photon measurements rather than two-photon joint measurements for quantum measurements. Security analysis shows that an eavesdropper cannot obtain anything useful about secret messages during the dialogue process without being discovered. Furthermore, the proposed QD protocols can be implemented with current techniques in experiment.

  14. A fast chaotic block cipher for image encryption

    NASA Astrophysics Data System (ADS)

    Armand Eyebe Fouda, J. S.; Yves Effa, J.; Sabat, Samrat L.; Ali, Maaruf

    2014-03-01

    Image encryption schemes based on chaos usually involve real number arithmetic operations to generate the chaotic orbits from the chaotic system. These operations are time-consuming and are normally performed with high-end processors. To overcome this drawback, this paper proposes a one round encryption scheme for the fast generation of large permutation and diffusion keys based on the sorting of the solutions of the Linear Diophantine Equation (LDE) whose coefficients are integers and dynamically generated from any type of chaotic systems. The high security and low computational complexity are achieved not only by using large permutation based on the sorting of the solutions of LDE but also by generating only one permutation from the sorting of the solutions of the LDE, then by dynamically updating d number of integers (d>2) in the permutation. The performance of the proposed scheme is evaluated using various types of analysis such as entropy analysis, difference analysis, statistical analysis, key sensitivity analysis, key space analysis and speed analysis. The experimental results indicate that the proposed algorithm is secure and fast as compared to the two round encryption scheme.

  15. A novel stream encryption scheme with avalanche effect

    NASA Astrophysics Data System (ADS)

    Min, Lequan; Chen, Guanrong

    2013-11-01

    This paper proposes a novel stream encryption scheme with avalanche effect (SESAE). Using this scheme and an ideal pseudorandom number generator (PRNG) to generate d-bit segment binary key streams, one can encrypt a plaintext such that by using any key stream generated from a different seed to decrypt the ciphertext, the decrypted plaintext will become an avalanche-like text which has 2 d - 1 consecutive one's with a high probability. As a cost, the required bits of the ciphertext are d times those of the plaintext. A corresponding avalanche-type encryption theorem is established. Two chaotic 12-bit segment PRNGs are designed. A generalized FIPS140 test and SESAE test for the two chaotic PRNGs, RC4 12-bit segment PRNG and 12-bit segment Matlab PRNG are implemented. The SESAE tests for 16-bit segment PRNGs are also compared. The results suggest that those PRNGs are able to generate the SESAEs which are similar to those generated via ideal PRNGs.

  16. Key management and encryption under the bounded storage model.

    SciTech Connect

    Draelos, Timothy John; Neumann, William Douglas; Lanzone, Andrew J.; Anderson, William Erik

    2005-11-01

    There are several engineering obstacles that need to be solved before key management and encryption under the bounded storage model can be realized. One of the critical obstacles hindering its adoption is the construction of a scheme that achieves reliable communication in the event that timing synchronization errors occur. One of the main accomplishments of this project was the development of a new scheme that solves this problem. We show in general that there exist message encoding techniques under the bounded storage model that provide an arbitrarily small probability of transmission error. We compute the maximum capacity of this channel using the unsynchronized key-expansion as side-channel information at the decoder and provide tight lower bounds for a particular class of key-expansion functions that are pseudo-invariant to timing errors. Using our results in combination with Dziembowski et al. [11] encryption scheme we can construct a scheme that solves the timing synchronization error problem. In addition to this work we conducted a detailed case study of current and future storage technologies. We analyzed the cost, capacity, and storage data rate of various technologies, so that precise security parameters can be developed for bounded storage encryption schemes. This will provide an invaluable tool for developing these schemes in practice.

  17. Nonlinear Delayed Differential Dynamics for Encryption Using Chaos

    NASA Astrophysics Data System (ADS)

    Larger, Laurent; Goedgebuer, Jean-Pierre; Lee, Min Won

    2003-08-01

    Nonlinear time-delayed differential dynamics are knowing an increasing interest, especially in the area of encryption using chaos. Such dynamics are also met in many other fields, such as mechanics, biology, medicine and optics. In the frame of high dimensional chaotic encryption systems, we have explored several nonlinear oscillators in optics and electronics ruled by nonlinear delayed (or difference) differential equations. After a presentation of the general architecture of such systems, we describe four different experimental set-ups, which are operating respectively with the wavelength of a tunable laser diode, the optical intensity at the output of an integrated electro-optic Mach-Zehnder, the optical path-difference in a coherence modulation scheme, and the electronic frequency at the output of a voltage-controlled oscillator. Numerical bifurcation diagrams are compared with experimental ones, and various dynamical properties are discussed, such as entropy, Lyapunov dimension, time behavior statistics, and spectral properties. Recent developments are also discussed in the view of improving the performances of chaos generators in encryption systems.

  18. Experimental QR code optical encryption: noise-free data recovering.

    PubMed

    Barrera, John Fredy; Mira-Agudelo, Alejandro; Torroba, Roberto

    2014-05-15

    We report, to our knowledge for the first time, the experimental implementation of a quick response (QR) code as a "container" in an optical encryption system. A joint transform correlator architecture in an interferometric configuration is chosen as the experimental scheme. As the implementation is not possible in a single step, a multiplexing procedure to encrypt the QR code of the original information is applied. Once the QR code is correctly decrypted, the speckle noise present in the recovered QR code is eliminated by a simple digital procedure. Finally, the original information is retrieved completely free of any kind of degradation after reading the QR code. Additionally, we propose and implement a new protocol in which the reception of the encrypted QR code and its decryption, the digital block processing, and the reading of the decrypted QR code are performed employing only one device (smartphone, tablet, or computer). The overall method probes to produce an outcome far more attractive to make the adoption of the technique a plausible option. Experimental results are presented to demonstrate the practicality of the proposed security system. PMID:24978277

  19. Butterfly Encryption Scheme for Resource-Constrained Wireless Networks.

    PubMed

    Sampangi, Raghav V; Sampalli, Srinivas

    2015-01-01

    Resource-constrained wireless networks are emerging networks such as Radio Frequency Identification (RFID) and Wireless Body Area Networks (WBAN) that might have restrictions on the available resources and the computations that can be performed. These emerging technologies are increasing in popularity, particularly in defence, anti-counterfeiting, logistics and medical applications, and in consumer applications with growing popularity of the Internet of Things. With communication over wireless channels, it is essential to focus attention on securing data. In this paper, we present an encryption scheme called Butterfly encryption scheme. We first discuss a seed update mechanism for pseudorandom number generators (PRNG), and employ this technique to generate keys and authentication parameters for resource-constrained wireless networks. Our scheme is lightweight, as in it requires less resource when implemented and offers high security through increased unpredictability, owing to continuously changing parameters. Our work focuses on accomplishing high security through simplicity and reuse. We evaluate our encryption scheme using simulation, key similarity assessment, key sequence randomness assessment, protocol analysis and security analysis. PMID:26389899

  20. An Integrated Signaling-Encryption Mechanism to Reduce Error Propagation in Wireless Communications: Performance Analyses

    SciTech Connect

    Olama, Mohammed M; Matalgah, Mustafa M; Bobrek, Miljko

    2015-01-01

    Traditional encryption techniques require packet overhead, produce processing time delay, and suffer from severe quality of service deterioration due to fades and interference in wireless channels. These issues reduce the effective transmission data rate (throughput) considerably in wireless communications, where data rate with limited bandwidth is the main constraint. In this paper, performance evaluation analyses are conducted for an integrated signaling-encryption mechanism that is secure and enables improved throughput and probability of bit-error in wireless channels. This mechanism eliminates the drawbacks stated herein by encrypting only a small portion of an entire transmitted frame, while the rest is not subject to traditional encryption but goes through a signaling process (designed transformation) with the plaintext of the portion selected for encryption. We also propose to incorporate error correction coding solely on the small encrypted portion of the data to drastically improve the overall bit-error rate performance while not noticeably increasing the required bit-rate. We focus on validating the signaling-encryption mechanism utilizing Hamming and convolutional error correction coding by conducting an end-to-end system-level simulation-based study. The average probability of bit-error and throughput of the encryption mechanism are evaluated over standard Gaussian and Rayleigh fading-type channels and compared to the ones of the conventional advanced encryption standard (AES).

  1. Known-plaintext attack on a joint transform correlator encrypting system.

    PubMed

    Barrera, John Fredy; Vargas, Carlos; Tebaldi, Myrian; Torroba, Roberto; Bolognini, Nestor

    2010-11-01

    We demonstrate in this Letter that a joint transform correlator shows vulnerability to known-plaintext attacks. An unauthorized user, who intercepts both an object and its encrypted version, can obtain the security key code mask. In this contribution, we conduct a hybrid heuristic attack scheme merge to a Gerchberg-Saxton routine to estimate the encrypting key to decode different ciphertexts encrypted with that same key. We also analyze the success of this attack for different pairs of plaintext-ciphertext used to get the encrypting code. We present simulation results for the decrypting procedure to demonstrate the validity of our analysis. PMID:21042347

  2. A novel color image encryption scheme using alternate chaotic mapping structure

    NASA Astrophysics Data System (ADS)

    Wang, Xingyuan; Zhao, Yuanyuan; Zhang, Huili; Guo, Kang

    2016-07-01

    This paper proposes an color image encryption algorithm using alternate chaotic mapping structure. Initially, we use the R, G and B components to form a matrix. Then one-dimension logistic and two-dimension logistic mapping is used to generate a chaotic matrix, then iterate two chaotic mappings alternately to permute the matrix. For every iteration, XOR operation is adopted to encrypt plain-image matrix, then make further transformation to diffuse the matrix. At last, the encrypted color image is obtained from the confused matrix. Theoretical analysis and experimental results has proved the cryptosystem is secure and practical, and it is suitable for encrypting color images.

  3. Chaos-based image encryption using a hybrid genetic algorithm and a DNA sequence

    NASA Astrophysics Data System (ADS)

    Enayatifar, Rasul; Abdullah, Abdul Hanan; Isnin, Ismail Fauzi

    2014-05-01

    The paper studies a recently developed evolutionary-based image encryption algorithm. A novel image encryption algorithm based on a hybrid model of deoxyribonucleic acid (DNA) masking, a genetic algorithm (GA) and a logistic map is proposed. This study uses DNA and logistic map functions to create the number of initial DNA masks and applies GA to determine the best mask for encryption. The significant advantage of this approach is improving the quality of DNA masks to obtain the best mask that is compatible with plain images. The experimental results and computer simulations both confirm that the proposed scheme not only demonstrates excellent encryption but also resists various typical attacks.

  4. Layered Multicast Encryption of Motion JPEG2000 Code Streams for Flexible Access Control

    NASA Astrophysics Data System (ADS)

    Nakachi, Takayuki; Toyoshima, Kan; Tonomura, Yoshihide; Fujii, Tatsuya

    In this paper, we propose a layered multicast encryption scheme that provides flexible access control to motion JPEG2000 code streams. JPEG2000 generates layered code streams and offers flexible scalability in characteristics such as resolution and SNR. The layered multicast encryption proposal allows a sender to multicast the encrypted JPEG2000 code streams such that only designated groups of users can decrypt the layered code streams. While keeping the layering functionality, the proposed method offers useful properties such as 1) video quality control using only one private key, 2) guaranteed security, and 3) low computational complexity comparable to conventional non-layered encryption. Simulation results show the usefulness of the proposed method.

  5. [Compression material].

    PubMed

    Perceau, Géraldine; Faure, Christine

    2012-01-01

    The compression of a venous ulcer is carried out with the use of bandages, and for less exudative ulcers, with socks, stockings or tights. The system of bandages is complex. Different forms of extension and therefore different types of models exist. PMID:22489428

  6. SNLL materials testing compression facility

    SciTech Connect

    Kawahara, W.A.; Brandon, S.L.; Korellis, J.S.

    1986-04-01

    This report explains software enhancements and fixture modifications which expand the capabilities of a servo-hydraulic test system to include static computer-controlled ''constant true strain rate'' compression testing on cylindrical specimens. True strains in excess of -1.0 are accessible. Special software features include schemes to correct for system compliance and the ability to perform strain-rate changes; all software for test control and data acquisition/reduction is documented.

  7. Compressed Genotyping

    PubMed Central

    Erlich, Yaniv; Gordon, Assaf; Brand, Michael; Hannon, Gregory J.; Mitra, Partha P.

    2011-01-01

    Over the past three decades we have steadily increased our knowledge on the genetic basis of many severe disorders. Nevertheless, there are still great challenges in applying this knowledge routinely in the clinic, mainly due to the relatively tedious and expensive process of genotyping. Since the genetic variations that underlie the disorders are relatively rare in the population, they can be thought of as a sparse signal. Using methods and ideas from compressed sensing and group testing, we have developed a cost-effective genotyping protocol to detect carriers for severe genetic disorders. In particular, we have adapted our scheme to a recently developed class of high throughput DNA sequencing technologies. The mathematical framework presented here has some important distinctions from the ’traditional’ compressed sensing and group testing frameworks in order to address biological and technical constraints of our setting. PMID:21451737

  8. Spread spectrum image data hiding in the encrypted discrete cosine transform coefficients

    NASA Astrophysics Data System (ADS)

    Zhang, Xiaoqiang; Wang, Z. Jane

    2013-10-01

    Digital watermarking and data hiding are important tools for digital rights protection of media data. Spread spectrum (SS)-based watermarking and data-hiding approaches are popular due to their outstanding robustness, but their security might not be sufficient. To improve the security of SS, a SS-based image data-hiding approach is proposed by encrypting the discrete cosine transform coefficients of the host image with the piecewise linear chaotic map, before the operation of watermark embedding. To evaluate the performance of the proposed approach, simulations and analyses of its robustness and security are carried out. The average bit-error-rate values on 100 real images from the Berkeley segmentation dataset under the JPEG compression, additive Gaussian noise, salt and pepper noise, and cropping attacks are reported. Experimental results show that the proposed approach can maintain the high robustness of traditional SS schemes and, meanwhile, also improve the security. The proposed approach can extend the key space of traditional SS schemes from 10 to 10 and thus can resist brute-force attack and unauthorized detection watermark attack.

  9. An Anti-Cheating Visual Cryptography Scheme Based on Chaotic Encryption System

    NASA Astrophysics Data System (ADS)

    Han, Yanyan; Xu, Zhuolin; Ge, Xiaonan; He, Wencai

    By chaotic encryption system and introducing the trusted third party (TTP), in this paper, an anti-cheating visual cryptography scheme (VCS) is proposed. The scheme solved the problem of dishonest participants and improved the security of chaotic encryption system. Simulation results and analysis show that the recovery image is acceptable, the system can detect the cheating in participants effectively and with high security.

  10. Chosen-plaintext attack on a joint transform correlator encrypting system

    NASA Astrophysics Data System (ADS)

    Barrera, John Fredy; Vargas, Carlos; Tebaldi, Myrian; Torroba, Roberto

    2010-10-01

    We demonstrate that optical encryption methods based on the joint transform correlator architecture are vulnerable to chosen-plaintext attack. An unauthorized user, who introduces three chosen plaintexts in the accessible encryption machine, can obtain the security key code mask. In this contribution, we also propose an alternative method to eliminate ambiguities that allows obtaining the right decrypting key.

  11. 15 CFR 748.3 - Classification requests, advisory opinions, and encryption registrations.

    Code of Federal Regulations, 2013 CFR

    2013-01-01

    ... 15 CFR 734.3). (d) Classification requests and encryption registration for encryption items. A... 15 CFR 734.3). (c) Advisory Opinions. Advisory opinion requests must be in writing and be submitted.... Munitions List consistent with Executive Order 13026 of November 15, 1996 (3 CFR, 1996 Comp., p. 228)...

  12. 15 CFR 748.3 - Classification requests, advisory opinions, and encryption registrations.

    Code of Federal Regulations, 2012 CFR

    2012-01-01

    ... 15 CFR 734.3). (d) Classification requests and encryption registration for encryption items. A... 15 CFR 734.3). (c) Advisory Opinions. Advisory opinion requests must be in writing and be submitted.... Munitions List consistent with Executive Order 13026 of November 15, 1996 (3 CFR, 1996 Comp., p. 228)...

  13. 15 CFR 748.3 - Classification requests, advisory opinions, and encryption registrations.

    Code of Federal Regulations, 2011 CFR

    2011-01-01

    ... 15 CFR 734.3). (d) Classification requests and encryption registration for encryption items. A... 15 CFR 734.3). (c) Advisory Opinions. Advisory opinion requests must be in writing and be submitted.... Munitions List consistent with Executive Order 13026 of November 15, 1996 (3 CFR, 1996 Comp., p. 228)...

  14. 15 CFR 740.17 - Encryption commodities, software and technology (ENC).

    Code of Federal Regulations, 2011 CFR

    2011-01-01

    ... quantum cryptography, as defined in ECCN 5A002 of the Commerce Control List; (E) Encryption commodities..., that provide or perform vulnerability analysis, network forensics, or computer forensics functions... laptop computer that without encryption would be classified under ECCN 4A994, and the Category 5, part...

  15. Single-intensity-recording optical encryption technique based on phase retrieval algorithm and QR code

    NASA Astrophysics Data System (ADS)

    Wang, Zhi-peng; Zhang, Shuai; Liu, Hong-zhao; Qin, Yi

    2014-12-01

    Based on phase retrieval algorithm and QR code, a new optical encryption technology that only needs to record one intensity distribution is proposed. In this encryption process, firstly, the QR code is generated from the information to be encrypted; and then the generated QR code is placed in the input plane of 4-f system to have a double random phase encryption. For only one intensity distribution in the output plane is recorded as the ciphertext, the encryption process is greatly simplified. In the decryption process, the corresponding QR code is retrieved using phase retrieval algorithm. A priori information about QR code is used as support constraint in the input plane, which helps solve the stagnation problem. The original information can be recovered without distortion by scanning the QR code. The encryption process can be implemented either optically or digitally, and the decryption process uses digital method. In addition, the security of the proposed optical encryption technology is analyzed. Theoretical analysis and computer simulations show that this optical encryption system is invulnerable to various attacks, and suitable for harsh transmission conditions.

  16. 15 CFR 740.17 - Encryption commodities, software and technology (ENC).

    Code of Federal Regulations, 2013 CFR

    2013-01-01

    ... 15 Commerce and Foreign Trade 2 2013-01-01 2013-01-01 false Encryption commodities, software and... REGULATIONS LICENSE EXCEPTIONS § 740.17 Encryption commodities, software and technology (ENC). License... therefor classified under ECCN 5B002, and equivalent or related software and technology classified...

  17. 15 CFR 740.17 - Encryption commodities, software and technology (ENC).

    Code of Federal Regulations, 2014 CFR

    2014-01-01

    ... 15 Commerce and Foreign Trade 2 2014-01-01 2014-01-01 false Encryption commodities, software and... REGULATIONS LICENSE EXCEPTIONS § 740.17 Encryption commodities, software and technology (ENC). License... therefor classified under ECCN 5B002, and equivalent or related software and technology classified...

  18. 15 CFR 740.17 - Encryption commodities, software and technology (ENC).

    Code of Federal Regulations, 2012 CFR

    2012-01-01

    ... 15 Commerce and Foreign Trade 2 2012-01-01 2012-01-01 false Encryption commodities, software and... REGULATIONS LICENSE EXCEPTIONS § 740.17 Encryption commodities, software and technology (ENC). License... therefor classified under ECCN 5B002, and equivalent or related software and technology classified...

  19. 15 CFR 748.3 - Classification requests, advisory opinions, and encryption registrations.

    Code of Federal Regulations, 2014 CFR

    2014-01-01

    ... 15 CFR 734.3). (c) Advisory Opinions. Advisory opinion requests must be in writing and be submitted... 15 CFR 734.3). (d) Classification requests and encryption registration for encryption items. A.... Munitions List consistent with Executive Order 13026 of November 15, 1996 (3 CFR, 1996 Comp., p. 228)...

  20. Acquisition strategies

    SciTech Connect

    Zimmer, M.J.; Lynch, P.W. )

    1993-11-01

    Acquiring projects takes careful planning, research and consideration. Picking the right opportunities and avoiding the pitfalls will lead to a more valuable portfolio. This article describes the steps to take in evaluating an acquisition and what items need to be considered in an evaluation.

  1. Counteractive functions are encrypted in the residues of CD154.

    PubMed

    Bandyopadhyay, Syamdas; Chandel, Himanshu Singh; Singh, Shailza; Roy, Somenath; Krishnasastry, M V; Saha, Bhaskar

    2015-09-01

    CD40, as a single receptor that binds CD154 (CD40-ligand or CD40L), regulates counteractive effector functions such as production of pro- and anti-inflammatory cytokines. Therefore, we examined whether such dual messages are encrypted in CD40L. As such message encryption was never investigated, we hypothesized that mutation of certain amino acid residues should in principle enhance pro-inflammatory cytokine production whereas mutation of some others would enhance anti-inflammatory cytokine secretion. We mutated six such residues, which were previously showed to participate in CD40L function. Here, we report that the mutant CD154 129E→V was superior to the wild-type CD154 in killing of Leishmania donovani, induction of inducible nitric oxide synthase (iNOS) and production of IL-12 and relative phosphorylation of p38MAPK and ERK-1/2 in PBMC-derived macrophages. By contrast, 128S→V promoted L. donovani survival, reducing iNOS, but increasing IL-10 expression and predominant ERK-1/2 phosphorylation. The mutant 144G→V did not have significant effects. Other mutants (142E→V, 143K→A, 145Y→F) mimicked the wild-type CD154. Molecular dynamics simulation suggested that these mutations induced differential conformational changes in the CD40-CD154 complex. Therefore, assortment of the contrasting messages encrypted in a given ligand performing counteractive functions presents a novel fundamental biological principle that can be used for devising various therapies. PMID:26429321

  2. Encrypted imaging based on algebraic implementation of double random phase encoding.

    PubMed

    Nakano, Kazuya; Takeda, Masafumi; Suzuki, Hiroyuki; Yamaguchi, Masahiro

    2014-05-10

    The security of important information captured by sensors and cameras is currently a growing concern as information theft via techniques such as side-channel attacks become increasingly more prevalent. Double random phase encoding (DRPE) is an optical encryption method based on optical Fourier transform that is currently being used to implement secure coherent optical systems. In this paper, we propose a new DRPE implementation for incoherent optical systems based on integral photography that can be applied to "encrypted imaging (EI)" to optically encrypt an image before it is captured by an image sensor. Because the proposed incoherent DRPE is constituted from conventional DRPE by rewriting the optical encryption via discretization and Euler's formula, its security level is the same as that of conventional DRPE. The results of an experiment in which we encrypted a plaintext image optically and then decrypted it numerically demonstrate that our proposed incoherent optical security system is feasible. PMID:24922013

  3. A novel hybrid color image encryption algorithm using two complex chaotic systems

    NASA Astrophysics Data System (ADS)

    Wang, Leyuan; Song, Hongjun; Liu, Ping

    2016-02-01

    Based on complex Chen and complex Lorenz systems, a novel color image encryption algorithm is proposed. The larger chaotic ranges and more complex behaviors of complex chaotic systems, which compared with real chaotic systems could additionally enhance the security and enlarge key space of color image encryption. The encryption algorithm is comprised of three step processes. In the permutation process, the pixels of plain image are scrambled via two-dimensional and one-dimensional permutation processes among RGB channels individually. In the diffusion process, the exclusive-or (XOR for short) operation is employed to conceal pixels information. Finally, the mixing RGB channels are used to achieve a multilevel encryption. The security analysis and experimental simulations demonstrate that the proposed algorithm is large enough to resist the brute-force attack and has excellent encryption performance.

  4. The effect of algorithm-agile encryption on ATM quality of service

    SciTech Connect

    Sholander, P.; Tarman, T.; Pierson, L.; Hutchinson, R.

    1997-04-01

    Asynchronous Transfer Mode (ATM) users often open multiple ATM Virtual Circuits (VCs) to multiple ATM users on multiple ATM networks. Each network and user may implement a different encryption policy. Hence ATM users may need shared, flexible hardware-based 3encryption that supports multiple encryption algorithms for multiple concurrent ATM users and VCs. An algorithm-agile encryption architecture, that uses multiple, parallel encryption-pipelines, is proposed. That algorithm-agile encryptor`s effect on the ATM Quality of Service (QoS) metrics, such as Cell Transfer Delay (CTD) and Cell Delay Variation (CDV), is analyzed. Bounds on the maximum CDV and the CDV`s probability density are derived.

  5. Wavelength multiplexing encryption using joint transform correlator architecture.

    PubMed

    Amaya, Dafne; Tebaldi, Myrian; Torroba, Roberto; Bolognini, Néstor

    2009-04-10

    We show that multiple secure data recording under a wavelength multiplexing technique is possible in a joint transform correlator (JTC) arrangement. We evaluate both the performance of the decrypting procedure and the influence of the input image size when decrypting with a wavelength different from that employed in the encryption step. This analysis reveals that the wavelength is a valid parameter to conduct image multiplexing encoding with the JTC architecture. In addition, we study the influence of the minimum wavelength change that prevents decoding cross talk. Computer simulations confirm the performance of the proposed technique. PMID:19363548

  6. Multichanneled encryption via a joint transform correlator architecture.

    PubMed

    Amaya, Dafne; Tebaldi, Myrian; Torroba, Roberto; Bolognini, Néstor

    2008-11-01

    We propose a multichanneling encryption method by using multiple random-phase mask apertures in the input plane based on a joint transform correlation scheme. In the proposal, this multiple aperture arrangement is changed as different input objects are inserted and stored. Then, during the decryption step, the appropriate use of the random-phase mask apertures can ensure the retrieval of different information. This approach provides different access levels. Computer simulations show the potential of the technique and experimental results verify the feasibility of this method. PMID:19122732

  7. Scalable end-to-end ATM encryption test results

    SciTech Connect

    Pierson, L.G.

    1995-10-01

    Customers of Asynchronous Transfer Mode (ATM) services may need a variety of data authenticity and privacy assurances. Cryptographic methods can be used to assure authenticity and privacy, but are hard to scale for implementation at high speed. The incorporation of these methods into computer networks can severely impact functionality, reliability, and performance. To study these trade-offs, a prototype encryptor/decryptor was developed. This effort demonstrated the viability of implementing certain encryption techniques in high speed networks. The research prototype processes ATM cells in a SONET OC-3 payload. This paper describes the functionality, reliability, security, and performance design trade-offs investigated with the prototype.

  8. VIRTEX-5 Fpga Implementation of Advanced Encryption Standard Algorithm

    NASA Astrophysics Data System (ADS)

    Rais, Muhammad H.; Qasim, Syed M.

    2010-06-01

    In this paper, we present an implementation of Advanced Encryption Standard (AES) cryptographic algorithm using state-of-the-art Virtex-5 Field Programmable Gate Array (FPGA). The design is coded in Very High Speed Integrated Circuit Hardware Description Language (VHDL). Timing simulation is performed to verify the functionality of the designed circuit. Performance evaluation is also done in terms of throughput and area. The design implemented on Virtex-5 (XC5VLX50FFG676-3) FPGA achieves a maximum throughput of 4.34 Gbps utilizing a total of 399 slices.

  9. A time-variant approach for encrypted digital communications

    NASA Astrophysics Data System (ADS)

    Ng, Wai-Hung

    Two new approaches, a time-variant key and a random transmission rate, are introduced to strengthen the security of encrypted digital communications in which a 'black-box' type of crypto-device is employed. These approaches not only further upgrade present cryto-methodology, but may also secure the system against the possibility of the crytographic key's falling into the hands of an unauthorized listener after initial communication has begun. Therefore, communication privacy could be maintained even under the most scrutinizing postrecorded ciphertext attack.

  10. Chaos-based encryption for fractal image coding

    NASA Astrophysics Data System (ADS)

    Yuen, Ching-Hung; Wong, Kwok-Wo

    2012-01-01

    A chaos-based cryptosystem for fractal image coding is proposed. The Rényi chaotic map is employed to determine the order of processing the range blocks and to generate the keystream for masking the encoded sequence. Compared with the standard approach of fractal image coding followed by the Advanced Encryption Standard, our scheme offers a higher sensitivity to both plaintext and ciphertext at a comparable operating efficiency. The keystream generated by the Rényi chaotic map passes the randomness tests set by the United States National Institute of Standards and Technology, and so the proposed scheme is sensitive to the key.

  11. Encryption Devices for Use in a Conditional Access System

    NASA Astrophysics Data System (ADS)

    Pinder, Howard G.; Palgon, Michael S.

    2002-07-01

    A cable television system provides conditional access to services. The cable television system includes a headend from which service 'instances', or programs, are broadcast and a plurality of set top units for receiving the instances and selectively decrypting the instances for display to system subscribers. The service instances are encrypted using public and/or private keys provided by service providers or central authorization agents. Keys used by the set tops for selective decryption may also be public or private in nature, and such keys may be reassigned at different times to provide a cable television system in which piracy concerns are minimized.

  12. Wavelet Multifractal Detrended Fluctuation Analysis of Encryption and Decryption Matrices

    NASA Astrophysics Data System (ADS)

    Murguía, J. S.; Mejía Carlos, M.; Vargas-Olmos, C.; Ramírez-Torres, M. T.; Rosu, H. C.

    2013-09-01

    In this paper, we study in detail the multifractal features of the main matrices of an encryption system based on a rule-90 cellular automaton. For this purpose, we consider the scaling method known as the wavelet transform multifractal detrended fluctuation analysis (WT-MFDFA). In addition, we analyze the multifractal structure of the matrices of different dimensions, and find that there are minimal differences in all the examined multifractal quantities such as the multifractal support, the most frequent singularity exponent, and the generalized Hurst exponent.

  13. A Novel ECG Data Compression Method Using Adaptive Fourier Decomposition With Security Guarantee in e-Health Applications.

    PubMed

    Ma, JiaLi; Zhang, TanTan; Dong, MingChui

    2015-05-01

    This paper presents a novel electrocardiogram (ECG) compression method for e-health applications by adapting an adaptive Fourier decomposition (AFD) algorithm hybridized with a symbol substitution (SS) technique. The compression consists of two stages: first stage AFD executes efficient lossy compression with high fidelity; second stage SS performs lossless compression enhancement and built-in data encryption, which is pivotal for e-health. Validated with 48 ECG records from MIT-BIH arrhythmia benchmark database, the proposed method achieves averaged compression ratio (CR) of 17.6-44.5 and percentage root mean square difference (PRD) of 0.8-2.0% with a highly linear and robust PRD-CR relationship, pushing forward the compression performance to an unexploited region. As such, this paper provides an attractive candidate of ECG compression method for pervasive e-health applications. PMID:25222961

  14. Compressive Network Analysis

    PubMed Central

    Jiang, Xiaoye; Yao, Yuan; Liu, Han; Guibas, Leonidas

    2014-01-01

    Modern data acquisition routinely produces massive amounts of network data. Though many methods and models have been proposed to analyze such data, the research of network data is largely disconnected with the classical theory of statistical learning and signal processing. In this paper, we present a new framework for modeling network data, which connects two seemingly different areas: network data analysis and compressed sensing. From a nonparametric perspective, we model an observed network using a large dictionary. In particular, we consider the network clique detection problem and show connections between our formulation with a new algebraic tool, namely Randon basis pursuit in homogeneous spaces. Such a connection allows us to identify rigorous recovery conditions for clique detection problems. Though this paper is mainly conceptual, we also develop practical approximation algorithms for solving empirical problems and demonstrate their usefulness on real-world datasets. PMID:25620806

  15. Compression and venous ulcers.

    PubMed

    Stücker, M; Link, K; Reich-Schupke, S; Altmeyer, P; Doerler, M

    2013-03-01

    Compression therapy is considered to be the most important conservative treatment of venous leg ulcers. Until a few years ago, compression bandages were regarded as first-line therapy of venous leg ulcers. However, to date medical compression stockings are the first choice of treatment. With respect to compression therapy of venous leg ulcers the following statements are widely accepted: 1. Compression improves the healing of ulcers when compared with no compression; 2. Multicomponent compression systems are more effective than single-component compression systems; 3. High compression is more effective than lower compression; 4. Medical compression stockings are more effective than compression with short stretch bandages. Healed venous leg ulcers show a high relapse rate without ongoing treatment. The use of medical stockings significantly reduces the amount of recurrent ulcers. Furthermore, the relapse rate of venous leg ulcers can be significantly reduced by a combination of compression therapy and surgery of varicose veins compared with compression therapy alone. PMID:23482538

  16. Visible encryption: using paper as a secure channel

    NASA Astrophysics Data System (ADS)

    Degara-Quintela, Norberto; Perez-Gonzalez, Fernando

    2003-06-01

    A novel technique allowing secure transmission/storage of electronic documents in printed form is described. First, given a document to protect, an error resilient "visibly encrypted" version is printed. Later, when the original document is to be recovered, the system scans the "visibly encrypted" document and decrypts it after asking for a secret key. Unfortunately, one faces the problem that when a document is printed and scanned, the rescanned document may look similar to the original, but will be distorted during the process. Therefore, to ensure reliable and high rate transmission over the print-and-scan channel it is essential a judicious theoretical model for characterizing the problem and providing reliable communications schemes. The proposed method is based on Pulse Amplitude Modulation (PAM), using small square-shaped pulses and a Maximum Likelihood (ML) detector that is derived after estimating the distortions introduced by the print-and-scan channel. Furthermore, it is essential to employ synchronization techniques to correctly demodulate the printed pulses. In our case, we use an adaptive scheme that resembles the well-known phase locked loops (PLL's). Finally, we will discuss schemes that can make the bit stream resilient to transmissions errors and how to combine them with cryptographic algorithms in order to produce a secure system.

  17. 'Yeast mail': a novel Saccharomyces application (NSA) to encrypt messages.

    PubMed

    Rosemeyer, Helmut; Paululat, Achim; Heinisch, Jürgen J

    2014-09-01

    The universal genetic code is used by all life forms to encode biological information. It can also be used to encrypt semantic messages and convey them within organisms without anyone but the sender and recipient knowing, i.e., as a means of steganography. Several theoretical, but comparatively few experimental, approaches have been dedicated to this subject, so far. Here, we describe an experimental system to stably integrate encrypted messages within the yeast genome using a polymerase chain reaction (PCR)-based, one-step homologous recombination system. Thus, DNA sequences encoding alphabetical and/or numerical information will be inherited by yeast propagation and can be sent in the form of dried yeast. Moreover, due to the availability of triple shuttle vectors, Saccharomyces cerevisiae can also be used as an intermediate construction device for transfer of information to either Drosophila or mammalian cells as steganographic containers. Besides its classical use in alcoholic fermentation and its modern use for heterologous gene expression, we here show that baker's yeast can thus be employed in a novel Saccharomyces application (NSA) as a simple steganographic container to hide and convey messages. PMID:25238077

  18. A novel chaotic image encryption scheme using DNA sequence operations

    NASA Astrophysics Data System (ADS)

    Wang, Xing-Yuan; Zhang, Ying-Qian; Bao, Xue-Mei

    2015-10-01

    In this paper, we propose a novel image encryption scheme based on DNA (Deoxyribonucleic acid) sequence operations and chaotic system. Firstly, we perform bitwise exclusive OR operation on the pixels of the plain image using the pseudorandom sequences produced by the spatiotemporal chaos system, i.e., CML (coupled map lattice). Secondly, a DNA matrix is obtained by encoding the confused image using a kind of DNA encoding rule. Then we generate the new initial conditions of the CML according to this DNA matrix and the previous initial conditions, which can make the encryption result closely depend on every pixel of the plain image. Thirdly, the rows and columns of the DNA matrix are permuted. Then, the permuted DNA matrix is confused once again. At last, after decoding the confused DNA matrix using a kind of DNA decoding rule, we obtain the ciphered image. Experimental results and theoretical analysis show that the scheme is able to resist various attacks, so it has extraordinarily high security.

  19. Design of high-encryption wireless network with distributed host management and dynamic key generation

    NASA Astrophysics Data System (ADS)

    Weber, Robert E.

    2001-11-01

    The widespread deployment of wireless networks using the 802.11(b) standard across the country presents a rebirth of age-old network security problems along with a number of new ones. The wireless network, much like a shared network using broadcast devices such as network hubs, travels across a shared medium. Because of the structure any member of the wireless network can observe and intercept data being sent or received by other members. Unlike 'wired' networks there is no means to isolate traffic from other network members. The second security issue for wireless networks is the transmission of data 'clear text' so that if it is intercepted it can be read and used. Wireless networks bring about another problem that compounds the first two concerns that all shared networks must deal with, that is, anyone within the transmission range of the wireless network can join. No longer must a person enter a building to infiltrate a business network, they need only park across the street. The first implementation of network security for wireless was the WEP (Wired Equivalent Privacy) protocol. WEP attempts to make a wireless network at least as secure as a switched 'wired' network. The WEP protocol intends to secure the traffic integrity with the use of a RC4 cipher and a CSC-32 checksum. In the passphrase used for the RC4 encryption is also used as a form of access control. There are several critical faults in the WEP implementation that allow both passive data acquisition and active data modification. At 11 Mbit, capturing approximately 5 hours of clear text data can guarantee the capture of two packets with the same initialization vector (IV). Once the packets are used to get the clear text packet, that information can be used to decrypt any packets with the same IV. Since the IV's are only 24 bits the decryption of entire network becomes only an exercise in patience, with a 24 hours of continuous monitoring the WEP encryption can be defeated completely and a simple

  20. Compressive beamforming.

    PubMed

    Xenaki, Angeliki; Gerstoft, Peter; Mosegaard, Klaus

    2014-07-01

    Sound source localization with sensor arrays involves the estimation of the direction-of-arrival (DOA) from a limited number of observations. Compressive sensing (CS) solves such underdetermined problems achieving sparsity, thus improved resolution, and can be solved efficiently with convex optimization. The DOA estimation problem is formulated in the CS framework and it is shown that CS has superior performance compared to traditional DOA estimation methods especially under challenging scenarios such as coherent arrivals and single-snapshot data. An offset and resolution analysis is performed to indicate the limitations of CS. It is shown that the limitations are related to the beampattern, thus can be predicted. The high-resolution capabilities and the robustness of CS are demonstrated on experimental array data from ocean acoustic measurements for source tracking with single-snapshot data. PMID:24993212

  1. Context adaptive binary arithmetic coding-based data hiding in partially encrypted H.264/AVC videos

    NASA Astrophysics Data System (ADS)

    Xu, Dawen; Wang, Rangding

    2015-05-01

    A scheme of data hiding directly in a partially encrypted version of H.264/AVC videos is proposed which includes three parts, i.e., selective encryption, data embedding and data extraction. Selective encryption is performed on context adaptive binary arithmetic coding (CABAC) bin-strings via stream ciphers. By careful selection of CABAC entropy coder syntax elements for selective encryption, the encrypted bitstream is format-compliant and has exactly the same bit rate. Then a data-hider embeds the additional data into partially encrypted H.264/AVC videos using a CABAC bin-string substitution technique without accessing the plaintext of the video content. Since bin-string substitution is carried out on those residual coefficients with approximately the same magnitude, the quality of the decrypted video is satisfactory. Video file size is strictly preserved even after data embedding. In order to adapt to different application scenarios, data extraction can be done either in the encrypted domain or in the decrypted domain. Experimental results have demonstrated the feasibility and efficiency of the proposed scheme.

  2. The Development of a Portable Hard Disk Encryption/Decryption System with a MEMS Coded Lock.

    PubMed

    Zhang, Weiping; Chen, Wenyuan; Tang, Jian; Xu, Peng; Li, Yibin; Li, Shengyong

    2009-01-01

    In this paper, a novel portable hard-disk encryption/decryption system with a MEMS coded lock is presented, which can authenticate the user and provide the key for the AES encryption/decryption module. The portable hard-disk encryption/decryption system is composed of the authentication module, the USB portable hard-disk interface card, the ATA protocol command decoder module, the data encryption/decryption module, the cipher key management module, the MEMS coded lock controlling circuit module, the MEMS coded lock and the hard disk. The ATA protocol circuit, the MEMS control circuit and AES encryption/decryption circuit are designed and realized by FPGA(Field Programmable Gate Array). The MEMS coded lock with two couplers and two groups of counter-meshing-gears (CMGs) are fabricated by a LIGA-like process and precision engineering method. The whole prototype was fabricated and tested. The test results show that the user's password could be correctly discriminated by the MEMS coded lock, and the AES encryption module could get the key from the MEMS coded lock. Moreover, the data in the hard-disk could be encrypted or decrypted, and the read-write speed of the dataflow could reach 17 MB/s in Ultra DMA mode. PMID:22291566

  3. Encrypting three-dimensional information system based on integral imaging and multiple chaotic maps

    NASA Astrophysics Data System (ADS)

    Xing, Yan; Wang, Qiong-Hua; Xiong, Zhao-Long; Deng, Huan

    2016-02-01

    An encrypting three-dimensional (3-D) information system based on integral imaging (II) and multiple chaotic maps is proposed. In the encrypting process, the elemental image array (EIA) which represents spatial and angular information of the real 3-D scene is picked up by a microlens array. Subsequently, R, G, and B color components decomposed by the EIA are encrypted using multiple chaotic maps. Finally, these three encrypted components are interwoven to obtain the cipher information. The decryption process implements the reverse operation of the encryption process for retrieving the high-quality 3-D images. Since the encrypted EIA has the data redundancy property due to II, and all parameters of the pickup part are the secret keys of the encrypting system, the system sensitivity on the changes of the plaintext and secret keys can be significantly improved. Moreover, the algorithm based on multiple chaotic maps can effectively enhance the security. A preliminary experiment is carried out, and the experimental results verify the effectiveness, robustness, and security of the proposed system.

  4. The research on image encryption method based on parasitic audio watermark

    NASA Astrophysics Data System (ADS)

    Gao, Pei-pei; Zhu, Yao-ting; Zhang, Shi-tao

    2010-11-01

    In order to improve image encryption strength, an image encryption method based on parasitic audio watermark was proposed in this paper, which relies on double messages such as image domain and speech domain to do image encryption protection. The method utilizes unique Chinese phonetics synthesis algorithm to complete audio synthesis with embedded text, then separate this sentence information into prosodic phrase, obtains complete element set of initial consonant and compound vowel that reflects audio feature of statement. By sampling and scrambling the initial consonant and compound vowel element, synthesizing them with image watermark, and embedding the compound into the image to be encrypted in frequency domain, the processed image contains image watermark information and parasitizes audio feature information. After watermark extraction, using the same phonetics synthesis algorithm the audio information is synthesized and compared with the original. Experiments show that any decryption method in image domain or speech domain could not break encryption protection and image gains higher encryption strength and security level by double encryption.

  5. Knowledge Acquisition for the Onboard Planner of an Autonomous Spacecraft

    NASA Technical Reports Server (NTRS)

    Muscettola, Nicola; Rajan, Kanna

    1997-01-01

    This paper discusses the knowledge acquisition issues involved in transitioning their novel technology in to space flight software, developing the planer in the context of a large software projet and completing the work under a compressed development schedule.

  6. Final Report for the Scaled Asynchronous Transfer Mode (ATM) Encryption Laboratory Directed Research and Development Project

    SciTech Connect

    Pierson, L.G.; Witzke, E.L.

    1999-01-01

    This effort studied the integration of innovative methods of key management crypto synchronization, and key agility while scaling encryption speed. Viability of these methods for encryption of ATM cell payloads at the SONET OC- 192 data rate (10 Gb/s), and for operation at OC-48 rates (2.5 Gb/s) was shown. An SNL-Developed pipelined DES design was adapted for the encryption of ATM cells. A proof-of-principle prototype circuit board containing 11 Electronically Programmable Logic Devices (each holding the equivalent of 100,000 gates) was designed, built, and used to prototype a high speed encryptor.

  7. Multiple-image encryption with bit-plane decomposition and chaotic maps

    NASA Astrophysics Data System (ADS)

    Tang, Zhenjun; Song, Juan; Zhang, Xianquan; Sun, Ronghai

    2016-05-01

    Image encryption is an efficient technique of image content protection. In this work, we propose a useful image encryption algorithm for multiple grayscale images. The proposed algorithm decomposes input images into bit-planes, randomly swaps bit-blocks among different bit-planes, and conducts XOR operation between the scrambled images and secret matrix controlled by chaotic map. Finally, an encrypted PNG image is obtained by viewing four scrambled grayscale images as its red, green, blue and alpha components. Many simulations are done to illustrate efficiency of our algorithm.

  8. Optical encryption/decryption of 8PSK signal using FWM-based modified XOR.

    PubMed

    Zhang, Min; Cui, Yue; Zhan, Yueying; Zhang, Zhiguo; Chen, Xue

    2015-09-01

    A scheme for optical encryption/decryption of an eight-phase-shift keying (8PSK) signal is proposed, and this scheme applies modified optical XOR gates based on four-wave mixing (FWM) in a semiconductor optical amplifier (SOA). Theoretical analyses and simulations are conducted. Both the performance and the parameter design of a 40-Gbit/s all-optical encryption/decryption system under various key parameters are studied. The results are useful for designing optical encryption/decryption for complex modulated signals. PMID:26368909

  9. Research on an E-mail Encryption Protocol Based on Quantum Teleportation

    NASA Astrophysics Data System (ADS)

    Shufen, Xiao; Yumin, Dong; Hongyang, Ma; Libo, Chen

    2016-07-01

    With the rapid development of information technology (IT), E-mail has become an important communication tool between human beings. Meanwhile, E-mail safety becomes increasingly important because of its universal applications. In order to overcome shortages of classical E-mail encryption, an E-mail encryption protocol based on quantum teleportation was proposed. It makes quantum encryption of E-mails during sending and receiving processes by taking advantages of entanglement and nonclonability of quantum, thus ensuring safety and reliability of E-mail transmission.

  10. A new image encryption algorithm based on logistic chaotic map with varying parameter.

    PubMed

    Liu, Lingfeng; Miao, Suoxia

    2016-01-01

    In this paper, we proposed a new image encryption algorithm based on parameter-varied logistic chaotic map and dynamical algorithm. The parameter-varied logistic map can cure the weaknesses of logistic map and resist the phase space reconstruction attack. We use the parameter-varied logistic map to shuffle the plain image, and then use a dynamical algorithm to encrypt the image. We carry out several experiments, including Histogram analysis, information entropy analysis, sensitivity analysis, key space analysis, correlation analysis and computational complexity to evaluate its performances. The experiment results show that this algorithm is with high security and can be competitive for image encryption. PMID:27066326

  11. Image encryption using chaotic coupled map lattices with time-varying delays

    NASA Astrophysics Data System (ADS)

    Tang, Yang; Wang, Zidong; Fang, Jian-an

    2010-09-01

    In this paper, a novel image encryption scheme using coupled map lattices (CML) with time delay is proposed. By employing discretized tent map to shuffle the positions of image pixels and then using delayed coupled map lattices (DCML) to confuse the relationship between the plain-image and the cipher-image, image encryption algorithms with permutation-diffusion structure are introduced in detail. In the process of generating keystream, the time-varying delay is also embedded in our proposed scheme to enhance the security. Theoretical analysis and computer experiments confirm that the new algorithm possesses high security for practical image encryption.

  12. Modeling of digital information optical encryption system with spatially incoherent illumination

    NASA Astrophysics Data System (ADS)

    Bondareva, Alyona P.; Cheremkhin, Pavel A.; Krasnov, Vitaly V.; Rodin, Vladislav G.; Starikov, Rostislav S.; Starikov, Sergey N.

    2015-10-01

    State of the art micromirror DMD spatial light modulators (SLM) offer unprecedented framerate up to 30000 frames per second. This, in conjunction with high speed digital camera, should allow to build high speed optical encryption system. Results of modeling of digital information optical encryption system with spatially incoherent illumination are presented. Input information is displayed with first SLM, encryption element - with second SLM. Factors taken into account are: resolution of SLMs and camera, holograms reconstruction noise, camera noise and signal sampling. Results of numerical simulation demonstrate high speed (several gigabytes per second), low bit error rate and high crypto-strength.

  13. Novel Public Key Encryption Technique Based on Multiple Chaotic Systems

    NASA Astrophysics Data System (ADS)

    Bose, Ranjan

    2005-08-01

    Public key encryption was first introduced by Diffie and Hellman in 1976. Since then, the Diffie-Hellman key exchange protocol has been used in developing public key systems such as Rivest-Shamir-Adleman and elliptic curve cryptography. Chaotic functions, so far, have been used for symmetric cryptography only. In this Letter we propose, for the first time, a methodology to use multiple chaotic systems and a set of linear functions for key exchange over an insecure channel. To the best of our knowledge, this is the first Letter that reports the use of chaotic systems for public key cryptography. We have shown that the security of the proposed algorithm grows as (NP)m, where N, P, and m are large numbers that can be chosen as the parameters of the cryptosystem.

  14. Novel public key encryption technique based on multiple chaotic systems.

    PubMed

    Bose, Ranjan

    2005-08-26

    Public key encryption was first introduced by Diffie and Hellman in 1976. Since then, the Diffie-Hellman key exchange protocol has been used in developing public key systems such as Rivest-Shamir-Adleman and elliptic curve cryptography. Chaotic functions, so far, have been used for symmetric cryptography only. In this Letter we propose, for the first time, a methodology to use multiple chaotic systems and a set of linear functions for key exchange over an insecure channel. To the best of our knowledge, this is the first Letter that reports the use of chaotic systems for public key cryptography. We have shown that the security of the proposed algorithm grows as (NP)(m), where N, P, and m are large numbers that can be chosen as the parameters of the cryptosystem. PMID:16197262

  15. Tunable solid-state fluorescent materials for supramolecular encryption

    NASA Astrophysics Data System (ADS)

    Hou, Xisen; Ke, Chenfeng; Bruns, Carson J.; McGonigal, Paul R.; Pettman, Roger B.; Stoddart, J. Fraser

    2015-04-01

    Tunable solid-state fluorescent materials are ideal for applications in security printing technologies. A document possesses a high level of security if its encrypted information can be authenticated without being decoded, while also being resistant to counterfeiting. Herein, we describe a heterorotaxane with tunable solid-state fluorescent emissions enabled through reversible manipulation of its aggregation by supramolecular encapsulation. The dynamic nature of this fluorescent material is based on a complex set of equilibria, whose fluorescence output depends non-linearly on the chemical inputs and the composition of the paper. By applying this system in fluorescent security inks, the information encoded in polychromic images can be protected in such a way that it is close to impossible to reverse engineer, as well as being easy to verify. This system constitutes a unique application of responsive complex equilibria in the form of a cryptographic algorithm that protects valuable information printed using tunable solid-state fluorescent materials.

  16. Tunable solid-state fluorescent materials for supramolecular encryption

    PubMed Central

    Hou, Xisen; Ke, Chenfeng; Bruns, Carson J.; McGonigal, Paul R.; Pettman, Roger B.; Stoddart, J. Fraser

    2015-01-01

    Tunable solid-state fluorescent materials are ideal for applications in security printing technologies. A document possesses a high level of security if its encrypted information can be authenticated without being decoded, while also being resistant to counterfeiting. Herein, we describe a heterorotaxane with tunable solid-state fluorescent emissions enabled through reversible manipulation of its aggregation by supramolecular encapsulation. The dynamic nature of this fluorescent material is based on a complex set of equilibria, whose fluorescence output depends non-linearly on the chemical inputs and the composition of the paper. By applying this system in fluorescent security inks, the information encoded in polychromic images can be protected in such a way that it is close to impossible to reverse engineer, as well as being easy to verify. This system constitutes a unique application of responsive complex equilibria in the form of a cryptographic algorithm that protects valuable information printed using tunable solid-state fluorescent materials. PMID:25901677

  17. Lessons learned: mobile device encryption in the academic medical center.

    PubMed

    Kusche, Kristopher P

    2009-01-01

    The academic medical center is faced with the unique challenge of meeting the multi-faceted needs of both a modern healthcare organization and an academic institution, The need for security to protect patient information must be balanced by the academic freedoms expected in the college setting. The Albany Medical Center, consisting of the Albany Medical College and the Albany Medical Center Hospital, was challenged with implementing a solution that would preserve the availability, integrity and confidentiality of business, patient and research data stored on mobile devices. To solve this problem, Albany Medical Center implemented a mobile encryption suite across the enterprise. Such an implementation comes with complexities, from performance across multiple generations of computers and operating systems, to diversity of application use mode and end user adoption, all of which requires thoughtful policy and standards creation, understanding of regulations, and a willingness and ability to work through such diverse needs. PMID:19382736

  18. Optical encryption in the longitudinal domain of focused fields.

    PubMed

    Carnicer, Artur; Juvells, Ignasi; Javidi, Bahram; Martínez-Herrero, Rosario

    2016-04-01

    We develop a method for encoding information in the longitudinal component of a focused field. Focused beams display a non-zero contribution of the electric field in the direction of propagation. However, the associated irradiance is very weak and difficult to isolate from the transverse part of the beam. For these reasons, the longitudinal component of a focused field could be a good choice for encoding and securing information. Using the Richards and Wolf formalism we show how to encrypt information in the longitudinal domain of the focal area. In addition, we use quantum imaging techniques to enhance the security and to prevent unauthorized access to the information. To the best of our knowledge, this is the first report on using the longitudinal component of the focused fields in optical security. PMID:27136978

  19. Molecular encryption and reconfiguration for remodeling of dynamic hydrogels.

    PubMed

    Li, Shihui; Gaddes, Erin R; Chen, Niancao; Wang, Yong

    2015-05-11

    Dynamic materials have been widely studied for regulation of cell adhesion that is important to a variety of biological and biomedical applications. These materials can undergo changes mainly through one of the two mechanisms: ligand release in response to chemical, physical, or biological stimuli, and ligand burial in response to mechanical stretching or the change of electrical potential. This study demonstrates an encrypted ligand and a new hydrogel that are capable of inducing and inhibiting cell adhesion, which is controlled by molecular reconfiguration. The ligand initially exhibits an inert state; it can be reconfigured into active and inert states by using unblocking and recovering molecules in physiological conditions. Since molecular reconfiguration does not require the release of the ligand from the hydrogels, inhibiting and inducing cell adhesion on the hydrogels can be repeated for multiple cycles. PMID:25808026

  20. Sparse-based multispectral image encryption via ptychography

    NASA Astrophysics Data System (ADS)

    Rawat, Nitin; Shi, Yishi; Kim, Byoungho; Lee, Byung-Geun

    2015-12-01

    Recently, we proposed a model of securing a ptychography-based monochromatic image encryption system via the classical Photon-counting imaging (PCI) technique. In this study, we examine a single-channel multispectral sparse-based photon-counting ptychography imaging (SMPI)-based cryptosystem. A ptychography-based cryptosystem creates a complex object wave field, which can be reconstructed by a series of diffraction intensity patterns through an aperture movement. The PCI sensor records only a few complex Bayer patterned samples that have been utilized in the decryption process. Sparse sensing and nonlinear properties of the classical PCI system, together with the scanning probes, enlarge the key space, and such a combination therefore enhances the system's security. We demonstrate that the sparse samples have adequate information for image decryption, as well as information authentication by means of optical correlation.

  1. A fast image encryption algorithm based on chaotic map

    NASA Astrophysics Data System (ADS)

    Liu, Wenhao; Sun, Kehui; Zhu, Congxu

    2016-09-01

    Derived from Sine map and iterative chaotic map with infinite collapse (ICMIC), a new two-dimensional Sine ICMIC modulation map (2D-SIMM) is proposed based on a close-loop modulation coupling (CMC) model, and its chaotic performance is analyzed by means of phase diagram, Lyapunov exponent spectrum and complexity. It shows that this map has good ergodicity, hyperchaotic behavior, large maximum Lyapunov exponent and high complexity. Based on this map, a fast image encryption algorithm is proposed. In this algorithm, the confusion and diffusion processes are combined for one stage. Chaotic shift transform (CST) is proposed to efficiently change the image pixel positions, and the row and column substitutions are applied to scramble the pixel values simultaneously. The simulation and analysis results show that this algorithm has high security, low time complexity, and the abilities of resisting statistical analysis, differential, brute-force, known-plaintext and chosen-plaintext attacks.

  2. High-performance multimedia encryption system based on chaos.

    PubMed

    Hasimoto-Beltrán, Rogelio

    2008-06-01

    Current chaotic encryption systems in the literature do not fulfill security and performance demands for real-time multimedia communications. To satisfy these demands, we propose a generalized symmetric cryptosystem based on N independently iterated chaotic maps (N-map array) periodically perturbed with a three-level perturbation scheme and a double feedback (global and local) to increase the system's robustness to attacks. The first- and second-level perturbations make cryptosystem extremely sensitive to changes in the plaintext data since the system's output itself (ciphertext global feedback) is used in the perturbation process. Third-level perturbation is a system reset, in which the system-key and chaotic maps are replaced for totally new values. An analysis of the proposed scheme regarding its vulnerability to attacks, statistical properties, and implementation performance is presented. To the best of our knowledge we provide a secure cryptosystem with one of the highest levels of performance for real-time multimedia communications. PMID:18601477

  3. Evaluation of correlation in optical encryption by using visual cryptography

    NASA Astrophysics Data System (ADS)

    Yi, Sang-Yi; Ryu, Chung-Sang; Ryu, Dae-Hyun; Lee, Seung-Hyun

    2001-03-01

    Visual cryptography made it possible to decrypt the information encrypted by thresholding scheme not with digital system but with human vision system. This method, however, has some limit in it because of the rack of resolution in both the spatial and amplitude domain. Optical visual cryptography, which used laser system instead of human eyesight, was proposed by conjunction of the optical theory with the cryptography. However, it also had some difficulties because it did not overcome the existing problem of visual cryptography completely. The problems occurred in the process of transferring data processing system from visual to optics. Therefore, it is appropriate to approach these problems in terms of optics. The results show that the optical visual cryptograph system has both the effectiveness and reliability as well as real-time implementation property.

  4. Restricted Authentication and Encryption for Cyber-physical Systems

    SciTech Connect

    Kirkpatrick, Michael S; Bertino, Elisa; Sheldon, Frederick T

    2009-01-01

    Cyber-physical systems (CPS) are characterized by the close linkage of computational resources and physical devices. These systems can be deployed in a number of critical infrastructure settings. As a result, the security requirements of CPS are different than traditional computing architectures. For example, critical functions must be identified and isolated from interference by other functions. Similarly, lightweight schemes may be required, as CPS can include devices with limited computing power. One approach that offers promise for CPS security is the use of lightweight, hardware-based authentication. Specifically, we consider the use of Physically Unclonable Functions (PUFs) to bind an access request to specific hardware with device-specific keys. PUFs are implemented in hardware, such as SRAM, and can be used to uniquely identify the device. This technology could be used in CPS to ensure location-based access control and encryption, both of which would be desirable for CPS implementations.

  5. The Telecommunications and Data Acquisition Report

    NASA Technical Reports Server (NTRS)

    Posner, E. C. (Editor)

    1987-01-01

    Developments in programs managed by the Jet Propulsion Laboratory's Office of Telecommunications and Data Acquisition are discussed. Topics discussed include sorption compression/mechanical expanded hybrid refrigeration, calculated 70-meter antenna performance for offset L-band, systolic arrays and stack decoding, and calibrations of Deep Space Network antennas.

  6. Optical image encryption based on joint fractional transform correlator architecture and digital holography

    NASA Astrophysics Data System (ADS)

    Wang, Qu; Guo, Qing; Lei, Liang; Zhou, Jinyun

    2013-04-01

    We present a hybrid configuration of joint transform correlator (JTC) and joint fractional transform correlator (JFTC) for encryption purpose. The original input is encoded in the joint fractional power spectrum distribution of JFTC. In our experimental arrangement, an additional random phase mask (master key) is holographically generated beforehand by a Mach-Zehnder interferometer with a JTC as the object arm. The fractional order of JFTC, together with the master key, can remarkably strengthen the safety level of encryption. Different from many previous digital-holography-based encryption schemes, the stability and alignment requirement for our system is not high, since the interferometric operation is only performed in the generation procedure of the master key. The advantages and feasibility of the proposed scheme have been verified by the experimental results. By combining with a multiplex technique, an application for multiple images encryption using the system is also given a detailed description.

  7. Image encryption using fingerprint as key based on phase retrieval algorithm and public key cryptography

    NASA Astrophysics Data System (ADS)

    Zhao, Tieyu; Ran, Qiwen; Yuan, Lin; Chi, Yingying; Ma, Jing

    2015-09-01

    In this paper, a novel image encryption system with fingerprint used as a secret key is proposed based on the phase retrieval algorithm and RSA public key algorithm. In the system, the encryption keys include the fingerprint and the public key of RSA algorithm, while the decryption keys are the fingerprint and the private key of RSA algorithm. If the users share the fingerprint, then the system will meet the basic agreement of asymmetric cryptography. The system is also applicable for the information authentication. The fingerprint as secret key is used in both the encryption and decryption processes so that the receiver can identify the authenticity of the ciphertext by using the fingerprint in decryption process. Finally, the simulation results show the validity of the encryption scheme and the high robustness against attacks based on the phase retrieval technique.

  8. Three-dimensional key in a modified joint transform correlator encryption scheme

    NASA Astrophysics Data System (ADS)

    Rueda, E.; Tebaldi, M.; Torroba, R.; Bolognini, N.

    2011-09-01

    We propose a modified encryption joint transform correlator scheme that introduces an additional random phase mask. The positions of both the conventional and the new mask are crucial for successful recovery of the original data. Although the two random phase masks are 2D, variation of their relative distance constitutes an additional dimension. Consequently by including this notion, both random phase masks act as a 3-dimensional (3D) key code increasing thereby the security with respect to the conventional JTC encryption scheme. We employ this scheme to multiplex encrypted data, displacing the encoding masks. During decryption of the multiplexed information, we only reconstruct the object that matches the correct predetermined 3D key code, i.e. that matches the random masks positions in the encryption step. We present actual experimental results, by using BSO crystal as recording medium, as well as their respective analysis.

  9. A pipelined FPGA implementation of an encryption algorithm based on genetic algorithm

    NASA Astrophysics Data System (ADS)

    Thirer, Nonel

    2013-05-01

    With the evolution of digital data storage and exchange, it is essential to protect the confidential information from every unauthorized access. High performance encryption algorithms were developed and implemented by software and hardware. Also many methods to attack the cipher text were developed. In the last years, the genetic algorithm has gained much interest in cryptanalysis of cipher texts and also in encryption ciphers. This paper analyses the possibility to use the genetic algorithm as a multiple key sequence generator for an AES (Advanced Encryption Standard) cryptographic system, and also to use a three stages pipeline (with four main blocks: Input data, AES Core, Key generator, Output data) to provide a fast encryption and storage/transmission of a large amount of data.

  10. Asymmetric multiple-image encryption based on the cascaded fractional Fourier transform

    NASA Astrophysics Data System (ADS)

    Li, Yanbin; Zhang, Feng; Li, Yuanchao; Tao, Ran

    2015-09-01

    A multiple-image cryptosystem is proposed based on the cascaded fractional Fourier transform. During an encryption procedure, each of the original images is directly separated into two phase masks. A portion of the masks is subsequently modulated into an interim mask, which is encrypted into the ciphertext image; the others are used as the encryption keys. Using phase truncation in the fractional Fourier domain, one can use an asymmetric cryptosystem to produce a real-valued noise-like ciphertext, while a legal user can reconstruct all of the original images using a different group of phase masks. The encryption key is an indivisible part of the corresponding original image and is still useful during decryption. The proposed system has high resistance to various potential attacks, including the chosen-plaintext attack. Numerical simulations also demonstrate the security and feasibility of the proposed scheme.

  11. Experimental scrambling and noise reduction applied to the optical encryption of QR codes.

    PubMed

    Barrera, John Fredy; Vélez, Alejandro; Torroba, Roberto

    2014-08-25

    In this contribution, we implement two techniques to reinforce optical encryption, which we restrict in particular to the QR codes, but could be applied in a general encoding situation. To our knowledge, we present the first experimental-positional optical scrambling merged with an optical encryption procedure. The inclusion of an experimental scrambling technique in an optical encryption protocol, in particular dealing with a QR code "container", adds more protection to the encoding proposal. Additionally, a nonlinear normalization technique is applied to reduce the noise over the recovered images besides increasing the security against attacks. The opto-digital techniques employ an interferometric arrangement and a joint transform correlator encrypting architecture. The experimental results demonstrate the capability of the methods to accomplish the task. PMID:25321236

  12. Dual-channel in-line digital holographic double random phase encryption

    PubMed Central

    Das, Bhargab; Yelleswarapu, Chandra S; Rao, D V G L N

    2012-01-01

    We present a robust encryption method for the encoding of 2D/3D objects using digital holography and virtual optics. Using our recently developed dual-plane in-line digital holography technique, two in-line digital holograms are recorded at two different planes and are encrypted using two different double random phase encryption configurations, independently. The process of using two mutually exclusive encryption channels makes the system more robust against attacks since both the channels should be decrypted accurately in order to get a recognizable reconstruction. Results show that the reconstructed object is unrecognizable even when the portion of the correct phase keys used during decryption is close to 75%. The system is verified against blind decryptions by evaluating the SNR and MSE. Validation of the proposed method and sensitivities of the associated parameters are quantitatively analyzed and illustrated. PMID:23471012

  13. A new optical image encryption method based on multi-beams interference and vector composition

    NASA Astrophysics Data System (ADS)

    Chen, Linfei; Liu, Jingyu; Wen, Jisen; Gao, Xiong; Mao, Haidan; Shi, Xiaoyan; Qu, Qingling

    2015-06-01

    In this paper, a new method for optical image encryption based on multi-beams interference principle and vector composition is proposed. In this encryption, the original image is encoded into n-1 phase only masks which are regarded as the keys of the encryption system and a ciphertext according to multi-beams interference principle and vector composition. In decryption process, n beams of parallel incident light illuminate at the phase only masks and the ciphertext, and we can obtain the decrypted image at output plane after Fourier transforms. The security of the proposed method is discussed, finding that no decrypted image can be obtained only when all the keys used are right. Furthermore, the keys can be stored separately resulting in improving the security of encryption system. Computer simulation results are presented to verify the validity of the proposed method.

  14. A novel bit-level image encryption algorithm based on chaotic maps

    NASA Astrophysics Data System (ADS)

    Xu, Lu; Li, Zhi; Li, Jian; Hua, Wei

    2016-03-01

    Recently, a number of chaos-based image encryption algorithms have been proposed at the pixel level, but little research at the bit level has been conducted. This paper presents a novel bit-level image encryption algorithm that is based on piecewise linear chaotic maps (PWLCM). First, the plain image is transformed into two binary sequences of the same size. Second, a new diffusion strategy is introduced to diffuse the two sequences mutually. Then, we swap the binary elements in the two sequences by the control of a chaotic map, which can permute the bits in one bitplane into any other bitplane. The proposed algorithm has excellent encryption performance with only one round. The simulation results and performance analysis show that the proposed algorithm is both secure and reliable for image encryption.

  15. Separable and Error-Free Reversible Data Hiding in Encrypted Image with High Payload

    PubMed Central

    Yin, Zhaoxia; Luo, Bin; Hong, Wien

    2014-01-01

    This paper proposes a separable reversible data-hiding scheme in encrypted image which offers high payload and error-free data extraction. The cover image is partitioned into nonoverlapping blocks and multigranularity encryption is applied to obtain the encrypted image. The data hider preprocesses the encrypted image and randomly selects two basic pixels in each block to estimate the block smoothness and indicate peak points. Additional data are embedded into blocks in the sorted order of block smoothness by using local histogram shifting under the guidance of the peak points. At the receiver side, image decryption and data extraction are separable and can be free to choose. Compared to previous approaches, the proposed method is simpler in calculation while offering better performance: larger payload, better embedding quality, and error-free data extraction, as well as image recovery. PMID:24977214

  16. A Novel Chaotic Map and an Improved Chaos-Based Image Encryption Scheme

    PubMed Central

    2014-01-01

    In this paper, we present a novel approach to create the new chaotic map and propose an improved image encryption scheme based on it. Compared with traditional classic one-dimensional chaotic maps like Logistic Map and Tent Map, this newly created chaotic map demonstrates many better chaotic properties for encryption, implied by a much larger maximal Lyapunov exponent. Furthermore, the new chaotic map and Arnold's Cat Map based image encryption method is designed and proved to be of solid robustness. The simulation results and security analysis indicate that such method not only can meet the requirement of imagine encryption, but also can result in a preferable effectiveness and security, which is usable for general applications. PMID:25143990

  17. Efficient secure-channel free public key encryption with keyword search for EMRs in cloud storage.

    PubMed

    Guo, Lifeng; Yau, Wei-Chuen

    2015-02-01

    Searchable encryption is an important cryptographic primitive that enables privacy-preserving keyword search on encrypted electronic medical records (EMRs) in cloud storage. Efficiency of such searchable encryption in a medical cloud storage system is very crucial as it involves client platforms such as smartphones or tablets that only have constrained computing power and resources. In this paper, we propose an efficient secure-channel free public key encryption with keyword search (SCF-PEKS) scheme that is proven secure in the standard model. We show that our SCF-PEKS scheme is not only secure against chosen keyword and ciphertext attacks (IND-SCF-CKCA), but also secure against keyword guessing attacks (IND-KGA). Furthermore, our proposed scheme is more efficient than other recent SCF-PEKS schemes in the literature. PMID:25634700

  18. Optical-data storage-readout technique based on fractal encrypting masks.

    PubMed

    Tebaldi, Myrian; Furlan, Walter D; Torroba, Roberto; Bolognini, Néstor

    2009-02-01

    We propose the use of fractal structured diffractive masks as keys in secure storage-readout systems. A joint transform correlator based on a photorefractive crystal in the Fourier domain is implemented to perform encryption and decryption. We discuss the advantages of encrypting information using this kind of deterministic keys in comparison to conventional random phase masks. Preliminary experimental results are presented to demonstrate the effectiveness of the proposed system. PMID:19183643

  19. Optical transformation based image encryption and data embedding techniques using MATLAB

    NASA Astrophysics Data System (ADS)

    Bhattacharya, Debalina; Ghosh, Ajay

    2015-06-01

    The proposed work describes optical transformations such as Fourier transformation and Fresnel transformation based encryption and decryption of images using random phase masks (RPMs). The encrypted images have been embedded in some secret cover files of other formats like text files, word files, audio files etc to increase the robustness in the security applications. So, if any one wants to send confidential documents, it will be difficult for the interloper to unhide the secret information. The whole work has been done in MATLAB®

  20. An image encryption algorithm based on 3D cellular automata and chaotic maps

    NASA Astrophysics Data System (ADS)

    Del Rey, A. Martín; Sánchez, G. Rodríguez

    2015-05-01

    A novel encryption algorithm to cipher digital images is presented in this work. The digital image is rendering into a three-dimensional (3D) lattice and the protocol consists of two phases: the confusion phase where 24 chaotic Cat maps are applied and the diffusion phase where a 3D cellular automata is evolved. The encryption method is shown to be secure against the most important cryptanalytic attacks.

  1. Vulnerability to chosen-cyphertext attacks of optical encryption schemes based on double random phase keys

    NASA Astrophysics Data System (ADS)

    Carnicer, Arturo; Montes-Usategui, Mario; Arcos, Sergio; Juvells, Ignacio

    2005-07-01

    We show how optical encryption methods based on double random phase keys are vulnerable to an organized attack of the chosen-ciphertext type. The decryption key can be easily obtained by an opponent who has repeated access to either the encryption or decryption machines. However, we have also devised a solution that prevents the attack. Our results cast doubts on the present security of these techniques.

  2. Analysis of S-box in Image Encryption Using Root Mean Square Error Method

    NASA Astrophysics Data System (ADS)

    Hussain, Iqtadar; Shah, Tariq; Gondal, Muhammad Asif; Mahmood, Hasan

    2012-07-01

    The use of substitution boxes (S-boxes) in encryption applications has proven to be an effective nonlinear component in creating confusion and randomness. The S-box is evolving and many variants appear in literature, which include advanced encryption standard (AES) S-box, affine power affine (APA) S-box, Skipjack S-box, Gray S-box, Lui J S-box, residue prime number S-box, Xyi S-box, and S8 S-box. These S-boxes have algebraic and statistical properties which distinguish them from each other in terms of encryption strength. In some circumstances, the parameters from algebraic and statistical analysis yield results which do not provide clear evidence in distinguishing an S-box for an application to a particular set of data. In image encryption applications, the use of S-boxes needs special care because the visual analysis and perception of a viewer can sometimes identify artifacts embedded in the image. In addition to existing algebraic and statistical analysis already used for image encryption applications, we propose an application of root mean square error technique, which further elaborates the results and enables the analyst to vividly distinguish between the performances of various S-boxes. While the use of the root mean square error analysis in statistics has proven to be effective in determining the difference in original data and the processed data, its use in image encryption has shown promising results in estimating the strength of the encryption method. In this paper, we show the application of the root mean square error analysis to S-box image encryption. The parameters from this analysis are used in determining the strength of S-boxes

  3. Positron Emission Mammography with Multiple Angle Acquisition

    SciTech Connect

    Mark F. Smith; Stan Majewski; Raymond R. Raylman

    2002-11-01

    Positron emission mammography (PEM) of F-18 fluorodeoxyglucose (FDG) uptake in breast tumors with dedicated detectors typically has been accomplished with two planar detectors in a fixed position with the breast under compression. The potential use of PEM imaging at two detector positions to guide stereotactic breast biopsy has motivated us to use PEM coincidence data acquired at two or more detector positions together in a single image reconstruction. Multiple angle PEM acquisition and iterative image reconstruction were investigated using point source and compressed breast phantom acquisitions with 5, 9, 12 and 15 mm diameter spheres and a simulated tumor:background activity concentration ratio of 6:1. Image reconstruction was performed with an iterative MLEM algorithm that used coincidence events between any two detector pixels on opposed detector heads at each detector position. This present study compared two acquisition protocols: 2 angle acquisition with detector angular positions of -15 and +15 degrees and 11 angle acquisition with detector positions spaced at 3 degree increments over the range -15 to +15 degrees. Three- dimensional image resolution was assessed for the point source acquisitions, and contrast and signal-to-noise metrics were evaluated for the compressed breast phantom with different simulated tumor sizes. Radial and tangential resolutions were similar for the two protocols, while normal resolution was better for the 2 angle acquisition. Analysis is complicated by the asymmetric point spread functions. Signal- to-noise vs. contrast tradeoffs were better for 11 angle acquisition for the smallest visible 9 mm sphere, while tradeoff results were mixed for the larger and more easily visible 12 mm and 15 mm diameter spheres. Additional study is needed to better understand the performance of limited angle tomography for PEM. PEM tomography experiments with complete angular sampling are planned.

  4. Positron Emission Mammography with Multiple Angle Acquisition

    SciTech Connect

    Mark F. Smith; Stan Majewski; Raymond R. Raylman

    2002-11-01

    Positron emission mammography (PEM) of F-18 fluorodeoxyglucose (FbG) uptake in breast tumors with dedicated detectors typically has been accomplished with two planar detectors in a fixed position with the breast under compression. The potential use of PEM imaging at two detector positions to guide stereotactic breast biopsy has motivated us to use PEM coincidence data acquired at two or more detector positions together in a single image reconstruction. Multiple angle PEM acquisition and iterative image reconstruction were investigated using point source and compressed breast phantom acquisitions with 5, 9, 12 and 15 mm diameter spheres and a simulated tumor:background activity concentration ratio of 6:1. Image reconstruction was performed with an iterative MLEM algorithm that used coincidence events between any two detector pixels on opposed detector heads at each detector position. This present study compared two acquisition protocols: 2 angle acquisition with detector angular positions of -15 and +15 degrees and 11 angle acquisition with detector positions spaced at 3 degree increments over the range -15 to +15 degrees. Three-dimensional image resolution was assessed for the point source acquisitions, and contrast and signal-to-noise metrics were evaluated for the compressed breast phantom with different simulated tumor sizes. Radial and tangential resolutions were similar for the two protocols, while normal resolution was better for the 2 angle acquisition. Analysis is complicated by the asymmetric point spread functions. Signal- to-noise vs. contrast tradeoffs were better for 11 angle acquisition for the smallest visible 9 mm sphere, while tradeoff results were mixed for the larger and more easily visible 12 mm and 15 mm diameter spheres. Additional study is needed to better understand the performance of limited angle tomography for PEM. PEM tomography experiments with complete angular sampling are planned.

  5. Joint transform correlator optical encryption system: Extensions of the recorded encrypted signal and its inverse Fourier transform

    NASA Astrophysics Data System (ADS)

    Galizzi, Gustavo E.; Cuadrado-Laborde, Christian

    2015-10-01

    In this work we study the joint transform correlator setup, finding two analytical expressions for the extensions of the joint power spectrum and its inverse Fourier transform. We found that an optimum efficiency is reached, when the bandwidth of the key code is equal to the sum of the bandwidths of the image plus the random phase mask (RPM). The quality of the decryption is also affected by the ratio between the bandwidths of the RPM and the input image, being better as this ratio increases. In addition, the effect on the decrypted image when the detection area is lower than the encrypted signal extension was analyzed. We illustrate these results through several numerical examples.

  6. Manticore and CS mode : parallelizable encryption with joint cipher-state authentication.

    SciTech Connect

    Torgerson, Mark Dolan; Draelos, Timothy John; Schroeppel, Richard Crabtree; Miller, Russell D.; Beaver, Cheryl Lynn; Anderson, William Erik

    2004-10-01

    We describe a new mode of encryption with inexpensive authentication, which uses information from the internal state of the cipher to provide the authentication. Our algorithms have a number of benefits: (1) the encryption has properties similar to CBC mode, yet the encipherment and authentication can be parallelized and/or pipelined, (2) the authentication overhead is minimal, and (3) the authentication process remains resistant against some IV reuse. We offer a Manticore class of authenticated encryption algorithms based on cryptographic hash functions, which support variable block sizes up to twice the hash output length and variable key lengths. A proof of security is presented for the MTC4 and Pepper algorithms. We then generalize the construction to create the Cipher-State (CS) mode of encryption that uses the internal state of any round-based block cipher as an authenticator. We provide hardware and software performance estimates for all of our constructions and give a concrete example of the CS mode of encryption that uses AES as the encryption primitive and adds a small speed overhead (10-15%) compared to AES alone.

  7. Ensemble of Chaotic and Naive Approaches for Performance Enhancement in Video Encryption.

    PubMed

    Chandrasekaran, Jeyamala; Thiruvengadam, S J

    2015-01-01

    Owing to the growth of high performance network technologies, multimedia applications over the Internet are increasing exponentially. Applications like video conferencing, video-on-demand, and pay-per-view depend upon encryption algorithms for providing confidentiality. Video communication is characterized by distinct features such as large volume, high redundancy between adjacent frames, video codec compliance, syntax compliance, and application specific requirements. Naive approaches for video encryption encrypt the entire video stream with conventional text based cryptographic algorithms. Although naive approaches are the most secure for video encryption, the computational cost associated with them is very high. This research work aims at enhancing the speed of naive approaches through chaos based S-box design. Chaotic equations are popularly known for randomness, extreme sensitivity to initial conditions, and ergodicity. The proposed methodology employs two-dimensional discrete Henon map for (i) generation of dynamic and key-dependent S-box that could be integrated with symmetric algorithms like Blowfish and Data Encryption Standard (DES) and (ii) generation of one-time keys for simple substitution ciphers. The proposed design is tested for randomness, nonlinearity, avalanche effect, bit independence criterion, and key sensitivity. Experimental results confirm that chaos based S-box design and key generation significantly reduce the computational cost of video encryption with no compromise in security. PMID:26550603

  8. Practical and Secure Recovery of Disk Encryption Key Using Smart Cards

    NASA Astrophysics Data System (ADS)

    Omote, Kazumasa; Kato, Kazuhiko

    In key-recovery methods using smart cards, a user can recover the disk encryption key in cooperation with the system administrator, even if the user has lost the smart card including the disk encryption key. However, the disk encryption key is known to the system administrator in advance in most key-recovery methods. Hence user's disk data may be read by the system administrator. Furthermore, if the disk encryption key is not known to the system administrator in advance, it is difficult to achieve a key authentication. In this paper, we propose a scheme which enables to recover the disk encryption key when the user's smart card is lost. In our scheme, the disk encryption key is not preserved anywhere and then the system administrator cannot know the key before key-recovery phase. Only someone who has a user's smart card and knows the user's password can decrypt that user's disk data. Furthermore, we measured the processing time required for user authentication in an experimental environment using a virtual machine monitor. As a result, we found that this processing time is short enough to be practical.

  9. Ensemble of Chaotic and Naive Approaches for Performance Enhancement in Video Encryption

    PubMed Central

    Chandrasekaran, Jeyamala; Thiruvengadam, S. J.

    2015-01-01

    Owing to the growth of high performance network technologies, multimedia applications over the Internet are increasing exponentially. Applications like video conferencing, video-on-demand, and pay-per-view depend upon encryption algorithms for providing confidentiality. Video communication is characterized by distinct features such as large volume, high redundancy between adjacent frames, video codec compliance, syntax compliance, and application specific requirements. Naive approaches for video encryption encrypt the entire video stream with conventional text based cryptographic algorithms. Although naive approaches are the most secure for video encryption, the computational cost associated with them is very high. This research work aims at enhancing the speed of naive approaches through chaos based S-box design. Chaotic equations are popularly known for randomness, extreme sensitivity to initial conditions, and ergodicity. The proposed methodology employs two-dimensional discrete Henon map for (i) generation of dynamic and key-dependent S-box that could be integrated with symmetric algorithms like Blowfish and Data Encryption Standard (DES) and (ii) generation of one-time keys for simple substitution ciphers. The proposed design is tested for randomness, nonlinearity, avalanche effect, bit independence criterion, and key sensitivity. Experimental results confirm that chaos based S-box design and key generation significantly reduce the computational cost of video encryption with no compromise in security. PMID:26550603

  10. Turbulence in Compressible Flows

    NASA Technical Reports Server (NTRS)

    1997-01-01

    Lecture notes for the AGARD Fluid Dynamics Panel (FDP) Special Course on 'Turbulence in Compressible Flows' have been assembled in this report. The following topics were covered: Compressible Turbulent Boundary Layers, Compressible Turbulent Free Shear Layers, Turbulent Combustion, DNS/LES and RANS Simulations of Compressible Turbulent Flows, and Case Studies of Applications of Turbulence Models in Aerospace.

  11. Application of Mean of Absolute Deviation Method for the Selection of Best Nonlinear Component Based on Video Encryption

    NASA Astrophysics Data System (ADS)

    Anees, Amir; Khan, Waqar Ahmad; Gondal, Muhammad Asif; Hussain, Iqtadar

    2013-07-01

    The aim of this work is to make use of the mean of absolute deviation (MAD) method for the evaluation process of substitution boxes used in the advanced encryption standard. In this paper, we use the MAD technique to analyze some popular and prevailing substitution boxes used in encryption processes. In particular, MAD is applied to advanced encryption standard (AES), affine power affine (APA), Gray, Lui J., Residue Prime, S8 AES, SKIPJACK, and Xyi substitution boxes.

  12. Hyperspectral fluorescence microscopy based on compressed sensing

    NASA Astrophysics Data System (ADS)

    Studer, Vincent; Bobin, Jérome; Chahid, Makhlad; Mousavi, Hamed; Candes, Emmanuel; Dahan, Maxime

    2012-03-01

    In fluorescence microscopy, one can distinguish two kinds of imaging approaches, wide field and raster scan microscopy, differing by their excitation and detection scheme. In both imaging modalities the acquisition is independent of the information content of the image. Rather, the number of acquisitions N, is imposed by the Nyquist-Shannon theorem. However, in practice, many biological images are compressible (or, equivalently here, sparse), meaning that they depend on a number of degrees of freedom K that is smaller that their size N. Recently, the mathematical theory of compressed sensing (CS) has shown how the sensing modality could take advantage of the image sparsity to reconstruct images with no loss of information while largely reducing the number M of acquisition. Here we present a novel fluorescence microscope designed along the principles of CS. It uses a spatial light modulator (DMD) to create structured wide field excitation patterns and a sensitive point detector to measure the emitted fluorescence. On sparse fluorescent samples, we could achieve compression ratio N/M of up to 64, meaning that an image can be reconstructed with a number of measurements of only 1.5 % of its pixel number. Furthemore, we extend our CS acquisition scheme to an hyperspectral imaging system.

  13. Quantum cryptography using coherent states: Randomized encryption and key generation

    NASA Astrophysics Data System (ADS)

    Corndorf, Eric

    objectives of key generation and direct data-encryption, a new quantum cryptographic principle is demonstrated wherein keyed coherent-state signal sets are employed. Taking advantage of the fundamental and irreducible quantum-measurement noise of coherent states, these schemes do not require the users to measure the influence of an attacker. Experimental key-generation and data encryption schemes based on these techniques, which are compatible with today's WDM fiber-optic telecommunications infrastructure, are implemented and analyzed.

  14. Fast spectrophotometry with compressive sensing

    NASA Astrophysics Data System (ADS)

    Starling, David; Storer, Ian

    2015-03-01

    Spectrophotometers and spectrometers have numerous applications in the physical sciences and engineering, resulting in a plethora of designs and requirements. A good spectrophotometer balances the need for high photometric precision, high spectral resolution, high durability and low cost. One way to address these design objectives is to take advantage of modern scanning and detection techniques. A common imaging method that has improved signal acquisition speed and sensitivity in limited signal scenarios is the single pixel camera. Such cameras utilize the sparsity of a signal to sample below the Nyquist rate via a process known as compressive sensing. Here, we show that a single pixel camera using compressive sensing algorithms and a digital micromirror device can replace the common scanning mechanisms found in virtually all spectrophotometers, providing a very low cost solution and improving data acquisition time. We evaluate this single pixel spectrophotometer by studying a variety of samples tested against commercial products. We conclude with an analysis of flame spectra and possible improvements for future designs.

  15. Syntax acquisition.

    PubMed

    Crain, Stephen; Thornton, Rosalind

    2012-03-01

    Every normal child acquires a language in just a few years. By 3- or 4-years-old, children have effectively become adults in their abilities to produce and understand endlessly many sentences in a variety of conversational contexts. There are two alternative accounts of the course of children's language development. These different perspectives can be traced back to the nature versus nurture debate about how knowledge is acquired in any cognitive domain. One perspective dates back to Plato's dialog 'The Meno'. In this dialog, the protagonist, Socrates, demonstrates to Meno, an aristocrat in Ancient Greece, that a young slave knows more about geometry than he could have learned from experience. By extension, Plato's Problem refers to any gap between experience and knowledge. How children fill in the gap in the case of language continues to be the subject of much controversy in cognitive science. Any model of language acquisition must address three factors, inter alia: 1. The knowledge children accrue; 2. The input children receive (often called the primary linguistic data); 3. The nonlinguistic capacities of children to form and test generalizations based on the input. According to the famous linguist Noam Chomsky, the main task of linguistics is to explain how children bridge the gap-Chomsky calls it a 'chasm'-between what they come to know about language, and what they could have learned from experience, even given optimistic assumptions about their cognitive abilities. Proponents of the alternative 'nurture' approach accuse nativists like Chomsky of overestimating the complexity of what children learn, underestimating the data children have to work with, and manifesting undue pessimism about children's abilities to extract information based on the input. The modern 'nurture' approach is often referred to as the usage-based account. We discuss the usage-based account first, and then the nativist account. After that, we report and discuss the findings of several

  16. Probing protein sequences as sources for encrypted antimicrobial peptides.

    PubMed

    Brand, Guilherme D; Magalhães, Mariana T Q; Tinoco, Maria L P; Aragão, Francisco J L; Nicoli, Jacques; Kelly, Sharon M; Cooper, Alan; Bloch, Carlos

    2012-01-01

    Starting from the premise that a wealth of potentially biologically active peptides may lurk within proteins, we describe here a methodology to identify putative antimicrobial peptides encrypted in protein sequences. Candidate peptides were identified using a new screening procedure based on physicochemical criteria to reveal matching peptides within protein databases. Fifteen such peptides, along with a range of natural antimicrobial peptides, were examined using DSC and CD to characterize their interaction with phospholipid membranes. Principal component analysis of DSC data shows that the investigated peptides group according to their effects on the main phase transition of phospholipid vesicles, and that these effects correlate both to antimicrobial activity and to the changes in peptide secondary structure. Consequently, we have been able to identify novel antimicrobial peptides from larger proteins not hitherto associated with such activity, mimicking endogenous and/or exogenous microorganism enzymatic processing of parent proteins to smaller bioactive molecules. A biotechnological application for this methodology is explored. Soybean (Glycine max) plants, transformed to include a putative antimicrobial protein fragment encoded in its own genome were tested for tolerance against Phakopsora pachyrhizi, the causative agent of the Asian soybean rust. This procedure may represent an inventive alternative to the transgenic technology, since the genetic material to be used belongs to the host organism and not to exogenous sources. PMID:23029273

  17. Efficient hardware implementation of the lightweight block encryption algorithm LEA.

    PubMed

    Lee, Donggeon; Kim, Dong-Chan; Kwon, Daesung; Kim, Howon

    2014-01-01

    Recently, due to the advent of resource-constrained trends, such as smartphones and smart devices, the computing environment is changing. Because our daily life is deeply intertwined with ubiquitous networks, the importance of security is growing. A lightweight encryption algorithm is essential for secure communication between these kinds of resource-constrained devices, and many researchers have been investigating this field. Recently, a lightweight block cipher called LEA was proposed. LEA was originally targeted for efficient implementation on microprocessors, as it is fast when implemented in software and furthermore, it has a small memory footprint. To reflect on recent technology, all required calculations utilize 32-bit wide operations. In addition, the algorithm is comprised of not complex S-Box-like structures but simple Addition, Rotation, and XOR operations. To the best of our knowledge, this paper is the first report on a comprehensive hardware implementation of LEA. We present various hardware structures and their implementation results according to key sizes. Even though LEA was originally targeted at software efficiency, it also shows high efficiency when implemented as hardware. PMID:24406859

  18. Web-browser encryption of personal health information

    PubMed Central

    2011-01-01

    Background Electronic health records provide access to an unprecedented amount of clinical data for research that can accelerate the development of effective medical practices. However it is important to protect patient confidentiality, as many medical conditions are stigmatized and disclosure could result in personal and/or financial loss. Results We describe a system for remote data entry that allows the data that would identify the patient to be encrypted in the web browser of the person entering the data. These data cannot be decrypted on the server by the staff at the data center but can be decrypted by the person entering the data or their delegate. We developed this system to solve a problem that arose in the context of clinical research, but it is applicable in a range of situations where sensitive information is stored and updated in a database and it is necessary to ensure that it cannot be viewed by any except those intentionally given access. Conclusion By developing this system, we are able to centralize the collection of some patient data while minimizing the risk that protected health information be made available to study personnel who are not authorized to use it. PMID:22073940

  19. Efficient Hardware Implementation of the Lightweight Block Encryption Algorithm LEA

    PubMed Central

    Lee, Donggeon; Kim, Dong-Chan; Kwon, Daesung; Kim, Howon

    2014-01-01

    Recently, due to the advent of resource-constrained trends, such as smartphones and smart devices, the computing environment is changing. Because our daily life is deeply intertwined with ubiquitous networks, the importance of security is growing. A lightweight encryption algorithm is essential for secure communication between these kinds of resource-constrained devices, and many researchers have been investigating this field. Recently, a lightweight block cipher called LEA was proposed. LEA was originally targeted for efficient implementation on microprocessors, as it is fast when implemented in software and furthermore, it has a small memory footprint. To reflect on recent technology, all required calculations utilize 32-bit wide operations. In addition, the algorithm is comprised of not complex S-Box-like structures but simple Addition, Rotation, and XOR operations. To the best of our knowledge, this paper is the first report on a comprehensive hardware implementation of LEA. We present various hardware structures and their implementation results according to key sizes. Even though LEA was originally targeted at software efficiency, it also shows high efficiency when implemented as hardware. PMID:24406859

  20. Learning in compressed space.

    PubMed

    Fabisch, Alexander; Kassahun, Yohannes; Wöhrle, Hendrik; Kirchner, Frank

    2013-06-01

    We examine two methods which are used to deal with complex machine learning problems: compressed sensing and model compression. We discuss both methods in the context of feed-forward artificial neural networks and develop the backpropagation method in compressed parameter space. We further show that compressing the weights of a layer of a multilayer perceptron is equivalent to compressing the input of the layer. Based on this theoretical framework, we will use orthogonal functions and especially random projections for compression and perform experiments in supervised and reinforcement learning to demonstrate that the presented methods reduce training time significantly. PMID:23501172

  1. Scalable end-to-end encryption technology for supra-gigabit/second networking

    SciTech Connect

    Pierson, L.G.; Tarman, T.D.; Witzke, E.L.

    1997-05-01

    End-to-end encryption can protect proprietary information as it passes through a complex inter-city computer network, even if the intermediate systems are untrusted. This technique involves encrypting the body of computer messages while leaving network addressing and control information unencrypted for processing by intermediate network nodes. Because high speed implementations of end-to-end encryption with easy key management for standard network protocols are unavailable, this technique is not widely used today. Specifically, no end-to-end encryptors exist to protect Asynchronous Transfer Mode (ATM) traffic, nor to protect Switched Multi-megabit Data Service (SMDS), which is the first ``Broadband Integrated Services Digital Network`` (BISDN) service now being used by long distance telephone companies. This encryption technology is required for the protection of data in transit between industrial sites and central Massively Parallel Supercomputing Centers over high bandwidth, variable bit rate (BISDN) services. This research effort investigated techniques to scale end-to-end encryption technology from today`s state of the art ({approximately} 0.001 Gb/s) to 2.4 Gb/s and higher. A cryptosystem design has been developed which scales for implementation beyond SONET OC-48 (2.4Gb/s) data rates. A prototype for use with OC-3 (0.155 Gb/s) ATM variable bit rate services was developed.

  2. A joint encryption/watermarking system for verifying the reliability of medical images.

    PubMed

    Bouslimi, Dalel; Coatrieux, Gouenou; Cozic, Michel; Roux, Christian

    2012-09-01

    In this paper, we propose a joint encryption/water-marking system for the purpose of protecting medical images. This system is based on an approach which combines a substitutive watermarking algorithm, the quantization index modulation, with an encryption algorithm: a stream cipher algorithm (e.g., the RC4) or a block cipher algorithm (e.g., the AES in cipher block chaining (CBC) mode of operation). Our objective is to give access to the outcomes of the image integrity and of its origin even though the image is stored encrypted. If watermarking and encryption are conducted jointly at the protection stage, watermark extraction and decryption can be applied independently. The security analysis of our scheme and experimental results achieved on 8-bit depth ultrasound images as well as on 16-bit encoded positron emission tomography images demonstrate the capability of our system to securely make available security attributes in both spatial and encrypted domains while minimizing image distortion. Furthermore, by making use of the AES block cipher in CBC mode, the proposed system is compliant with or transparent to the DICOM standard. PMID:22801525

  3. An image hiding method based on cascaded iterative Fourier transform and public-key encryption algorithm

    NASA Astrophysics Data System (ADS)

    Zhang, B.; Sang, Jun; Alam, Mohammad S.

    2013-03-01

    An image hiding method based on cascaded iterative Fourier transform and public-key encryption algorithm was proposed. Firstly, the original secret image was encrypted into two phase-only masks M1 and M2 via cascaded iterative Fourier transform (CIFT) algorithm. Then, the public-key encryption algorithm RSA was adopted to encrypt M2 into M2' . Finally, a host image was enlarged by extending one pixel into 2×2 pixels and each element in M1 and M2' was multiplied with a superimposition coefficient and added to or subtracted from two different elements in the 2×2 pixels of the enlarged host image. To recover the secret image from the stego-image, the two masks were extracted from the stego-image without the original host image. By applying public-key encryption algorithm, the key distribution was facilitated, and also compared with the image hiding method based on optical interference, the proposed method may reach higher robustness by employing the characteristics of the CIFT algorithm. Computer simulations show that this method has good robustness against image processing.

  4. Investigating Second Language Acquisition.

    ERIC Educational Resources Information Center

    Jordens, Peter, Ed.; Lalleman, Josine, Ed.

    Essays in second language acquisition include: "The State of the Art in Second Language Acquisition Research" (Josine Lalleman); "Crosslinguistic Influence with Special Reference to the Acquisition of Grammar" (Michael Sharwood Smith); "Second Language Acquisition by Adult Immigrants: A Multiple Case Study of Turkish and Moroccan Learners of…

  5. Compressive sensing image sensors-hardware implementation.

    PubMed

    Dadkhah, Mohammadreza; Deen, M Jamal; Shirani, Shahram

    2013-01-01

    The compressive sensing (CS) paradigm uses simultaneous sensing and compression to provide an efficient image acquisition technique. The main advantages of the CS method include high resolution imaging using low resolution sensor arrays and faster image acquisition. Since the imaging philosophy in CS imagers is different from conventional imaging systems, new physical structures have been developed for cameras that use the CS technique. In this paper, a review of different hardware implementations of CS encoding in optical and electrical domains is presented. Considering the recent advances in CMOS (complementary metal-oxide-semiconductor) technologies and the feasibility of performing on-chip signal processing, important practical issues in the implementation of CS in CMOS sensors are emphasized. In addition, the CS coding for video capture is discussed. PMID:23584123

  6. Optical Data Compression in Time Stretch Imaging

    PubMed Central

    Chen, Claire Lifan; Mahjoubfar, Ata; Jalali, Bahram

    2015-01-01

    Time stretch imaging offers real-time image acquisition at millions of frames per second and subnanosecond shutter speed, and has enabled detection of rare cancer cells in blood with record throughput and specificity. An unintended consequence of high throughput image acquisition is the massive amount of digital data generated by the instrument. Here we report the first experimental demonstration of real-time optical image compression applied to time stretch imaging. By exploiting the sparsity of the image, we reduce the number of samples and the amount of data generated by the time stretch camera in our proof-of-concept experiments by about three times. Optical data compression addresses the big data predicament in such systems. PMID:25906244

  7. Microbunching and RF Compression

    SciTech Connect

    Venturini, M.; Migliorati, M.; Ronsivalle, C.; Ferrario, M.; Vaccarezza, C.

    2010-05-23

    Velocity bunching (or RF compression) represents a promising technique complementary to magnetic compression to achieve the high peak current required in the linac drivers for FELs. Here we report on recent progress aimed at characterizing the RF compression from the point of view of the microbunching instability. We emphasize the development of a linear theory for the gain function of the instability and its validation against macroparticle simulations that represents a useful tool in the evaluation of the compression schemes for FEL sources.

  8. Compressed gas manifold

    DOEpatents

    Hildebrand, Richard J.; Wozniak, John J.

    2001-01-01

    A compressed gas storage cell interconnecting manifold including a thermally activated pressure relief device, a manual safety shut-off valve, and a port for connecting the compressed gas storage cells to a motor vehicle power source and to a refueling adapter. The manifold is mechanically and pneumatically connected to a compressed gas storage cell by a bolt including a gas passage therein.

  9. Compressible turbulent mixing: Effects of compressibility

    NASA Astrophysics Data System (ADS)

    Ni, Qionglin

    2016-04-01

    We studied by numerical simulations the effects of compressibility on passive scalar transport in stationary compressible turbulence. The turbulent Mach number varied from zero to unity. The difference in driven forcing was the magnitude ratio of compressive to solenoidal modes. In the inertial range, the scalar spectrum followed the k-5 /3 scaling and suffered negligible influence from the compressibility. The growth of the Mach number showed (1) a first reduction and second enhancement in the transfer of scalar flux; (2) an increase in the skewness and flatness of the scalar derivative and a decrease in the mixed skewness and flatness of the velocity-scalar derivatives; (3) a first stronger and second weaker intermittency of scalar relative to that of velocity; and (4) an increase in the intermittency parameter which measures the intermittency of scalar in the dissipative range. Furthermore, the growth of the compressive mode of forcing indicated (1) a decrease in the intermittency parameter and (2) less efficiency in enhancing scalar mixing. The visualization of scalar dissipation showed that, in the solenoidal-forced flow, the field was filled with the small-scale, highly convoluted structures, while in the compressive-forced flow, the field was exhibited as the regions dominated by the large-scale motions of rarefaction and compression.

  10. High speed all-optical encryption and decryption using quantum dot semiconductor optical amplifiers

    NASA Astrophysics Data System (ADS)

    Li, Wenbo; Hu, Hongyu; Dutta, Niloy K.

    2013-11-01

    A scheme to realize high speed all-optical encryption and decryption using key-stream generators and an XOR gate based on quantum dot semiconductor optical amplifiers (QD-SOAs) was studied. The key used for encryption and decryption is a high speed all-optical pseudorandom bit sequence (PRBS) which is generated by a linear feedback shift register (LFSR) composed of QD-SOA-based logic XOR and AND gates. Two other kinds of more secure key-stream generators, i.e. cascaded design and parallel design, were also designed and investigated. Nonlinear dynamics including carrier heating and spectral hole-burning in the QD-SOA are taken into account together with the rate equations in order to realize all-optical logic operations. Results show that this scheme can realize all-optical encryption and decryption by using key-stream generators at high speed (~250 Gb/s).

  11. Quantum-noise randomized data encryption for wavelength-division-multiplexed fiber-optic networks

    SciTech Connect

    Corndorf, Eric; Liang Chuang; Kanter, Gregory S.; Kumar, Prem; Yuen, Horace P.

    2005-06-15

    We demonstrate high-rate randomized data-encryption through optical fibers using the inherent quantum-measurement noise of coherent states of light. Specifically, we demonstrate 650 Mbit/s data encryption through a 10 Gbit/s data-bearing, in-line amplified 200-km-long line. In our protocol, legitimate users (who share a short secret key) communicate using an M-ry signal set while an attacker (who does not share the secret key) is forced to contend with the fundamental and irreducible quantum-measurement noise of coherent states. Implementations of our protocol using both polarization-encoded signal sets as well as polarization-insensitive phase-keyed signal sets are experimentally and theoretically evaluated. Different from the performance criteria for the cryptographic objective of key generation (quantum key-generation), one possible set of performance criteria for the cryptographic objective of data encryption is established and carefully considered.

  12. Digital color encryption using a multi-wavelength approach and a joint transform correlator

    NASA Astrophysics Data System (ADS)

    Amaya, Dafne; Tebaldi, Myrian; Torroba, Roberto; Bolognini, Néstor

    2008-10-01

    We propose a digital color image encryption technique by using a joint transform correlator (JTC) architecture and a wavelength multiplexing operation. In our optical arrangement, the color image to be encrypted is separated into three channels: red, green and blue. One of the JTC apertures contains the input image information corresponding to a determined color channel bonded to a random phase mask, while the other JTC aperture contains the reference random phase key code. Since the speckle size generated by the random phase masks is wavelength dependent, the illuminating wavelength variation will produce a corresponding joint power spectrum (JPS) modification. Consequently, wavelength changes can be used to multiplex the encrypted information associated to each color channel. We sequentially store every JPS in the same medium. We present digital results that confirm our approach.

  13. P-Code-Enhanced Encryption-Mode Processing of GPS Signals

    NASA Technical Reports Server (NTRS)

    Young, Lawrence; Meehan, Thomas; Thomas, Jess B.

    2003-01-01

    A method of processing signals in a Global Positioning System (GPS) receiver has been invented to enable the receiver to recover some of the information that is otherwise lost when GPS signals are encrypted at the transmitters. The need for this method arises because, at the option of the military, precision GPS code (P-code) is sometimes encrypted by a secret binary code, denoted the A code. Authorized users can recover the full signal with knowledge of the A-code. However, even in the absence of knowledge of the A-code, one can track the encrypted signal by use of an estimate of the A-code. The present invention is a method of making and using such an estimate. In comparison with prior such methods, this method makes it possible to recover more of the lost information and obtain greater accuracy.

  14. Nonlinear multiple-image encryption based on mixture retrieval algorithm in Fresnel domain

    NASA Astrophysics Data System (ADS)

    Wang, Y.; Quan, C.; Tay, C. J.

    2014-11-01

    We propose a novel nonlinear multiple-image encryption based on mixture retrieval algorithm and phase mask multiplexing in Fresnel domain. The encryption process is realized by applying the Yang-Gu algorithm cascaded with a modified Gerchberg-Saxton algorithm (MGSA), which generate a private key and an intermediate phase to ensure high security. In the proposed method, all images are encoded separately into a phase only function (POF). Obtained POFs are integrated into a final POF based on phase mask multiplexing. As a result, cross-talk noise is removed resulting in a large improvement of the encryption capacity. A spatial light modulator (SLM) based optical setup has been suggested for decryption. Numerical simulations are presented to demonstrate the feasibility and effectiveness of the proposed system. Results also indicate the high robustness of the system against occlusion and noise attacks.

  15. Security enhanced optical encryption system by random phase key and permutation key.

    PubMed

    He, Mingzhao; Tan, Qiaofeng; Cao, Liangcai; He, Qingsheng; Jin, Guofan

    2009-12-01

    Conventional double random phase encoding (DRPE) encrypts plaintext to white noise-like ciphertext which may attract attention of eavesdroppers, and recent research reported that DRPE is vulnerable to various attacks. Here we propose a security enhanced optical encryption system that can hide the existence of secret information by watermarking. The plaintext is encrypted using iterative fractional Fourier transform with random phase key, and ciphertext is randomly permuted with permutation key before watermarking. Cryptanalysis shows that linearity of the security system has been broken and the permutation key prevent the attacker from accessing the ciphertext in various attacks. A series of simulations have shown the effectiveness of this system and the security strength is enhanced for invisibility, nonlinearity and resistance against attacks. PMID:20052170

  16. Optical encryption and QR codes: secure and noise-free information retrieval.

    PubMed

    Barrera, John Fredy; Mira, Alejandro; Torroba, Roberto

    2013-03-11

    We introduce for the first time the concept of an information "container" before a standard optical encrypting procedure. The "container" selected is a QR code which offers the main advantage of being tolerant to pollutant speckle noise. Besides, the QR code can be read by smartphones, a massively used device. Additionally, QR code includes another secure step to the encrypting benefits the optical methods provide. The QR is generated by means of worldwide free available software. The concept development probes that speckle noise polluting the outcomes of normal optical encrypting procedures can be avoided, then making more attractive the adoption of these techniques. Actual smartphone collected results are shown to validate our proposal. PMID:23482108

  17. Quantum image encryption based on generalized affine transform and logistic map

    NASA Astrophysics Data System (ADS)

    Liang, Hao-Ran; Tao, Xiang-Yang; Zhou, Nan-Run

    2016-03-01

    Quantum circuits of the generalized affine transform are devised based on the novel enhanced quantum representation of digital images. A novel quantum image encryption algorithm combining the generalized affine transform with logistic map is suggested. The gray-level information of the quantum image is encrypted by the XOR operation with a key generator controlled by the logistic map, while the position information of the quantum image is encoded by the generalized affine transform. The encryption keys include the independent control parameters used in the generalized affine transform and the logistic map. Thus, the key space is large enough to frustrate the possible brute-force attack. Numerical simulations and analyses indicate that the proposed algorithm is realizable, robust and has a better performance than its classical counterpart in terms of computational complexity.

  18. Optical image encryption based on multi-beam interference and common vector decomposition

    NASA Astrophysics Data System (ADS)

    Chen, Linfei; He, Bingyu; Chen, Xudong; Gao, Xiong; Liu, Jingyu

    2016-02-01

    Based on multi-beam interference and common vector decomposition, we propose a new method for optical image encryption. In encryption process, the information of an original image is encoded into n amplitude masks and n phase masks which are regarded as a ciphertext and many keys. In decryption process, parallel light irradiates the amplitude masks and phase masks, then passes through lens that takes place Fourier transform, and finally we obtain the original image at the output plane after interference. The security of the encryption system is also discussed in the paper, and we find that only when all the keys are correct, can the information of the original image be recovered. Computer simulation results are presented to verify the validity and the security of the proposed method.

  19. Texture Analysis of Chaotic Coupled Map Lattices Based Image Encryption Algorithm

    NASA Astrophysics Data System (ADS)

    Khan, Majid; Shah, Tariq; Batool, Syeda Iram

    2014-09-01

    As of late, data security is key in different enclosures like web correspondence, media frameworks, therapeutic imaging, telemedicine and military correspondence. In any case, a large portion of them confronted with a few issues, for example, the absence of heartiness and security. In this letter, in the wake of exploring the fundamental purposes of the chaotic trigonometric maps and the coupled map lattices, we have presented the algorithm of chaos-based image encryption based on coupled map lattices. The proposed mechanism diminishes intermittent impact of the ergodic dynamical systems in the chaos-based image encryption. To assess the security of the encoded image of this scheme, the association of two nearby pixels and composition peculiarities were performed. This algorithm tries to minimize the problems arises in image encryption.

  20. Asymmetric optical image encryption based on an improved amplitude-phase retrieval algorithm

    NASA Astrophysics Data System (ADS)

    Wang, Y.; Quan, C.; Tay, C. J.

    2016-03-01

    We propose a new asymmetric optical image encryption scheme based on an improved amplitude-phase retrieval algorithm. Using two random phase masks that serve as public encryption keys, an iterative amplitude and phase retrieval process is employed to encode a primary image into a real-valued ciphertext. The private keys generated in the encryption process are used to perform one-way phase modulations. The decryption process is implemented optically using conventional double random phase encoding architecture. Numerical simulations are presented to demonstrate the feasibility and robustness of the proposed system. The results illustrate that the computing efficiency of the proposed method is improved and the number of iterations required is much less than that of the cryptosystem based on the Yang-Gu algorithm.

  1. Double image encryption based on random phase encoding in the fractional Fourier domain.

    PubMed

    Tao, Ran; Xin, Yi; Wang, Yue

    2007-11-26

    A novel image encryption method is proposed by utilizing random phase encoding in the fractional Fourier domain to encrypt two images into one encrypted image with stationary white distribution. By applying the correct keys which consist of the fractional orders, the random phase masks and the pixel scrambling operator, the two primary images can be recovered without cross-talk. The decryption process is robust against the loss of data. The phase-based image with a larger key space is more sensitive to keys and disturbances than the amplitude-based image. The pixel scrambling operation improves the quality of the decrypted image when noise perturbation occurs. The novel approach is verified by simulations. PMID:19550895

  2. Digital Image Encryption Based on the RC5 Block Cipher Algorithm

    NASA Astrophysics Data System (ADS)

    Faragallah, Osama S.

    2011-12-01

    Implementation of the RC5 block cipher algorithm for digital images in different modes of operation and its detailed encryption efficiency analysis are dealt with in this paper. The encryption efficiency analysis of the RC5 block cipher algorithm for digital images is investigated using several metrics including visual testing, maximum deviation, irregular deviation, information entropy, correlation coefficients, avalanche effect, histogram uniformity and key space analysis. The evaluation consists of theoretical derivations and practical experimentation. Experimental results have proved that the RC5 block cipher algorithm can be implemented efficiently for encryption of real-time digital images and demonstrated that the RC5 block cipher algorithm is highly secure from the strong cryptographic viewpoint.

  3. Investigating the structure preserving encryption of high efficiency video coding (HEVC)

    NASA Astrophysics Data System (ADS)

    Shahid, Zafar; Puech, William

    2013-02-01

    This paper presents a novel method for the real-time protection of new emerging High Efficiency Video Coding (HEVC) standard. Structure preserving selective encryption is being performed in CABAC entropy coding module of HEVC, which is significantly different from CABAC entropy coding of H.264/AVC. In CABAC of HEVC, exponential Golomb coding is replaced by truncated Rice (TR) up to a specific value for binarization of transform coefficients. Selective encryption is performed using AES cipher in cipher feedback mode on a plaintext of binstrings in a context aware manner. The encrypted bitstream has exactly the same bit-rate and is format complaint. Experimental evaluation and security analysis of the proposed algorithm is performed on several benchmark video sequences containing different combinations of motion, texture and objects.

  4. Optical information encryption based on incoherent superposition with the help of the QR code

    NASA Astrophysics Data System (ADS)

    Qin, Yi; Gong, Qiong

    2014-01-01

    In this paper, a novel optical information encryption approach is proposed with the help of QR code. This method is based on the concept of incoherent superposition which we introduce for the first time. The information to be encrypted is first transformed into the corresponding QR code, and thereafter the QR code is further encrypted into two phase only masks analytically by use of the intensity superposition of two diffraction wave fields. The proposed method has several advantages over the previous interference-based method, such as a higher security level, a better robustness against noise attack, a more relaxed work condition, and so on. Numerical simulation results and actual smartphone collected results are shown to validate our proposal.

  5. Graphics processing unit-accelerated double random phase encoding for fast image encryption

    NASA Astrophysics Data System (ADS)

    Lee, Jieun; Yi, Faliu; Saifullah, Rao; Moon, Inkyu

    2014-11-01

    We propose a fast double random phase encoding (DRPE) algorithm using a graphics processing unit (GPU)-based stream-processing model. A performance analysis of the accelerated DRPE implementation that employs the Compute Unified Device Architecture programming environment is presented. We show that the proposed methodology executed on a GPU can dramatically increase encryption speed compared with central processing unit sequential computing. Our experimental results demonstrate that in encryption data of an image with a pixel size of 1000×1000, where one pixel has a 32-bit depth, our GPU version of the DRPE scheme can be approximately two times faster than the advanced encryption standard algorithm implemented on a GPU. In addition, the quality of parallel processing on the presented DRPE acceleration method is evaluated with performance parameters, such as speedup, efficiency, and redundancy.

  6. Quantum image encryption based on generalized affine transform and logistic map

    NASA Astrophysics Data System (ADS)

    Liang, Hao-Ran; Tao, Xiang-Yang; Zhou, Nan-Run

    2016-07-01

    Quantum circuits of the generalized affine transform are devised based on the novel enhanced quantum representation of digital images. A novel quantum image encryption algorithm combining the generalized affine transform with logistic map is suggested. The gray-level information of the quantum image is encrypted by the XOR operation with a key generator controlled by the logistic map, while the position information of the quantum image is encoded by the generalized affine transform. The encryption keys include the independent control parameters used in the generalized affine transform and the logistic map. Thus, the key space is large enough to frustrate the possible brute-force attack. Numerical simulations and analyses indicate that the proposed algorithm is realizable, robust and has a better performance than its classical counterpart in terms of computational complexity.

  7. An Efficient and Provable Secure Revocable Identity-Based Encryption Scheme

    PubMed Central

    Wang, Changji; Li, Yuan; Xia, Xiaonan; Zheng, Kangjia

    2014-01-01

    Revocation functionality is necessary and crucial to identity-based cryptosystems. Revocable identity-based encryption (RIBE) has attracted a lot of attention in recent years, many RIBE schemes have been proposed in the literature but shown to be either insecure or inefficient. In this paper, we propose a new scalable RIBE scheme with decryption key exposure resilience by combining Lewko and Waters’ identity-based encryption scheme and complete subtree method, and prove our RIBE scheme to be semantically secure using dual system encryption methodology. Compared to existing scalable and semantically secure RIBE schemes, our proposed RIBE scheme is more efficient in term of ciphertext size, public parameters size and decryption cost at price of a little looser security reduction. To the best of our knowledge, this is the first construction of scalable and semantically secure RIBE scheme with constant size public system parameters. PMID:25238418

  8. Encryption for Remote Control via Internet or Intranet

    NASA Technical Reports Server (NTRS)

    Lineberger, Lewis

    2005-01-01

    A data-communication protocol has been devised to enable secure, reliable remote control of processes and equipment via a collision-based network, while using minimal bandwidth and computation. The network could be the Internet or an intranet. Control is made secure by use of both a password and a dynamic key, which is sent transparently to a remote user by the controlled computer (that is, the computer, located at the site of the equipment or process to be controlled, that exerts direct control over the process). The protocol functions in the presence of network latency, overcomes errors caused by missed dynamic keys, and defeats attempts by unauthorized remote users to gain control. The protocol is not suitable for real-time control, but is well suited for applications in which control latencies up to about 0.5 second are acceptable. The encryption scheme involves the use of both a dynamic and a private key, without any additional overhead that would degrade performance. The dynamic key is embedded in the equipment- or process-monitor data packets sent out by the controlled computer: in other words, the dynamic key is a subset of the data in each such data packet. The controlled computer maintains a history of the last 3 to 5 data packets for use in decrypting incoming control commands. In addition, the controlled computer records a private key (password) that is given to the remote computer. The encrypted incoming command is permuted by both the dynamic and private key. A person who records the command data in a given packet for hostile purposes cannot use that packet after the public key expires (typically within 3 seconds). Even a person in possession of an unauthorized copy of the command/remote-display software cannot use that software in the absence of the password. The use of a dynamic key embedded in the outgoing data makes the central-processing unit overhead very small. The use of a National Instruments DataSocket(TradeMark) (or equivalent) protocol or

  9. An Encryption Scheme for Communication Internet SCADA Components

    NASA Astrophysics Data System (ADS)

    Robles, Rosslin John; Kim, Tai-Hoon

    The trend in most systems is that they are connected through the Internet. Traditional Supervisory Control and Data Acquisition Systems (SCADA) is connected only in a limited private network. SCADA is considered a critical infrastructure, and connecting to the internet is putting the society on jeopardy, some operators hold back on connecting it to the internet. But since the internet Supervisory Control and Data Acquisition Systems (SCADA) facility has brought a lot of advantages in terms of control, data viewing and generation. Along with these advantages, are security issues regarding web SCADA, operators are pushed to connect Supervisory Control and Data Acquisition Systems (SCADA) through the internet. Because of this, many issues regarding security surfaced. In this paper, we discuss web SCADA and the issues regarding security. As a countermeasure, a web SCADA security solution using crossed-crypto-scheme is proposed to be used in the communication of SCADA components.

  10. Digital breast tomosynthesis with minimal breast compression

    NASA Astrophysics Data System (ADS)

    Scaduto, David A.; Yang, Min; Ripton-Snyder, Jennifer; Fisher, Paul R.; Zhao, Wei

    2015-03-01

    Breast compression is utilized in mammography to improve image quality and reduce radiation dose. Lesion conspicuity is improved by reducing scatter effects on contrast and by reducing the superposition of tissue structures. However, patient discomfort due to breast compression has been cited as a potential cause of noncompliance with recommended screening practices. Further, compression may also occlude blood flow in the breast, complicating imaging with intravenous contrast agents and preventing accurate quantification of contrast enhancement and kinetics. Previous studies have investigated reducing breast compression in planar mammography and digital breast tomosynthesis (DBT), though this typically comes at the expense of degradation in image quality or increase in mean glandular dose (MGD). We propose to optimize the image acquisition technique for reduced compression in DBT without compromising image quality or increasing MGD. A zero-frequency signal-difference-to-noise ratio model is employed to investigate the relationship between tube potential, SDNR and MGD. Phantom and patient images are acquired on a prototype DBT system using the optimized imaging parameters and are assessed for image quality and lesion conspicuity. A preliminary assessment of patient motion during DBT with minimal compression is presented.

  11. A sensitive data extraction algorithm based on the content associated encryption technology for ICS

    NASA Astrophysics Data System (ADS)

    Wang, Wei; Hao, Huang; Xie, Changsheng

    With the development of HD video, the protection of copyright becomes more complicated. More advanced copyright protection technology is needed. Traditional digital copyright protection technology generally uses direct or selective encryption algorithm and the key does not associate with the video content [1]. Once the encryption method is cracked or the key is stolen, the copyright of the video will be violated. To address this issue, this paper proposes a Sensitive Data Extraction Algorithm (SDEA) based on the content associated encryption technology which applies to the Internet Certification Service (ICS). The principle of content associated encryption is to extract some data from the video and use this extracted data as the key to encrypt the rest data. The extracted part from video is called sensitive data, and the rest part is called the main data. After extraction, the main data will not be played or poorly played. The encrypted sensitive data reach the terminal device through the safety certificated network and the main data are through ICS disc. The terminal equipments are responsible for synthesizing and playing these two parts of data. Consequently, even if the main data on disc is illegally obtained, the video cannot be played normally due to the lack of necessary sensitive data. It is proved by experiments that ICS using SDEA can destruct the video effectively with 0.25% extraction rates and the destructed video cannot be played well. It can also guarantee the consistency of the destructive effect on different videos with different contents. The sensitive data can be transported smoothly under the home Internet bandwidth.

  12. Multi-image encryption based on synchronization of chaotic lasers and iris authentication

    NASA Astrophysics Data System (ADS)

    Banerjee, Santo; Mukhopadhyay, Sumona; Rondoni, Lamberto

    2012-07-01

    A new technique of transmitting encrypted combinations of gray scaled and chromatic images using chaotic lasers derived from Maxwell-Bloch's equations has been proposed. This novel scheme utilizes the general method of solution of a set of linear equations to transmit similar sized heterogeneous images which are a combination of monochrome and chromatic images. The chaos encrypted gray scaled images are concatenated along the three color planes resulting in color images. These are then transmitted over a secure channel along with a cover image which is an iris scan. The entire cryptology is augmented with an iris-based authentication scheme. The secret messages are retrieved once the authentication is successful. The objective of our work is briefly outlined as (a) the biometric information is the iris which is encrypted before transmission, (b) the iris is used for personal identification and verifying for message integrity, (c) the information is transmitted securely which are colored images resulting from a combination of gray images, (d) each of the images transmitted are encrypted through chaos based cryptography, (e) these encrypted multiple images are then coupled with the iris through linear combination of images before being communicated over the network. The several layers of encryption together with the ergodicity and randomness of chaos render enough confusion and diffusion properties which guarantee a fool-proof approach in achieving secure communication as demonstrated by exhaustive statistical methods. The result is vital from the perspective of opening a fundamental new dimension in multiplexing and simultaneous transmission of several monochromatic and chromatic images along with biometry based authentication and cryptography.

  13. A novel chaotic based image encryption using a hybrid model of deoxyribonucleic acid and cellular automata

    NASA Astrophysics Data System (ADS)

    Enayatifar, Rasul; Sadaei, Hossein Javedani; Abdullah, Abdul Hanan; Lee, Malrey; Isnin, Ismail Fauzi

    2015-08-01

    Currently, there are many studies have conducted on developing security of the digital image in order to protect such data while they are sending on the internet. This work aims to propose a new approach based on a hybrid model of the Tinkerbell chaotic map, deoxyribonucleic acid (DNA) and cellular automata (CA). DNA rules, DNA sequence XOR operator and CA rules are used simultaneously to encrypt the plain-image pixels. To determine rule number in DNA sequence and also CA, a 2-dimension Tinkerbell chaotic map is employed. Experimental results and computer simulations, both confirm that the proposed scheme not only demonstrates outstanding encryption, but also resists various typical attacks.

  14. An encryption scheme based on phase-shifting digital holography and amplitude-phase disturbance

    NASA Astrophysics Data System (ADS)

    Hua, Li-Li; Xu, Ning; Yang, Geng

    2014-06-01

    In this paper, we propose an encryption scheme based on phase-shifting digital interferometry. According to the original system framework, we add a random amplitude mask and replace the Fourier transform by the Fresnel transform. We develop a mathematical model and give a discrete formula based on the scheme, which makes it easy to implement the scheme in computer programming. The experimental results show that the improved system has a better performance in security than the original encryption method. Moreover, it demonstrates a good capability of anti-noise and anti-shear robustness.

  15. Novel Image Encryption Scheme Based on Chebyshev Polynomial and Duffing Map

    PubMed Central

    2014-01-01

    We present a novel image encryption algorithm using Chebyshev polynomial based on permutation and substitution and Duffing map based on substitution. Comprehensive security analysis has been performed on the designed scheme using key space analysis, visual testing, histogram analysis, information entropy calculation, correlation coefficient analysis, differential analysis, key sensitivity test, and speed test. The study demonstrates that the proposed image encryption algorithm shows advantages of more than 10113 key space and desirable level of security based on the good statistical results and theoretical arguments. PMID:25143970

  16. Fast and secure encryption-decryption method based on chaotic dynamics

    DOEpatents

    Protopopescu, Vladimir A.; Santoro, Robert T.; Tolliver, Johnny S.

    1995-01-01

    A method and system for the secure encryption of information. The method comprises the steps of dividing a message of length L into its character components; generating m chaotic iterates from m independent chaotic maps; producing an "initial" value based upon the m chaotic iterates; transforming the "initial" value to create a pseudo-random integer; repeating the steps of generating, producing and transforming until a pseudo-random integer sequence of length L is created; and encrypting the message as ciphertext based upon the pseudo random integer sequence. A system for accomplishing the invention is also provided.

  17. Lag Synchronization of Switched Neural Networks via Neural Activation Function and Applications in Image Encryption.

    PubMed

    Wen, Shiping; Zeng, Zhigang; Huang, Tingwen; Meng, Qinggang; Yao, Wei

    2015-07-01

    This paper investigates the problem of global exponential lag synchronization of a class of switched neural networks with time-varying delays via neural activation function and applications in image encryption. The controller is dependent on the output of the system in the case of packed circuits, since it is hard to measure the inner state of the circuits. Thus, it is critical to design the controller based on the neuron activation function. Comparing the results, in this paper, with the existing ones shows that we improve and generalize the results derived in the previous literature. Several examples are also given to illustrate the effectiveness and potential applications in image encryption. PMID:25594985

  18. Analyses of S-Box in Image Encryption Applications Based on Fuzzy Decision Making Criterion

    NASA Astrophysics Data System (ADS)

    Rehman, Inayatur; Shah, Tariq; Hussain, Iqtadar

    2014-06-01

    In this manuscript, we put forward a standard based on fuzzy decision making criterion to examine the current substitution boxes and study their strengths and weaknesses in order to decide their appropriateness in image encryption applications. The proposed standard utilizes the results of correlation analysis, entropy analysis, contrast analysis, homogeneity analysis, energy analysis, and mean of absolute deviation analysis. These analyses are applied to well-known substitution boxes. The outcome of these analyses are additional observed and a fuzzy soft set decision making criterion is used to decide the suitability of an S-box to image encryption applications.

  19. Lossy Text Compression Techniques

    NASA Astrophysics Data System (ADS)

    Palaniappan, Venka; Latifi, Shahram

    Most text documents contain a large amount of redundancy. Data compression can be used to minimize this redundancy and increase transmission efficiency or save storage space. Several text compression algorithms have been introduced for lossless text compression used in critical application areas. For non-critical applications, we could use lossy text compression to improve compression efficiency. In this paper, we propose three different source models for character-based lossy text compression: Dropped Vowels (DOV), Letter Mapping (LMP), and Replacement of Characters (ROC). The working principles and transformation methods associated with these methods are presented. Compression ratios obtained are included and compared. Comparisons of performance with those of the Huffman Coding and Arithmetic Coding algorithm are also made. Finally, some ideas for further improving the performance already obtained are proposed.

  20. Hardware Accelerated Compression of LIDAR Data Using FPGA Devices

    PubMed Central

    Biasizzo, Anton; Novak, Franc

    2013-01-01

    Airborne Light Detection and Ranging (LIDAR) has become a mainstream technology for terrain data acquisition and mapping. High sampling density of LIDAR enables the acquisition of high details of the terrain, but on the other hand, it results in a vast amount of gathered data, which requires huge storage space as well as substantial processing effort. The data are usually stored in the LAS format which has become the de facto standard for LIDAR data storage and exchange. In the paper, a hardware accelerated compression of LIDAR data is presented. The compression and decompression of LIDAR data is performed by a dedicated FPGA-based circuit and interfaced to the computer via a PCI-E general bus. The hardware compressor consists of three modules: LIDAR data predictor, variable length coder, and arithmetic coder. Hardware compression is considerably faster than software compression, while it also alleviates the processor load. PMID:23673680

  1. Radiological Image Compression

    NASA Astrophysics Data System (ADS)

    Lo, Shih-Chung Benedict

    The movement toward digital images in radiology presents the problem of how to conveniently and economically store, retrieve, and transmit the volume of digital images. Basic research into image data compression is necessary in order to move from a film-based department to an efficient digital -based department. Digital data compression technology consists of two types of compression technique: error-free and irreversible. Error -free image compression is desired; however, present techniques can only achieve compression ratio of from 1.5:1 to 3:1, depending upon the image characteristics. Irreversible image compression can achieve a much higher compression ratio; however, the image reconstructed from the compressed data shows some difference from the original image. This dissertation studies both error-free and irreversible image compression techniques. In particular, some modified error-free techniques have been tested and the recommended strategies for various radiological images are discussed. A full-frame bit-allocation irreversible compression technique has been derived. A total of 76 images which include CT head and body, and radiographs digitized to 2048 x 2048, 1024 x 1024, and 512 x 512 have been used to test this algorithm. The normalized mean -square-error (NMSE) on the difference image, defined as the difference between the original and the reconstructed image from a given compression ratio, is used as a global measurement on the quality of the reconstructed image. The NMSE's of total of 380 reconstructed and 380 difference images are measured and the results tabulated. Three complex compression methods are also suggested to compress images with special characteristics. Finally, various parameters which would effect the quality of the reconstructed images are discussed. A proposed hardware compression module is given in the last chapter.

  2. Compression and storage of multiple images with modulating blazed gratings

    NASA Astrophysics Data System (ADS)

    Yin, Shen; Tao, Shaohua

    2013-07-01

    A method for compressing, storing and reconstructing high-volume data is presented in this paper. Blazed gratings with different orientations and blaze angles are used to superpose many grayscaled images, and customized spatial filters are used to selectively recover the corresponding images from the diffraction spots of the superposed images. The simulation shows that as many as 198 images with a size of 512 pixels × 512 pixels can be stored in a diffractive optical element (DOE) with complex amplitudes of the same size, and the recovered images from the DOE are discernible with high visual quality. Optical encryption/decryption can also be added to the digitized DOE to enhance the security of the stored data.

  3. Advanced data compression promises the next big leap in network performance

    NASA Astrophysics Data System (ADS)

    Holtz, Klaus E.; Holtz, Eric S.; Kalienky, Diana

    1998-09-01

    Three recently introduced technologies: a new Autosophy information theory; fast Content Addressable Memories; and Packet Switching protocols, are combined in data compression chipsets to improve network throughput with real-time lossless text and image compression. Compared with the cost of putting new cables into the ground or launching new satellites, data compression chipsets offer a much less expensive alternative for improving the bandwidth of broadband communication networks. Data compression is based on a new Autosophy information theory in which, in contrast to Shannon's theory, communication is determined only by the data content. In addition to high lossless data compression, this also provides virtually unbreakable 'codebook' encryption and easier communication via packet switching networks. The Autosophy theories provide eight known classes of self-learning Omni Dimensional Networks. Only the serial network is explained here for use in compressed text and video communications. A new Content Addressable Read Only Memory (CAROM) may increase data compression speed to more than 20 Million symbols per second, fast enough for virtually any network speed.

  4. Language Acquisition without an Acquisition Device

    ERIC Educational Resources Information Center

    O'Grady, William

    2012-01-01

    Most explanatory work on first and second language learning assumes the primacy of the acquisition phenomenon itself, and a good deal of work has been devoted to the search for an "acquisition device" that is specific to humans, and perhaps even to language. I will consider the possibility that this strategy is misguided and that language…

  5. Photon counting compressive depth mapping.

    PubMed

    Howland, Gregory A; Lum, Daniel J; Ware, Matthew R; Howell, John C

    2013-10-01

    We demonstrate a compressed sensing, photon counting lidar system based on the single-pixel camera. Our technique recovers both depth and intensity maps from a single under-sampled set of incoherent, linear projections of a scene of interest at ultra-low light levels around 0.5 picowatts. Only two-dimensional reconstructions are required to image a three-dimensional scene. We demonstrate intensity imaging and depth mapping at 256 × 256 pixel transverse resolution with acquisition times as short as 3 seconds. We also show novelty filtering, reconstructing only the difference between two instances of a scene. Finally, we acquire 32 × 32 pixel real-time video for three-dimensional object tracking at 14 frames-per-second. PMID:24104293

  6. Compressive rendering: a rendering application of compressed sensing.

    PubMed

    Sen, Pradeep; Darabi, Soheil

    2011-04-01

    Recently, there has been growing interest in compressed sensing (CS), the new theory that shows how a small set of linear measurements can be used to reconstruct a signal if it is sparse in a transform domain. Although CS has been applied to many problems in other fields, in computer graphics, it has only been used so far to accelerate the acquisition of light transport. In this paper, we propose a novel application of compressed sensing by using it to accelerate ray-traced rendering in a manner that exploits the sparsity of the final image in the wavelet basis. To do this, we raytrace only a subset of the pixel samples in the spatial domain and use a simple, greedy CS-based algorithm to estimate the wavelet transform of the image during rendering. Since the energy of the image is concentrated more compactly in the wavelet domain, less samples are required for a result of given quality than with conventional spatial-domain rendering. By taking the inverse wavelet transform of the result, we compute an accurate reconstruction of the desired final image. Our results show that our framework can achieve high-quality images with approximately 75 percent of the pixel samples using a nonadaptive sampling scheme. In addition, we also perform better than other algorithms that might be used to fill in the missing pixel data, such as interpolation or inpainting. Furthermore, since the algorithm works in image space, it is completely independent of scene complexity. PMID:21311092

  7. Encryption techniques to the design of e-beam-generated digital pixel hologram for anti-counterfeiting

    NASA Astrophysics Data System (ADS)

    Chan, Hau P.; Bao, Nai-Keng; Kwok, Wing O.; Wong, Wing H.

    2002-04-01

    The application of Digital Pixel Hologram (DPH) as anti-counterfeiting technology for products such as commercial goods, credit cards, identity cards, paper money banknote etc. is growing important nowadays. It offers many advantages over other anti-counterfeiting tools and this includes high diffraction effect, high resolving power, resistance to photo copying using two-dimensional Xeroxes, potential for mass production of patterns at a very low cost. Recently, we have successfully in fabricating high definition DPH with resolution higher than 2500dpi for the purpose of anti-counterfeiting by applying modern optical diffraction theory to computer pattern generation technique with the assist of electron beam lithography (EBL). In this paper, we introduce five levels of encryption techniques, which can be embedded in the design of such DPHs to further improve its anti-counterfeiting performance with negligible added on cost. The techniques involved, in the ascending order of decryption complexity, are namely Gray-level Encryption, Pattern Encryption, Character Encryption, Image Modification Encryption and Codebook Encryption. A Hong Kong Special Administration Regions (HKSAR) DPH emblem was fabricated at a resolution of 2540dpi using the facilities housed in our Optoelectronics Research Center. This emblem will be used as an illustration to discuss in details about each encryption idea during the conference.

  8. Security Encryption Scheme for Communication of Web Based Control Systems

    NASA Astrophysics Data System (ADS)

    Robles, Rosslin John; Kim, Tai-Hoon

    A control system is a device or set of devices to manage, command, direct or regulate the behavior of other devices or systems. The trend in most systems is that they are connected through the Internet. Traditional Supervisory Control and Data Acquisition Systems (SCADA) is connected only in a limited private network Since the internet Supervisory Control and Data Acquisition Systems (SCADA) facility has brought a lot of advantages in terms of control, data viewing and generation. Along with these advantages, are security issues regarding web SCADA, operators are pushed to connect Control Systems through the internet. Because of this, many issues regarding security surfaced. In this paper, we discuss web SCADA and the issues regarding security. As a countermeasure, a web SCADA security solution using crossed-crypto-scheme is proposed to be used in the communication of SCADA components.

  9. Two-chip implementation of the RSA public-key encryption algorithm

    SciTech Connect

    Rieden, R.F.; Snyder, J.B.; Widman, R.J.; Barnard, W.J.

    1982-01-01

    A system has been developed which employs two identical integrated circuits to perform the encryption algorithm developed by Rivest, Shamir, and Adleman (RSA) on a 336-bit message. The integrated circuit used in the system employs the 3-micron polysilicon gate, radiation-hard, CMOS technology developed at Sandia National Laboratories.

  10. 76 FR 66666 - Basic Service Tier Encryption Compatibility Between Cable Systems and Consumer Electronics Equipment

    Federal Register 2010, 2011, 2012, 2013, 2014

    2011-10-27

    ...In this document, we propose a new rule to allow cable operators to encrypt the basic service tier in all-digital systems, provided that those cable operators undertake certain consumer protection measures for a limited period of time in order to minimize any potential subscriber...

  11. 77 FR 67290 - Basic Service Tier Encryption Compatibility Between Cable Systems and Consumer Electronics Equipment

    Federal Register 2010, 2011, 2012, 2013, 2014

    2012-11-09

    ... Electronics Equipment AGENCY: Federal Communications Commission. ACTION: Final rule. SUMMARY: In this document... between consumer electronics equipment (such as digital television sets) and newly encrypted cable service...''), Congress sought to make sure that consumer electronics equipment could receive cable programming and...

  12. The Application Research of MD5 Encryption Algorithm in DCT Digital Watermarking

    NASA Astrophysics Data System (ADS)

    Xijin, Wang; Linxiu, Fan

    This article did the preliminary study of the application of algorithm for MD5 in the digital watermark. It proposed that copyright information will be encrypted using an algorithm MD5, and made rules for the second value image watermarks, through DCT algorithm that embeds an image by the carrier. The extraction algorithms can pick up the watermark and restore MD5 code.

  13. Digital color encryption using a multi-wavelength source and a joint transform correlator

    NASA Astrophysics Data System (ADS)

    Amaya, Dafne; Tebaldi, Myrian; Torroba, Roberto; Bolognini, Néstor

    2008-04-01

    We propose a color image encryption by using digital joint transform correlator (JTC) architecture and wavelength multiplexing. In this arrangement, the color image to be encrypted is separated into three channels: red, green and blue. One JTC aperture has the information corresponding to a determined color channel embedded in a phase mask (object aperture), and the other JTC aperture contains the encrypting phase mask. The joint power spectrum reflects a behavior according to the double-aperture content and the illumination wavelength. The wavelength variation will produce a corresponding power spectrum change. The basic concept within this approach is that the speckle size is wavelength-dependent. Then, the wavelength change can be used to store the encrypted information associated to each color channel in the same media. We achieve the color storing by changing the illumination wavelength, while varying the color image content in the object aperture of the JTC architecture. The multiplexed power spectrum, which is sent to the authorizer receiver, does reveal neither the multiplexing operation nor the amount of stored information. We present digital results that confirm our approach.

  14. Image feature extraction in encrypted domain with privacy-preserving SIFT.

    PubMed

    Hsu, Chao-Yung; Lu, Chun-Shien; Pei, Soo-Chang

    2012-11-01

    Privacy has received considerable attention but is still largely ignored in the multimedia community. Consider a cloud computing scenario where the server is resource-abundant, and is capable of finishing the designated tasks. It is envisioned that secure media applications with privacy preservation will be treated seriously. In view of the fact that scale-invariant feature transform (SIFT) has been widely adopted in various fields, this paper is the first to target the importance of privacy-preserving SIFT (PPSIFT) and to address the problem of secure SIFT feature extraction and representation in the encrypted domain. As all of the operations in SIFT must be moved to the encrypted domain, we propose a privacy-preserving realization of the SIFT method based on homomorphic encryption. We show through the security analysis based on the discrete logarithm problem and RSA that PPSIFT is secure against ciphertext only attack and known plaintext attack. Experimental results obtained from different case studies demonstrate that the proposed homomorphic encryption-based privacy-preserving SIFT performs comparably to the original SIFT and that our method is useful in SIFT-based privacy-preserving applications. PMID:22711774

  15. Optical image encryption based on cascaded iterative angular spectrum algorithm and its implementation with parallel hardware

    NASA Astrophysics Data System (ADS)

    Yu, Biin; Peng, Xiang; Tian, Jindong; Niu, Hanben

    2006-01-01

    A cascaded iterative angular spectrum approach (CIASA) based on the methodology of virtual optics is presented for optical security applications. The technique encodes the target image into two different phase only masks (POM) using a concept of free-space angular spectrum propagation. The two phase-masks are designed and located in any two arbitrary planes interrelated through the free space propagation domain in order to implement the optical encryption or authenticity verification. And both phase masks can serve as enciphered texts. Compared with previous methods, the proposed algorithm employs an improved searching strategy: modifying the phase-distributions of both masks synchronously as well as enlarging the searching space. And with such a scheme, we make use of a high performance floating-point Digital Signal Processor (DSP) to accomplish a design of multiple-locks and multiple-keys optical image encryption system. An evaluation of the system performance is made and it is shown that the algorithm results in much faster convergence and better image quality for the recovered image. And two masks and system parameters can be used to design keys for image encryption, therefore the decrypted image can be obtained only when all these keys are under authorization. This key-assignment strategy may reduce the risk of being intruded and show a high security level. These characters may introduce a high level security that makes the encrypted image more difficult to be decrypted by an unauthorized person.

  16. Optical color-image encryption in the diffractive-imaging scheme

    NASA Astrophysics Data System (ADS)

    Qin, Yi; Wang, Zhipeng; Pan, Qunna; Gong, Qiong

    2016-02-01

    By introducing the theta modulation technique into the diffractive-imaging-based optical scheme, we propose a novel approach for color image encryption. For encryption, a color image is divided into three channels, i.e., red, green and blue, and thereafter these components are appended by redundant data before being sent to the encryption scheme. The carefully designed optical setup, which comprises of three 4f optical architectures and a diffractive-imaging-based optical scheme, could encode the three plaintexts into a single noise-like intensity pattern. For the decryption, an iterative phase retrieval algorithm, together with a filter operation, is applied to extract the primary color images from the diffraction intensity map. Compared with previous methods, our proposal has successfully encrypted a color rather than grayscale image into a single intensity pattern, as a result of which the capacity and practicability have been remarkably enhanced. In addition, the performance and the security of it are also investigated. The validity as well as feasibility of the proposed method is supported by numerical simulations.

  17. Symmetric encryption algorithms using chaotic and non-chaotic generators: A review

    PubMed Central

    Radwan, Ahmed G.; AbdElHaleem, Sherif H.; Abd-El-Hafiz, Salwa K.

    2015-01-01

    This paper summarizes the symmetric image encryption results of 27 different algorithms, which include substitution-only, permutation-only or both phases. The cores of these algorithms are based on several discrete chaotic maps (Arnold’s cat map and a combination of three generalized maps), one continuous chaotic system (Lorenz) and two non-chaotic generators (fractals and chess-based algorithms). Each algorithm has been analyzed by the correlation coefficients between pixels (horizontal, vertical and diagonal), differential attack measures, Mean Square Error (MSE), entropy, sensitivity analyses and the 15 standard tests of the National Institute of Standards and Technology (NIST) SP-800-22 statistical suite. The analyzed algorithms include a set of new image encryption algorithms based on non-chaotic generators, either using substitution only (using fractals) and permutation only (chess-based) or both. Moreover, two different permutation scenarios are presented where the permutation-phase has or does not have a relationship with the input image through an ON/OFF switch. Different encryption-key lengths and complexities are provided from short to long key to persist brute-force attacks. In addition, sensitivities of those different techniques to a one bit change in the input parameters of the substitution key as well as the permutation key are assessed. Finally, a comparative discussion of this work versus many recent research with respect to the used generators, type of encryption, and analyses is presented to highlight the strengths and added contribution of this paper. PMID:26966561

  18. 75 FR 36481 - Encryption Export Controls: Revision of License Exception ENC and Mass Market Eligibility...

    Federal Register 2010, 2011, 2012, 2013, 2014

    2010-06-25

    ... technology for ``cryptanalytic items,'' ``non-standard cryptography,'' or ``open cryptographic interfaces... Trunked Radio (TETRA) and ``P25'' standards. This is a clarification and does not change the license....17(b)(2)(iv) differentiates between ``non-standard cryptography'' and other encryption...

  19. Hybrid optical-digital encryption system based on wavefront coding paradigm

    NASA Astrophysics Data System (ADS)

    Konnik, Mikhail V.

    2012-04-01

    The wavefront coding is a widely used in the optical systems to compensate aberrations and increase the depth of field. This paper presents experimental results on application of the wavefront coding paradigm for data encryption. We use a synthesised diffractive optical element (DOE) to deliberately introduce a phase distortion during the images registration process to encode the acquired image. In this case, an optical convolution of the input image with the point spread function (PSF) of the DOE is registered. The encryption is performed optically, and is therefore is fast and secure. Since the introduced distortion is the same across the image, the decryption is performed digitally using deconvolution methods. However, due to noise and finite accuracy of a photosensor, the reconstructed image is degraded but still readable. The experimental results, which are presented in this paper, indicate that the proposed hybrid optical-digital system can be implemented as a portable device using inexpensive off-the-shelf components. We present the results of optical encryption and digital restoration with quantitative estimations of the images quality. Details of hardware optical implementation of the hybrid optical-digital encryption system are discussed.

  20. Standards Setting and Federal Information Policy: The Escrowed Encryption Standard (EES).

    ERIC Educational Resources Information Center

    Gegner, Karen E.; Veeder, Stacy B.

    1994-01-01

    Examines the standards process used for developing the Escrowed Encryption Standard (EES) and its possible impact on national communication and information policies. Discusses the balance between national security and law enforcement concerns versus privacy rights and economic competitiveness in the area of foreign trade and export controls. (67…

  1. A novel photo-responsive europium(iii) complex for advanced anti-counterfeiting and encryption.

    PubMed

    Mei, Jin-Feng; Lv, Zhong-Peng; Lai, Jian-Cheng; Jia, Xiao-Yong; Li, Cheng-Hui; Zuo, Jing-Lin; You, Xiao-Zeng

    2016-04-01

    A novel europium(iii) complex simultaneously exhibiting photocolorimetric and photofluorometric behavior was obtained. Multiple distinguishable identities can be obtained and reversibly modulated using light as external stimuli. With this novel photo-responsive complex, double encryption and advanced anti-counterfeiting were realized. PMID:26961725

  2. 15 CFR 740.17 - Encryption commodities, software and technology (ENC).

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    ... technology (ENC). 740.17 Section 740.17 Commerce and Foreign Trade Regulations Relating to Commerce and... REGULATIONS LICENSE EXCEPTIONS § 740.17 Encryption commodities, software and technology (ENC). License... classified under ECCNs 5A002.a.1, a.2, a.5, a.6 or a.9, 5B002, 5D002, and technology that is classified...

  3. Chaotic Image Encryption Based on Running-Key Related to Plaintext

    PubMed Central

    Guanghui, Cao; Kai, Hu; Yizhi, Zhang; Jun, Zhou; Xing, Zhang

    2014-01-01

    In the field of chaotic image encryption, the algorithm based on correlating key with plaintext has become a new developing direction. However, for this kind of algorithm, some shortcomings in resistance to reconstruction attack, efficient utilization of chaotic resource, and reducing dynamical degradation of digital chaos are found. In order to solve these problems and further enhance the security of encryption algorithm, based on disturbance and feedback mechanism, we present a new image encryption scheme. In the running-key generation stage, by successively disturbing chaotic stream with cipher-text, the relation of running-key to plaintext is established, reconstruction attack is avoided, effective use of chaotic resource is guaranteed, and dynamical degradation of digital chaos is minimized. In the image encryption stage, by introducing random-feedback mechanism, the difficulty of breaking this scheme is increased. Comparing with the-state-of-the-art algorithms, our scheme exhibits good properties such as large key space, long key period, and extreme sensitivity to the initial key and plaintext. Therefore, it can resist brute-force, reconstruction attack, and differential attack. PMID:24711727

  4. 15 CFR Supplement No. 8 to Part 742 - Self-Classification Report for Encryption Items

    Code of Federal Regulations, 2011 CFR

    2011-01-01

    ... descriptor, selected from one of the following: (i) Access point (ii) Cellular (iii) Computer (iv) Computer...) Key storage (xix) Link encryption (xx) Local area networking (LAN) (xxi) Metropolitan area networking... (xxviii) Network vulnerability and penetration testing (xxix) Operating system (xxx) Optical...

  5. 15 CFR Supplement No. 8 to Part 742 - Self-Classification Report for Encryption Items

    Code of Federal Regulations, 2013 CFR

    2013-01-01

    ... descriptor, selected from one of the following: (i) Access point (ii) Cellular (iii) Computer (iv) Computer...) Key storage (xix) Link encryption (xx) Local area networking (LAN) (xxi) Metropolitan area networking... (xxviii) Network vulnerability and penetration testing (xxix) Operating system (xxx) Optical...

  6. 15 CFR Supplement No. 8 to Part 742 - Self-Classification Report for Encryption Items

    Code of Federal Regulations, 2012 CFR

    2012-01-01

    ... descriptor, selected from one of the following: (i) Access point (ii) Cellular (iii) Computer (iv) Computer...) Key storage (xix) Link encryption (xx) Local area networking (LAN) (xxi) Metropolitan area networking... (xxviii) Network vulnerability and penetration testing (xxix) Operating system (xxx) Optical...

  7. 15 CFR Supplement No. 8 to Part 742 - Self-Classification Report for Encryption Items

    Code of Federal Regulations, 2014 CFR

    2014-01-01

    ... descriptor, selected from one of the following: (i) Access point (ii) Cellular (iii) Computer (iv) Computer...) Key storage (xix) Link encryption (xx) Local area networking (LAN) (xxi) Metropolitan area networking... (xxviii) Network vulnerability and penetration testing (xxix) Operating system (xxx) Optical...

  8. Symmetric encryption algorithms using chaotic and non-chaotic generators: A review.

    PubMed

    Radwan, Ahmed G; AbdElHaleem, Sherif H; Abd-El-Hafiz, Salwa K

    2016-03-01

    This paper summarizes the symmetric image encryption results of 27 different algorithms, which include substitution-only, permutation-only or both phases. The cores of these algorithms are based on several discrete chaotic maps (Arnold's cat map and a combination of three generalized maps), one continuous chaotic system (Lorenz) and two non-chaotic generators (fractals and chess-based algorithms). Each algorithm has been analyzed by the correlation coefficients between pixels (horizontal, vertical and diagonal), differential attack measures, Mean Square Error (MSE), entropy, sensitivity analyses and the 15 standard tests of the National Institute of Standards and Technology (NIST) SP-800-22 statistical suite. The analyzed algorithms include a set of new image encryption algorithms based on non-chaotic generators, either using substitution only (using fractals) and permutation only (chess-based) or both. Moreover, two different permutation scenarios are presented where the permutation-phase has or does not have a relationship with the input image through an ON/OFF switch. Different encryption-key lengths and complexities are provided from short to long key to persist brute-force attacks. In addition, sensitivities of those different techniques to a one bit change in the input parameters of the substitution key as well as the permutation key are assessed. Finally, a comparative discussion of this work versus many recent research with respect to the used generators, type of encryption, and analyses is presented to highlight the strengths and added contribution of this paper. PMID:26966561

  9. A network identity authentication protocol of bank account system based on fingerprint identification and mixed encryption

    NASA Astrophysics Data System (ADS)

    Zhu, Lijuan; Liu, Jingao

    2013-07-01

    This paper describes a network identity authentication protocol of bank account system based on fingerprint identification and mixed encryption. This protocol can provide every bank user a safe and effective way to manage his own bank account, and also can effectively prevent the hacker attacks and bank clerk crime, so that it is absolute to guarantee the legitimate rights and interests of bank users.

  10. Design of an image encryption scheme based on a multiple chaotic map

    NASA Astrophysics Data System (ADS)

    Tong, Xiao-Jun

    2013-07-01

    In order to solve the problem that chaos is degenerated in limited computer precision and Cat map is the small key space, this paper presents a chaotic map based on topological conjugacy and the chaotic characteristics are proved by Devaney definition. In order to produce a large key space, a Cat map named block Cat map is also designed for permutation process based on multiple-dimensional chaotic maps. The image encryption algorithm is based on permutation-substitution, and each key is controlled by different chaotic maps. The entropy analysis, differential analysis, weak-keys analysis, statistical analysis, cipher random analysis, and cipher sensibility analysis depending on key and plaintext are introduced to test the security of the new image encryption scheme. Through the comparison to the proposed scheme with AES, DES and Logistic encryption methods, we come to the conclusion that the image encryption method solves the problem of low precision of one dimensional chaotic function and has higher speed and higher security.

  11. Single-channel color image encryption using phase retrieve algorithm in fractional Fourier domain

    NASA Astrophysics Data System (ADS)

    Sui, Liansheng; Xin, Meiting; Tian, Ailing; Jin, Haiyan

    2013-12-01

    A single-channel color image encryption is proposed based on a phase retrieve algorithm and a two-coupled logistic map. Firstly, a gray scale image is constituted with three channels of the color image, and then permuted by a sequence of chaotic pairs generated by the two-coupled logistic map. Secondly, the permutation image is decomposed into three new components, where each component is encoded into a phase-only function in the fractional Fourier domain with a phase retrieve algorithm that is proposed based on the iterative fractional Fourier transform. Finally, an interim image is formed by the combination of these phase-only functions and encrypted into the final gray scale ciphertext with stationary white noise distribution by using chaotic diffusion, which has camouflage property to some extent. In the process of encryption and decryption, chaotic permutation and diffusion makes the resultant image nonlinear and disorder both in spatial domain and frequency domain, and the proposed phase iterative algorithm has faster convergent speed. Additionally, the encryption scheme enlarges the key space of the cryptosystem. Simulation results and security analysis verify the feasibility and effectiveness of this method.

  12. FORESEE: Fully Outsourced secuRe gEnome Study basEd on homomorphic Encryption

    PubMed Central

    2015-01-01

    Background The increasing availability of genome data motivates massive research studies in personalized treatment and precision medicine. Public cloud services provide a flexible way to mitigate the storage and computation burden in conducting genome-wide association studies (GWAS). However, data privacy has been widely concerned when sharing the sensitive information in a cloud environment. Methods We presented a novel framework (FORESEE: Fully Outsourced secuRe gEnome Study basEd on homomorphic Encryption) to fully outsource GWAS (i.e., chi-square statistic computation) using homomorphic encryption. The proposed framework enables secure divisions over encrypted data. We introduced two division protocols (i.e., secure errorless division and secure approximation division) with a trade-off between complexity and accuracy in computing chi-square statistics. Results The proposed framework was evaluated for the task of chi-square statistic computation with two case-control datasets from the 2015 iDASH genome privacy protection challenge. Experimental results show that the performance of FORESEE can be significantly improved through algorithmic optimization and parallel computation. Remarkably, the secure approximation division provides significant performance gain, but without missing any significance SNPs in the chi-square association test using the aforementioned datasets. Conclusions Unlike many existing HME based studies, in which final results need to be computed by the data owner due to the lack of the secure division operation, the proposed FORESEE framework support complete outsourcing to the cloud and output the final encrypted chi-square statistics. PMID:26733391

  13. Phase-only optical encryption based on the zeroth-order phase-contrast technique

    NASA Astrophysics Data System (ADS)

    Pizolato, José Carlos; Neto, Luiz Gonçalves

    2009-09-01

    A phase-only encryption/decryption scheme with the readout based on the zeroth-order phase-contrast technique (ZOPCT), without the use of a phase-changing plate on the Fourier plane of an optical system based on the 4f optical correlator, is proposed. The encryption of a gray-level image is achieved by multiplying the phase distribution obtained directly from the gray-level image by a random phase distribution. The robustness of the encoding is assured by the nonlinearity intrinsic to the proposed phase-contrast method and the random phase distribution used in the encryption process. The experimental system has been implemented with liquid-crystal spatial modulators to generate phase-encrypted masks and a decrypting key. The advantage of this method is the easy scheme to recover the gray-level information from the decrypted phase-only mask applying the ZOPCT. An analysis of this decryption method was performed against brute force attacks.

  14. A secure transmission scheme of streaming media based on the encrypted control message

    NASA Astrophysics Data System (ADS)

    Li, Bing; Jin, Zhigang; Shu, Yantai; Yu, Li

    2007-09-01

    As the use of streaming media applications increased dramatically in recent years, streaming media security becomes an important presumption, protecting the privacy. This paper proposes a new encryption scheme in view of characteristics of streaming media and the disadvantage of the living method: encrypt the control message in the streaming media with the high security lever and permute and confuse the data which is non control message according to the corresponding control message. Here the so-called control message refers to the key data of the streaming media, including the streaming media header and the header of the video frame, and the seed key. We encrypt the control message using the public key encryption algorithm which can provide high security lever, such as RSA. At the same time we make use of the seed key to generate key stream, from which the permutation list P responding to GOP (group of picture) is derived. The plain text of the non-control message XORs the key stream and gets the middle cipher text. And then obtained one is permutated according to P. In contrast the decryption process is the inverse process of the above. We have set up a testbed for the above scheme and found our scheme is six to eight times faster than the conventional method. It can be applied not only between PCs but also between handheld devices.

  15. On the security of gyrator transform-based image encryption by chosen-plaintext attack

    NASA Astrophysics Data System (ADS)

    Sang, Jun; Alam, Mohammad S.; Cai, Bin

    2016-04-01

    For the gyrator transform-based image encryption, besides the random operations, the rotation angles used in the gyrator transforms are also taken as the secret keys, which makes such cryptosystems to be more secure. To analyze the security of such cryptosystems, one may start from analyzing the security of a single gyrator transform. In this paper, the security of the gyrator transform-based image encryption by chosen-plaintext attack was discussed in theory. By using the impulse functions as the chosen-plaintext, it was concluded that: (1) For a single gyrator transform, by choosing a plaintext, the rotation angle can be obtained very easily and efficiently; (2) For image encryption with a single random phase encoding and a single gyrator transform, it is hard to find the rotation angle directly with a chosen-plaintext attack. However, assuming the value of one of the elements in the random phase mask is known, the rotation angle can be obtained very easily with a chosen-plaintext attack, and the random phase mask can also be recovered. Furthermore, by exhaustively searching the value of one of the elements in the random phase mask, the rotation angle as well as the random phase mask may be recovered. By obtaining the relationship between the rotation angle and the random phase mask for image encryption with a single random phase encoding and a single gyrator transform, it may be useful for further study on the security of the iterative random operations in the gyrator transform domains.

  16. 15 CFR Supplement No. 6 to Part 742 - Guidelines for Submitting Review Requests for Encryption Items

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    ... asymmetric encryption algorithms and key lengths and how the algorithms are used, including relevant... cipher block chaining mode). (2) State the key management algorithms, including modulus sizes, that are supported. (3) For products with proprietary algorithms, include a textual description and the source...

  17. A study of the environmental information acquisition system based on smart phones

    NASA Astrophysics Data System (ADS)

    Xu, Lingyan; Chen, Feixiang; Ni, Shaoliang; Wang, Ling; Wei, Chao; Gong, Bowen

    2010-08-01

    In this paper, it proposed a new environmental information acquisition system based on smart phones (Smartphone / Pocket PC) which combined with Geographic Information System (GIS), Global Positioning System (GPS), wireless communication technology in allusion to the current actual situation of environmental protection information acquisition in city environmental protection department. System architecture and working principle is analyzed, and it designs the main modules of the software and hardware. In addition, transport protocols and application of the implementation method have been discussed. Experiments show that the environmental information acquisition system has high precision, easy to use, information transfer with high efficiency and reliability. Not only have that, the paper also discusses the effective strategies of network transmission of data encryption and the image transmission rate improvement. In brief, it can effectively enhance the work efficiency of the city environmental protection department when they collect relevant information.

  18. Parallel image compression

    NASA Technical Reports Server (NTRS)

    Reif, John H.

    1987-01-01

    A parallel compression algorithm for the 16,384 processor MPP machine was developed. The serial version of the algorithm can be viewed as a combination of on-line dynamic lossless test compression techniques (which employ simple learning strategies) and vector quantization. These concepts are described. How these concepts are combined to form a new strategy for performing dynamic on-line lossy compression is discussed. Finally, the implementation of this algorithm in a massively parallel fashion on the MPP is discussed.

  19. EARLY SYNTACTIC ACQUISITION.

    ERIC Educational Resources Information Center

    KELLEY, K.L.

    THIS PAPER IS A STUDY OF A CHILD'S EARLIEST PRETRANSFORMATIONAL LANGUAGE ACQUISITION PROCESSES. A MODEL IS CONSTRUCTED BASED ON THE ASSUMPTIONS (1) THAT SYNTACTIC ACQUISITION OCCURS THROUGH THE TESTING OF HYPOTHESES REFLECTING THE INITIAL STRUCTURE OF THE ACQUISITION MECHANISM AND THE LANGUAGE DATA TO WHICH THE CHILD IS EXPOSED, AND (2) THAT…

  20. Micro-lens array based 3-D color image encryption using the combination of gravity model and Arnold transform

    NASA Astrophysics Data System (ADS)

    You, Suping; Lu, Yucheng; Zhang, Wei; Yang, Bo; Peng, Runling; Zhuang, Songlin

    2015-11-01

    This paper proposes a 3-D image encryption scheme based on micro-lens array. The 3-D image can be reconstructed by applying the digital refocusing algorithm to the picked-up light field. To improve the security of the cryptosystem, the Arnold transform and the Gravity Model based image encryption method are employed. Experiment results demonstrate the high security in key space of the proposed encryption scheme. The results also indicate that the employment of light field imaging significant strengthens the robustness of the cipher image against some conventional image processing attacks.

  1. Design and evaluation of basic standard encryption algorithm modules using nanosized complementary metal oxide semiconductor molecular circuits

    NASA Astrophysics Data System (ADS)

    Masoumi, Massoud; Raissi, Farshid; Ahmadian, Mahmoud; Keshavarzi, Parviz

    2006-01-01

    We are proposing that the recently proposed semiconductor-nanowire-molecular architecture (CMOL) is an optimum platform to realize encryption algorithms. The basic modules for the advanced encryption standard algorithm (Rijndael) have been designed using CMOL architecture. The performance of this design has been evaluated with respect to chip area and speed. It is observed that CMOL provides considerable improvement over implementation with regular CMOS architecture even with a 20% defect rate. Pseudo-optimum gate placement and routing are provided for Rijndael building blocks and the possibility of designing high speed, attack tolerant and long key encryptions are discussed.

  2. Privacy-preserving genome-wide association studies on cloud environment using fully homomorphic encryption

    PubMed Central

    2015-01-01

    Objective Developed sequencing techniques are yielding large-scale genomic data at low cost. A genome-wide association study (GWAS) targeting genetic variations that are significantly associated with a particular disease offers great potential for medical improvement. However, subjects who volunteer their genomic data expose themselves to the risk of privacy invasion; these privacy concerns prevent efficient genomic data sharing. Our goal is to presents a cryptographic solution to this problem. Methods To maintain the privacy of subjects, we propose encryption of all genotype and phenotype data. To allow the cloud to perform meaningful computation in relation to the encrypted data, we use a fully homomorphic encryption scheme. Noting that we can evaluate typical statistics for GWAS from a frequency table, our solution evaluates frequency tables with encrypted genomic and clinical data as input. We propose to use a packing technique for efficient evaluation of these frequency tables. Results Our solution supports evaluation of the D′ measure of linkage disequilibrium, the Hardy-Weinberg Equilibrium, the χ2 test, etc. In this paper, we take χ2 test and linkage disequilibrium as examples and demonstrate how we can conduct these algorithms securely and efficiently in an outsourcing setting. We demonstrate with experimentation that secure outsourcing computation of one χ2 test with 10, 000 subjects requires about 35 ms and evaluation of one linkage disequilibrium with 10, 000 subjects requires about 80 ms. Conclusions With appropriate encoding and packing technique, cryptographic solutions based on fully homomorphic encryption for secure computations of GWAS can be practical. PMID:26732892

  3. Idaho National Laboratory Supervisory Control and Data Acquisition Intrusion Detection System (SCADA IDS)

    SciTech Connect

    Jared Verba; Michael Milvich

    2008-05-01

    Current Intrusion Detection System (IDS) technology is not suited to be widely deployed inside a Supervisory, Control and Data Acquisition (SCADA) environment. Anomaly- and signature-based IDS technologies have developed methods to cover information technology-based networks activity and protocols effectively. However, these IDS technologies do not include the fine protocol granularity required to ensure network security inside an environment with weak protocols lacking authentication and encryption. By implementing a more specific and more intelligent packet inspection mechanism, tailored traffic flow analysis, and unique packet tampering detection, IDS technology developed specifically for SCADA environments can be deployed with confidence in detecting malicious activity.

  4. Multiple channel data acquisition system

    DOEpatents

    Crawley, H. Bert; Rosenberg, Eli I.; Meyer, W. Thomas; Gorbics, Mark S.; Thomas, William D.; McKay, Roy L.; Homer, Jr., John F.

    1990-05-22

    A multiple channel data acquisition system for the transfer of large amounts of data from a multiplicity of data channels has a plurality of modules which operate in parallel to convert analog signals to digital data and transfer that data to a communications host via a FASTBUS. Each module has a plurality of submodules which include a front end buffer (FEB) connected to input circuitry having an analog to digital converter with cache memory for each of a plurality of channels. The submodules are interfaced with the FASTBUS via a FASTBUS coupler which controls a module bus and a module memory. The system is triggered to effect rapid parallel data samplings which are stored to the cache memories. The cache memories are uploaded to the FEBs during which zero suppression occurs. The data in the FEBs is reformatted and compressed by a local processor during transfer to the module memory. The FASTBUS coupler is used by the communications host to upload the compressed and formatted data from the module memory. The local processor executes programs which are downloaded to the module memory through the FASTBUS coupler.

  5. Multiple channel data acquisition system

    DOEpatents

    Crawley, H.B.; Rosenberg, E.I.; Meyer, W.T.; Gorbics, M.S.; Thomas, W.D.; McKay, R.L.; Homer, J.F. Jr.

    1990-05-22

    A multiple channel data acquisition system for the transfer of large amounts of data from a multiplicity of data channels has a plurality of modules which operate in parallel to convert analog signals to digital data and transfer that data to a communications host via a FASTBUS. Each module has a plurality of submodules which include a front end buffer (FEB) connected to input circuitry having an analog to digital converter with cache memory for each of a plurality of channels. The submodules are interfaced with the FASTBUS via a FASTBUS coupler which controls a module bus and a module memory. The system is triggered to effect rapid parallel data samplings which are stored to the cache memories. The cache memories are uploaded to the FEBs during which zero suppression occurs. The data in the FEBs is reformatted and compressed by a local processor during transfer to the module memory. The FASTBUS coupler is used by the communications host to upload the compressed and formatted data from the module memory. The local processor executes programs which are downloaded to the module memory through the FASTBUS coupler. 25 figs.

  6. Fractal image compression

    NASA Technical Reports Server (NTRS)

    Barnsley, Michael F.; Sloan, Alan D.

    1989-01-01

    Fractals are geometric or data structures which do not simplify under magnification. Fractal Image Compression is a technique which associates a fractal to an image. On the one hand, the fractal can be described in terms of a few succinct rules, while on the other, the fractal contains much or all of the image information. Since the rules are described with less bits of data than the image, compression results. Data compression with fractals is an approach to reach high compression ratios for large data streams related to images. The high compression ratios are attained at a cost of large amounts of computation. Both lossless and lossy modes are supported by the technique. The technique is stable in that small errors in codes lead to small errors in image data. Applications to the NASA mission are discussed.

  7. Imaging industry expectations for compressed sensing in MRI

    NASA Astrophysics Data System (ADS)

    King, Kevin F.; Kanwischer, Adriana; Peters, Rob

    2015-09-01

    Compressed sensing requires compressible data, incoherent acquisition and a nonlinear reconstruction algorithm to force creation of a compressible image consistent with the acquired data. MRI images are compressible using various transforms (commonly total variation or wavelets). Incoherent acquisition of MRI data by appropriate selection of pseudo-random or non-Cartesian locations in k-space is straightforward. Increasingly, commercial scanners are sold with enough computing power to enable iterative reconstruction in reasonable times. Therefore integration of compressed sensing into commercial MRI products and clinical practice is beginning. MRI frequently requires the tradeoff of spatial resolution, temporal resolution and volume of spatial coverage to obtain reasonable scan times. Compressed sensing improves scan efficiency and reduces the need for this tradeoff. Benefits to the user will include shorter scans, greater patient comfort, better image quality, more contrast types per patient slot, the enabling of previously impractical applications, and higher throughput. Challenges to vendors include deciding which applications to prioritize, guaranteeing diagnostic image quality, maintaining acceptable usability and workflow, and acquisition and reconstruction algorithm details. Application choice depends on which customer needs the vendor wants to address. The changing healthcare environment is putting cost and productivity pressure on healthcare providers. The improved scan efficiency of compressed sensing can help alleviate some of this pressure. Image quality is strongly influenced by image compressibility and acceleration factor, which must be appropriately limited. Usability and workflow concerns include reconstruction time and user interface friendliness and response. Reconstruction times are limited to about one minute for acceptable workflow. The user interface should be designed to optimize workflow and minimize additional customer training. Algorithm

  8. Realization of hybrid compressive imaging strategies.

    PubMed

    Li, Yun; Sankaranarayanan, Aswin C; Xu, Lina; Baraniuk, Richard; Kelly, Kevin F

    2014-08-01

    The tendency of natural scenes to cluster around low frequencies is not only useful in image compression, it also can prove advantageous in novel infrared and hyperspectral image acquisition. In this paper, we exploit this signal model with two approaches to enhance the quality of compressive imaging as implemented in a single-pixel compressive camera and compare these results against purely random acquisition. We combine projection patterns that can efficiently extract the model-based information with subsequent random projections to form the hybrid pattern sets. With the first approach, we generate low-frequency patterns via a direct transform. As an alternative, we also used principal component analysis of an image library to identify the low-frequency components. We present the first (to the best of our knowledge) experimental validation of this hybrid signal model on real data. For both methods, we acquire comparable quality of reconstructions while acquiring only half the number of measurements needed by traditional random sequences. The optimal combination of hybrid patterns and the effects of noise on image reconstruction are also discussed. PMID:25121526

  9. Texture-based medical image retrieval in compressed domain using compressive sensing.

    PubMed

    Yadav, Kuldeep; Srivastava, Avi; Mittal, Ankush; Ansari, M A

    2014-01-01

    Content-based image retrieval has gained considerable attention in today's scenario as a useful tool in many applications; texture is one of them. In this paper, we focus on texture-based image retrieval in compressed domain using compressive sensing with the help of DC coefficients. Medical imaging is one of the fields which have been affected most, as there had been huge size of image database and getting out the concerned image had been a daunting task. Considering this, in this paper we propose a new model of image retrieval process using compressive sampling, since it allows accurate recovery of image from far fewer samples of unknowns and it does not require a close relation of matching between sampling pattern and characteristic image structure with increase acquisition speed and enhanced image quality. PMID:24589833

  10. Hierarchical multiple binary image encryption based on a chaos and phase retrieval algorithm in the Fresnel domain

    NASA Astrophysics Data System (ADS)

    Wang, Zhipeng; Lv, Xiaodong; Wang, Hongjuan; Hou, Chenxia; Gong, Qiong; Qin, Yi

    2016-03-01

    Based on the chaos and phase retrieval algorithm, a hierarchical multiple binary image encryption is proposed. In the encryption process, each plaintext is encrypted into a diffraction intensity pattern by two chaos-generated random phase masks (RPMs). Thereafter, the captured diffraction intensity patterns are partially selected by different binary masks and then combined together to form a single intensity pattern. The combined intensity pattern is saved as ciphertext. For decryption, an iterative phase retrieval algorithm is performed, in which a support constraint in the output plane and a median filtering operation are utilized to achieve a rapid convergence rate without a stagnation problem. The proposed scheme has a simple optical setup and large encryption capacity. In particular, it is well suited for constructing a hierarchical security system. The security and robustness of the proposal are also investigated.

  11. EEG data compression techniques.

    PubMed

    Antoniol, G; Tonella, P

    1997-02-01

    In this paper, electroencephalograph (EEG) and Holter EEG data compression techniques which allow perfect reconstruction of the recorded waveform from the compressed one are presented and discussed. Data compression permits one to achieve significant reduction in the space required to store signals and in transmission time. The Huffman coding technique in conjunction with derivative computation reaches high compression ratios (on average 49% on Holter and 58% on EEG signals) with low computational complexity. By exploiting this result a simple and fast encoder/decoder scheme capable of real-time performance on a PC was implemented. This simple technique is compared with other predictive transformations, vector quantization, discrete cosine transform (DCT), and repetition count compression methods. Finally, it is shown that the adoption of a collapsed Huffman tree for the encoding/decoding operations allows one to choose the maximum codeword length without significantly affecting the compression ratio. Therefore, low cost commercial microcontrollers and storage devices can be effectively used to store long Holter EEG's in a compressed format. PMID:9214790

  12. Excessive acquisition in hoarding.

    PubMed

    Frost, Randy O; Tolin, David F; Steketee, Gail; Fitch, Kristin E; Selbo-Bruns, Alexandra

    2009-06-01

    Compulsive hoarding (the acquisition of and failure to discard large numbers of possessions) is associated with substantial health risk, impairment, and economic burden. However, little research has examined separate components of this definition, particularly excessive acquisition. The present study examined acquisition in hoarding. Participants, 878 self-identified with hoarding and 665 family informants (not matched to hoarding participants), completed an Internet survey. Among hoarding participants who met criteria for clinically significant hoarding, 61% met criteria for a diagnosis of compulsive buying and approximately 85% reported excessive acquisition. Family informants indicated that nearly 95% exhibited excessive acquisition. Those who acquired excessively had more severe hoarding; their hoarding had an earlier onset and resulted in more psychiatric work impairment days; and they experienced more symptoms of obsessive-compulsive disorder, depression, and anxiety. Two forms of excessive acquisition (buying and free things) each contributed independent variance in the prediction of hoarding severity and related symptoms. PMID:19261435

  13. Excessive Acquisition in Hoarding

    PubMed Central

    Frost, Randy O.; Tolin, David F.; Steketee, Gail; Fitch, Kristin E.; Selbo-Bruns, Alexandra

    2009-01-01

    Compulsive hoarding (the acquisition of and failure to discard large numbers of possessions) is associated with substantial health risk, impairment, and economic burden. However, little research has examined separate components of this definition, particularly excessive acquisition. The present study examined acquisition in hoarding. Participants, 878 self-identified with hoarding and 665 family informants (not matched to hoarding participants), completed an internet survey. Among hoarding participants who met criteria for clinically significant hoarding, 61% met criteria for a diagnosis of compulsive buying and approximately 85% reported excessive acquisition. Family informants indicated that nearly 95% exhibited excessive acquisition. Those who acquired excessively had more severe hoarding; their hoarding had an earlier onset and resulted in more psychiatric work impairment days; and they experienced more symptoms of obsessive-compulsive disorder, depression, and anxiety. Two forms of excessive acquisition (buying and free things) each contributed independent variance in the prediction of hoarding severity and related symptoms. PMID:19261435

  14. A Stream Encryption Scheme with Both Key and Plaintext Avalanche Effects for Designing Chaos-Based Pseudorandom Number Generator with Application to Image Encryption

    NASA Astrophysics Data System (ADS)

    Han, Dandan; Min, Lequan; Chen, Guanrong

    Based on a stream encryption scheme with avalanche effect (SESAE), a stream encryption scheme with both key avalanche effect and plaintext avalanche effect (SESKPAE) is introduced. Using this scheme and an ideal 2d-word (d-segment) pseudorandom number generator (PRNG), a plaintext can be encrypted such that each bit of the ciphertext block has a change with the probable probability of (2d ‑ 1)/2d when any word of the key is changed or any bit of the plaintext is changed. To that end, a novel four-dimensional discrete chaotic system (4DDCS) is proposed. Combining the 4DDCS with a generalized synchronization (GS) theorem, a novel eight-dimensional discrete GS chaotic system (8DDGSCS) is constructed. Using the 8DDGSCS, a 216-word chaotic pseudorandom number generator (CPRNG) is designed. The keyspace of the 216-word CPRNG is larger than 21195. Then, the FIPS 140-2 test suit/generalized FIPS 140-2 test suit is used to test the randomness of the 1000-key streams consisting of 20000 bits generated by the 216-word CPRNG, the RC4 algorithm PRNG and the ZUC algorithm PRNG, respectively. The test results show that for the three PRNGs, there are 100%/98.9%, 99.9%/98.8%, 100%/97.9% key streams passing the tests, respectively. Furthermore, the SP800-22 test suite is used to test the randomness of four 100-key streams consisting of 1000000 bits generated by four PRNGs, respectively. The numerical results show that the randomness performances of the 216-word CPRNG is promising, showing that there are no significant correlations between the key streams and the perturbed key streams generated via the 216-word CPRNG. Finally, using the 216-word CPRNG and the SESKPAE to encrypt two gray-scale images, test results demonstrate that the 216-word CPRNG is able to generate both key avalanche effect and plaintext avalanche effect, which are similar to those generated via an ideal CPRNG, and performs better than other comparable schemes.

  15. How to reuse a one-time pad and other notes on authentication, encryption, and protection of quantum information

    SciTech Connect

    Oppenheim, Jonathan; Horodecki, Michal

    2005-10-15

    Quantum information is a valuable resource which can be encrypted in order to protect it. We consider the size of the one-time pad that is needed to protect quantum information in a number of cases. The situation is dramatically different from the classical case: we prove that one can recycle the one-time pad without compromising security. The protocol for recycling relies on detecting whether eavesdropping has occurred, and further relies on the fact that information contained in the encrypted quantum state cannot be fully accessed. We prove the security of recycling rates when authentication of quantum states is accepted, and when it is rejected. We note that recycling schemes respect a general law of cryptography which we introduce relating the size of private keys, sent qubits, and encrypted messages. We discuss applications for encryption of quantum information in light of the resources needed for teleportation. Potential uses include the protection of resources such as entanglement and the memory of quantum computers. We also introduce another application: encrypted secret sharing and find that one can even reuse the private key that is used to encrypt a classical message. In a number of cases, one finds that the amount of private key needed for authentication or protection is smaller than in the general case.

  16. Boson core compressibility

    NASA Astrophysics Data System (ADS)

    Khorramzadeh, Y.; Lin, Fei; Scarola, V. W.

    2012-04-01

    Strongly interacting atoms trapped in optical lattices can be used to explore phase diagrams of Hubbard models. Spatial inhomogeneity due to trapping typically obscures distinguishing observables. We propose that measures using boson double occupancy avoid trapping effects to reveal two key correlation functions. We define a boson core compressibility and core superfluid stiffness in terms of double occupancy. We use quantum Monte Carlo on the Bose-Hubbard model to empirically show that these quantities intrinsically eliminate edge effects to reveal correlations near the trap center. The boson core compressibility offers a generally applicable tool that can be used to experimentally map out phase transitions between compressible and incompressible states.

  17. Modeling Compressed Turbulence

    SciTech Connect

    Israel, Daniel M.

    2012-07-13

    From ICE to ICF, the effect of mean compression or expansion is important for predicting the state of the turbulence. When developing combustion models, we would like to know the mix state of the reacting species. This involves density and concentration fluctuations. To date, research has focused on the effect of compression on the turbulent kinetic energy. The current work provides constraints to help development and calibration for models of species mixing effects in compressed turbulence. The Cambon, et al., re-scaling has been extended to buoyancy driven turbulence, including the fluctuating density, concentration, and temperature equations. The new scalings give us helpful constraints for developing and validating RANS turbulence models.

  18. Local compressibilities in crystals

    NASA Astrophysics Data System (ADS)

    Martín Pendás, A.; Costales, Aurora; Blanco, M. A.; Recio, J. M.; Luaña, Víctor

    2000-12-01

    An application of the atoms in molecules theory to the partitioning of static thermodynamic properties in condensed systems is presented. Attention is focused on the definition and the behavior of atomic compressibilities. Inverses of bulk moduli are found to be simple weighted averages of atomic compressibilities. Two kinds of systems are investigated as examples: four related oxide spinels and the alkali halide family. Our analyses show that the puzzling constancy of the bulk moduli of these spinels is a consequence of the value of the compressibility of an oxide ion. A functional dependence between ionic bulk moduli and ionic volume is also proposed.

  19. Streamlined acquisition handbook

    NASA Technical Reports Server (NTRS)

    1990-01-01

    NASA has always placed great emphasis on the acquisition process, recognizing it as among its most important activities. This handbook is intended to facilitate the application of streamlined acquisition procedures. The development of these procedures reflects the efforts of an action group composed of NASA Headquarters and center acquisition professionals. It is the intent to accomplish the real change in the acquisition process as a result of this effort. An important part of streamlining the acquisition process is a commitment by the people involved in the process to accomplishing acquisition activities quickly and with high quality. Too often we continue to accomplish work in 'the same old way' without considering available alternatives which would require no changes to regulations, approvals from Headquarters, or waivers of required practice. Similarly, we must be sensitive to schedule opportunities throughout the acquisition cycle, not just once the purchase request arrives at the procurement office. Techniques that have been identified as ways of reducing acquisition lead time while maintaining high quality in our acquisition process are presented.

  20. Binned progressive quantization for compressive sensing.

    PubMed

    Wang, Liangjun; Wu, Xiaolin; Shi, Guangming

    2012-06-01

    Compressive sensing (CS) has been recently and enthusiastically promoted as a joint sampling and compression approach. The advantages of CS over conventional signal compression techniques are architectural: the CS encoder is made signal independent and computationally inexpensive by shifting the bulk of system complexity to the decoder. While these properties of CS allow signal acquisition and communication in some severely resource-deprived conditions that render conventional sampling and coding impossible, they are accompanied by rather disappointing rate-distortion performance. In this paper, we propose a novel coding technique that rectifies, to a certain extent, the problem of poor compression performance of CS and, at the same time, maintains the simplicity and universality of the current CS encoder design. The main innovation is a scheme of progressive fixed-rate scalar quantization with binning that enables the CS decoder to exploit hidden correlations between CS measurements, which was overlooked in the existing literature. Experimental results are presented to demonstrate the efficacy of the new CS coding technique. Encouragingly, on some test images, the new CS technique matches or even slightly outperforms JPEG. PMID:22374362

  1. Seismic full waveform inversion from compressive measurements

    NASA Astrophysics Data System (ADS)

    Ramirez, Ana; Arce, Gonzalo R.

    2015-05-01

    Traditional methods in seismic acquisition require sources and geophones that are uniformly located along a spatial line, using the Nyquist sampling rate. Depending on the area to be explored, it can be necessary to use seismic surveys with large offsets, or decrease the separation between adjacent geophones to improve the resolution, which generates very high volumes of data. It makes the exploration process more difficult and particularly expensive. This work presents the reconstruction of a compressive set of seismic traces acquired using the compressive sensing paradigm where the pair of sources and geophones are randomly located along the spatial line. The recovery of the wavefield from compressive measurements is feasible due to the capabilities of Curvelets on representing wave propagators with only a small set of coefficients. The method first uses the compressive samples to find a sparse vector representation of each pixel in a 2-D Curvelet dictionary. The sparse vector representation is estimated by solving a sparsity constrained optimization problem using the Gradient Projection for Sparse Reconstruction (GPSR) method. The estimated vector is then used to compute the seismic velocity profiles via acoustic Full Waveform Inversion (FWI). Simulations of the reconstructed image gathers and the resulting seismic velocity profiles illustrate the performance of the method. An improvement in the resulting images is obtained in comparison with traditional F-K filtering used in seismic data processing when traces are missing.

  2. Data Division Scheme Based on Homomorphic Encryption in WSNs for Health Care.

    PubMed

    Wang, Xiaoni; Zhang, Zhenjiang

    2015-12-01

    The use of wireless sensor networks for wearable computing in health care is growing quickly. Numerous applications are already in use, such as blood pressure monitors and heart rate monitors. As such, it is very important for system designers to consider how to protect patient privacy, especially in wireless sensor networks. After studying and analyzing the features of wireless sensor networks in medical systems, a data division scheme was proposed in this paper, provided the advantages of homomorphic encryption. In the proposed scheme, even if a forwarding node is compromised, the attacker will not be able to eavesdrop on the data, resulting in much stronger privacy than existing schemes. Experimental results shows that the scheme provides a good trade off in resources consumed and system security, and is efficient for encrypting or decrypting sensitive medical data. PMID:26490146

  3. Fast encryption of RGB color digital images using a tweakable cellular automaton based schema

    NASA Astrophysics Data System (ADS)

    Faraoun, Kamel Mohamed

    2014-12-01

    We propose a new tweakable construction of block-enciphers using second-order reversible cellular automata, and we apply it to encipher RGB-colored images. The proposed construction permits a parallel encryption of the image content by extending the standard definition of a block cipher to take into account a supplementary parameter used as a tweak (nonce) to control the behavior of the cipher from one region of the image to the other, and hence avoid the necessity to use slow sequential encryption's operating modes. The proposed construction defines a flexible pseudorandom permutation that can be used with efficacy to solve the electronic code book problem without the need to a specific sequential mode. Obtained results from various experiments show that the proposed schema achieves high security and execution performances, and enables an interesting mode of selective area decryption due to the parallel character of the approach.

  4. Optical image encryption using password key based on phase retrieval algorithm

    NASA Astrophysics Data System (ADS)

    Zhao, Tieyu; Ran, Qiwen; Yuan, Lin; Chi, Yingying; Ma, Jing

    2016-04-01

    A novel optical image encryption system is proposed using password key based on phase retrieval algorithm (PRA). In the encryption process, a shared image is taken as a symmetric key and the plaintext is encoded into the phase-only mask based on the iterative PRA. The linear relationship between the plaintext and ciphertext is broken using the password key, which can resist the known plaintext attack. The symmetric key and the retrieved phase are imported into the input plane and Fourier plane of 4f system during the decryption, respectively, so as to obtain the plaintext on the CCD. Finally, we analyse the key space of the password key, and the results show that the proposed scheme can resist a brute force attack due to the flexibility of the password key.

  5. A novel implementation of signature, encryption and authentication (SEA) protocol on mobile patient monitoring devices.

    PubMed

    Malhotra, Khamish; Gardner, Stephen; Mepham, Will

    2008-01-01

    Mobile patient monitoring devices are becoming an integral part of healthcare industry and these devices will eventually become the method of choice for accessing and implementing health checks for patients located in remote areas. The thrust behind this research work was to investigate how a complete security strategy, comprising of digital signatures, encryption and authorisation on the mobile healthcare devices could be implemented without compromising overall system performance. Java 2, Micro Edition (J2ME) platform has been used to implement the Signature, Encryption and Authentication (SEA) protocol based on Elliptic Curve Cryptography (ECC). The work presented highlights a practical, secure and effective prototype for interactive monitoring of remote patients. The proposed facilities could improve the quality of care and doctor-patient communications; prevent misuse of healthcare data and consequential expenses to the healthcare industry in an efficient user friendly way that does not significantly affect the device performance. PMID:18776603

  6. A Survey of Research Progress and Development Tendency of Attribute-Based Encryption

    PubMed Central

    Pang, Liaojun; Yang, Jie; Jiang, Zhengtao

    2014-01-01

    With the development of cryptography, the attribute-based encryption (ABE) draws widespread attention of the researchers in recent years. The ABE scheme, which belongs to the public key encryption mechanism, takes attributes as public key and associates them with the ciphertext or the user's secret key. It is an efficient way to solve open problems in access control scenarios, for example, how to provide data confidentiality and expressive access control at the same time. In this paper, we survey the basic ABE scheme and its two variants: the key-policy ABE (KP-ABE) scheme and the ciphertext-policy ABE (CP-ABE) scheme. We also pay attention to other researches relating to the ABE schemes, including multiauthority, user/attribute revocation, accountability, and proxy reencryption, with an extensive comparison of their functionality and performance. Finally, possible future works and some conclusions are pointed out. PMID:25101313

  7. Design of real-time encryption module for secure data protection of wearable healthcare devices.

    PubMed

    Kim, Jungchae; Lee, Byuck Jin; Yoo, Sun K

    2013-01-01

    Wearable devices for biomedical instrumentation could generate the medical data and transmit to a repository on cloud service through wireless networks. In this process, the private medical data will be disclosed by man in the middle attack. Thus, the archived data for healthcare services would be protected by non-standardized security policy by healthcare service provider (HSP) because HIPAA only defines the security rules. In this paper, we adopted the Advanced Encryption Standard (AES) for security framework on wearable devices, so healthcare applications using this framework could support the confidentiality easily. The framework developed as dynamic loadable module targeted for lightweight microcontroller such as msp430 within embedded operating system. The performance was shown that the module can support the real-time encryption using electrocardiogram and photoplethysmogram. In this regard, the processing load for enabling security is distributed to wearable devices, and the customized data protection method could be composed by HSP for a trusted healthcare service. PMID:24110180

  8. End-to-end Encryption for SMS Messages in the Health Care Domain.

    PubMed

    Hassinen, Marko; Laitinen, Pertti

    2005-01-01

    The health care domain has a high level of expectation on security and privacy of patient information. The security, privacy, and confidentiality issues are consistent all over the domain. Technical development and increasing use of mobile phones has led us to a situation in which SMS messages are used in the electronic interactions between health care professionals and patients. We will show that it is possible to send, receive and store text messages securely with a mobile phone with no additional hardware required. More importantly we will show that it is possible to obtain a reliable user authentication in systems using text message communication. Programming language Java is used for realization of our goals. This paper describes the general application structure, while details for the technical implementation and encryption methods are described in the referenced articles. We also propose some crucial areas where the implementation of encrypted SMS can solve previous lack of security. PMID:16160278

  9. Security enhancement of a phase-truncation based image encryption algorithm.

    PubMed

    Wang, Xiaogang; Zhao, Daomu

    2011-12-20

    The asymmetric cryptosystem, which is based on phase-truncated Fourier transforms (PTFTs), can break the linearity of conventional systems. However, it has been proven to be vulnerable to a specific attack based on iterative Fourier transforms when the two random phase masks are used as public keys to encrypt different plaintexts. An improvement from the asymmetric cryptosystem may be taken by relocating the amplitude values in the output plane. In this paper, two different methods are adopted to realize the amplitude modulation of the output image. The first one is to extend the PTFT-based asymmetrical cryptosystem into the anamorphic fractional Fourier transform domain directly, and the second is to add an amplitude mask in the Fourier plane of the encryption scheme. Some numerical simulations are presented to prove the good performance of the proposed cryptosystems. PMID:22193194

  10. Status Report on the First Round of the Development of the Advanced Encryption Standard

    PubMed Central

    Nechvatal, James; Barker, Elaine; Dodson, Donna; Dworkin, Morris; Foti, James; Roback, Edward

    1999-01-01

    In 1997, the National Institute of Standards and Technology (NIST) initiated a process to select a symmetric-key encryption algorithm to be used to protect sensitive (unclassified) Federal information in furtherance of NIST’s statutory responsibilities. In 1998, NIST announced the acceptance of 15 candidate algorithms and requested the assistance of the cryptographic research community in analyzing the candidates. This analysis included an initial examination of the security and efficiency characteristics for each algorithm. NIST has reviewed the results of this research and selected five algorithms (MARS, RC6™, Rijndael, Serpent and Twofish) as finalists. The research results and rationale for the selection of the finalists are documented in this report. The five finalists will be the subject of further study before the selection of one or more of these algorithms for inclusion in the Advanced Encryption Standard.

  11. An authenticated image encryption scheme based on chaotic maps and memory cellular automata

    NASA Astrophysics Data System (ADS)

    Bakhshandeh, Atieh; Eslami, Ziba

    2013-06-01

    This paper introduces a new image encryption scheme based on chaotic maps, cellular automata and permutation-diffusion architecture. In the permutation phase, a piecewise linear chaotic map is utilized to confuse the plain-image and in the diffusion phase, we employ the Logistic map as well as a reversible memory cellular automata to obtain an efficient and secure cryptosystem. The proposed method admits advantages such as highly secure diffusion mechanism, computational efficiency and ease of implementation. A novel property of the proposed scheme is its authentication ability which can detect whether the image is tampered during the transmission or not. This is particularly important in applications where image data or part of it contains highly sensitive information. Results of various analyses manifest high security of this new method and its capability for practical image encryption.

  12. VLSI implementation of RSA encryption system using ancient Indian Vedic mathematics

    NASA Astrophysics Data System (ADS)

    Thapliyal, Himanshu; Srinivas, M. B.

    2005-06-01

    This paper proposes the hardware implementation of RSA encryption/decryption algorithm using the algorithms of Ancient Indian Vedic Mathematics that have been modified to improve performance. The recently proposed hierarchical overlay multiplier architecture is used in the RSA circuitry for multiplication operation. The most significant aspect of the paper is the development of a division architecture based on Straight Division algorithm of Ancient Indian Vedic Mathematics and embedding it in RSA encryption/decryption circuitry for improved efficiency. The coding is done in Verilog HDL and the FPGA synthesis is done using Xilinx Spartan library. The results show that RSA circuitry implemented using Vedic division and multiplication is efficient in terms of area/speed compared to its implementation using conventional multiplication and division architectures.

  13. An optical authentication system based on encryption technique and multimodal biometrics

    NASA Astrophysics Data System (ADS)

    Yuan, Sheng; Zhang, Tong; Zhou, Xin; Liu, Xuemei; Liu, Mingtang

    2013-12-01

    A major concern nowadays for a biometric credential management system is its potential vulnerability to protect its information sources. To prevent a genuine user's templates from both internal and external threats, a novel and simple method combined optical encryption with multimodal biometric authentication technique is proposed. In this method, the standard biometric templates are generated real-timely by the verification keys owned by legal user so that they are unnecessary to be stored in a database. Compared with the traditional recognition algorithms, storage space and matching time are greatly saved. In addition, the verification keys are difficult to be forged due to the utilization of optical encryption technique. Although the verification keys are lost or stolen, they are useless for others in absence of the legal owner's biometric. A series of numerical simulations are performed to demonstrate the feasibility and performance of this method.

  14. Security-enhanced chaos communication with time-delay signature suppression and phase encryption.

    PubMed

    Xue, Chenpeng; Jiang, Ning; Lv, Yunxin; Wang, Chao; Li, Guilan; Lin, Shuqing; Qiu, Kun

    2016-08-15

    A security-enhanced chaos communication scheme with time delay signature (TDS) suppression and phase-encrypted feedback light is proposed, in virtue of dual-loop feedback with independent high-speed phase modulation. We numerically investigate the property of TDS suppression in the intensity and phase space and quantitatively discuss security of the proposed system by calculating the bit error rate of eavesdroppers who try to crack the system by directly filtering the detected signal or by using a similar semiconductor laser to synchronize the link signal and extract the data. The results show that TDS embedded in the chaotic carrier can be well suppressed by properly setting the modulation frequency, which can keep the time delay a secret from the eavesdropper. Moreover, because the feedback light is encrypted, without the accurate time delay and key, the eavesdropper cannot reconstruct the symmetric operation conditions and decode the correct data. PMID:27519064

  15. Color image encryption using iterative phase retrieve process in quaternion Fourier transform domain

    NASA Astrophysics Data System (ADS)

    Sui, Liansheng; Duan, Kuaikuai

    2015-02-01

    A single-channel color image encryption method is proposed based on iterative phase iterative process in quaternion Fourier transform domain. First, three components of the plain color image is confused respectively by using cat map. Second, the confused components are combined into a pure quaternion image, which is encode to the phase only function by using an iterative phase retrieval process. Finally, the phase only function is encrypted into the gray scale ciphertext with stationary white noise distribution based on the chaotic diffusion, which has camouflage property to some extent. The corresponding plain color image can be recovered from the ciphertext only with correct keys in the decryption process. Simulation results verify the feasibility and effectiveness of the proposed method.

  16. Quantum Image Encryption and Decryption Algorithms Based on Quantum Image Geometric Transformations

    NASA Astrophysics Data System (ADS)

    Zhou, Ri-Gui; Wu, Qian; Zhang, Man-Qun; Shen, Chen-Yi

    2013-06-01

    Cryptography is the essential subject for network information security to protect important data. Although following the symmetric cryptosystem for which the participations in the communication keep exactly the same keys, the special for the encryption and decryption algorithms proposed in this paper lays in the operational objectives, the quantum image. Firstly, extracts the properties of gray-scale and position from the quantum gray-scale image which the storage expression of image in quantum states is achieved. Along with the geometric transformations in classical images, this article realizes the quantum image geometric transforms by means of designing quantum circuits. Eventually, through a combination of the proposals in previous, the encryption and decryption algorithms on quantum gray-scale images is finally accomplished, which could ensure the confidentiality and security of the information in delivery. The algorithms belong to the application of quantum image geometric transformations, for further, the new explorations for quantum image cryptography researches.

  17. Military Data Compression Standard

    NASA Astrophysics Data System (ADS)

    Winterbauer, C. E.

    1982-07-01

    A facsimile interoperability data compression standard is being adopted by the U.S. Department of Defense and other North Atlantic Treaty Organization (NATO) countries. This algorithm has been shown to perform quite well in a noisy communication channel.

  18. Focus on Compression Stockings

    MedlinePlus

    ... sion apparel is used to prevent or control edema The post-thrombotic syndrome (PTS) is a complication ( ... complication. abdomen. This swelling is referred to as edema. If you have edema, compression therapy may be ...

  19. Compressible Astrophysics Simulation Code

    2007-07-18

    This is an astrophysics simulation code involving a radiation diffusion module developed at LLNL coupled to compressible hydrodynamics and adaptive mesh infrastructure developed at LBNL. One intended application is to neutrino diffusion in core collapse supernovae.

  20. Similarity by compression.

    PubMed

    Melville, James L; Riley, Jenna F; Hirst, Jonathan D

    2007-01-01

    We present a simple and effective method for similarity searching in virtual high-throughput screening, requiring only a string-based representation of the molecules (e.g., SMILES) and standard compression software, available on all modern desktop computers. This method utilizes the normalized compression distance, an approximation of the normalized information distance, based on the concept of Kolmogorov complexity. On representative data sets, we demonstrate that compression-based similarity searching can outperform standard similarity searching protocols, exemplified by the Tanimoto coefficient combined with a binary fingerprint representation and data fusion. Software to carry out compression-based similarity is available from our Web site at http://comp.chem.nottingham.ac.uk/download/zippity. PMID:17238245