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.
Public-key encryption with chaos.
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
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…
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.
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.
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.
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.
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.
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.
Novel public key encryption technique based on multiple chaotic systems.
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
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.
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.
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.
Efficient secure-channel free public key encryption with keyword search for EMRs in cloud storage.
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
A simple public-key attack on phase-truncation-based double-images encryption system
NASA Astrophysics Data System (ADS)
Ding, Xiangling; Yang, Gaobo; He, Dajiang
2015-07-01
Phase-truncation based double-images cryptosystem can avoid the iterative Fourier transforms and realize double-images encryption. In this paper, a simple public-key attack is proposed to break this cryptosystem by using arbitrary position parameters and three public keys. The attack process is composed of two steps. Firstly, the decryption keys are simply generated with the help of arbitrary position parameters and the three public keys. Secondly, the two approximate values of the original images are obtained by using the generated decryption keys. Moreover, the proposed public-key attack is different from the existing attacks. It is not sensitive to position parameters of the double-images and the computing efficiency is also much better. Computer simulation results further prove its vulnerability.
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.
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.
Universal Keyword Classifier on Public Key Based Encrypted Multikeyword Fuzzy Search in Public Cloud
Munisamy, Shyamala Devi; Chokkalingam, Arun
2015-01-01
Cloud computing has pioneered the emerging world by manifesting itself as a service through internet and facilitates third party infrastructure and applications. While customers have no visibility on how their data is stored on service provider's premises, it offers greater benefits in lowering infrastructure costs and delivering more flexibility and simplicity in managing private data. The opportunity to use cloud services on pay-per-use basis provides comfort for private data owners in managing costs and data. With the pervasive usage of internet, the focus has now shifted towards effective data utilization on the cloud without compromising security concerns. In the pursuit of increasing data utilization on public cloud storage, the key is to make effective data access through several fuzzy searching techniques. In this paper, we have discussed the existing fuzzy searching techniques and focused on reducing the searching time on the cloud storage server for effective data utilization. Our proposed Asymmetric Classifier Multikeyword Fuzzy Search method provides classifier search server that creates universal keyword classifier for the multiple keyword request which greatly reduces the searching time by learning the search path pattern for all the keywords in the fuzzy keyword set. The objective of using BTree fuzzy searchable index is to resolve typos and representation inconsistencies and also to facilitate effective data utilization. PMID:26380364
Munisamy, Shyamala Devi; Chokkalingam, Arun
2015-01-01
Cloud computing has pioneered the emerging world by manifesting itself as a service through internet and facilitates third party infrastructure and applications. While customers have no visibility on how their data is stored on service provider's premises, it offers greater benefits in lowering infrastructure costs and delivering more flexibility and simplicity in managing private data. The opportunity to use cloud services on pay-per-use basis provides comfort for private data owners in managing costs and data. With the pervasive usage of internet, the focus has now shifted towards effective data utilization on the cloud without compromising security concerns. In the pursuit of increasing data utilization on public cloud storage, the key is to make effective data access through several fuzzy searching techniques. In this paper, we have discussed the existing fuzzy searching techniques and focused on reducing the searching time on the cloud storage server for effective data utilization. Our proposed Asymmetric Classifier Multikeyword Fuzzy Search method provides classifier search server that creates universal keyword classifier for the multiple keyword request which greatly reduces the searching time by learning the search path pattern for all the keywords in the fuzzy keyword set. The objective of using BTree fuzzy searchable index is to resolve typos and representation inconsistencies and also to facilitate effective data utilization. PMID:26380364
Key management for large scale end-to-end encryption
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.
NASA Astrophysics Data System (ADS)
Meng, X. F.; Peng, X.; Cai, L. Z.; Li, A. M.; Gao, Z.; Wang, Y. R.
2009-08-01
A hybrid cryptosystem is proposed, in which one image is encrypted to two interferograms with the aid of double random-phase encoding (DRPE) and two-step phase-shifting interferometry (2-PSI), then three pairs of public-private keys are utilized to encode and decode the session keys (geometrical parameters, the second random-phase mask) and interferograms. In the stage of decryption, the ciphered image can be decrypted by wavefront reconstruction, inverse Fresnel diffraction, and real amplitude normalization. This approach can successfully solve the problem of key management and dispatch, resulting in increased security strength. The feasibility of the proposed cryptosystem and its robustness against some types of attack are verified and analyzed by computer simulations.
Method for encryption and transmission of digital keying data
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.
Two-chip implementation of the RSA public-key encryption algorithm
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.
Method for encryption and transmission of digital keying data
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.
New Security Results on Encrypted Key Exchange
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.
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.
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.
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.
Quantum cryptography using coherent states: Randomized encryption and key generation
NASA Astrophysics Data System (ADS)
Corndorf, Eric
With the advent of the global optical-telecommunications infrastructure, an increasing number of individuals, companies, and agencies communicate information with one another over public networks or physically-insecure private networks. While the majority of the traffic flowing through these networks requires little or no assurance of secrecy, the same cannot be said for certain communications between banks, between government agencies, within the military, and between corporations. In these arenas, the need to specify some level of secrecy in communications is a high priority. While the current approaches to securing sensitive information (namely the public-key-cryptography infrastructure and deterministic private-key ciphers like AES and 3DES) seem to be cryptographically strong based on empirical evidence, there exist no mathematical proofs of secrecy for any widely deployed cryptosystem. As an example, the ubiquitous public-key cryptosystems infer all of their secrecy from the assumption that factoring of the product of two large primes is necessarily time consuming---something which has not, and perhaps cannot, be proven. Since the 1980s, the possibility of using quantum-mechanical features of light as a physical mechanism for satisfying particular cryptographic objectives has been explored. This research has been fueled by the hopes that cryptosystems based on quantum systems may provide provable levels of secrecy which are at least as valid as quantum mechanics itself. Unfortunately, the most widely considered quantum-cryptographic protocols (BB84 and the Ekert protocol) have serious implementation problems. Specifically, they require quantum-mechanical states which are not readily available, and they rely on unproven relations between intrusion-level detection and the information available to an attacker. As a result, the secrecy level provided by these experimental implementations is entirely unspecified. In an effort to provably satisfy the cryptographic
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.
Key management and encryption under the bounded storage model.
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.
Security enhanced optical encryption system by random phase key and permutation key.
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
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
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.
Quantum walk public-key cryptographic system
NASA Astrophysics Data System (ADS)
Vlachou, C.; Rodrigues, J.; Mateus, P.; Paunković, N.; Souto, A.
2015-12-01
Quantum Cryptography is a rapidly developing field of research that benefits from the properties of Quantum Mechanics in performing cryptographic tasks. Quantum walks are a powerful model for quantum computation and very promising for quantum information processing. In this paper, we present a quantum public-key cryptographic system based on quantum walks. In particular, in the proposed protocol the public-key is given by a quantum state generated by performing a quantum walk. We show that the protocol is secure and analyze the complexity of public key generation and encryption/decryption procedures.
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.
ERIC Educational Resources Information Center
Tapson, Frank
1996-01-01
Describes public key cryptography, also known as RSA, which is a system using two keys, one used to put a message into cipher and another used to decipher the message. Presents examples using small prime numbers. (MKR)
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.
Public/private key certification authority and key distribution. Draft
Long, J.P.; Christensen, M.J.; Sturtevant, A.P.; Johnston, W.E.
1995-09-25
Traditional encryption, which protects messages from prying eyes, has been used for many decades. The present concepts of encryption are built from that heritage. Utilization of modern software-based encryption techniques implies much more than simply converting files to an unreadable form. Ubiquitous use of computers and advances in encryption technology coupled with the use of wide-area networking completely changed the reasons for utilizing encryption technology. The technology demands a new and extensive infrastructure to support these functions. Full understanding of these functions, their utility and value, and the need for an infrastructure, takes extensive exposure to the new paradigm. This paper addresses issues surrounding the establishment and operation of a key management system (i.e., certification authority) that is essential to the successful implementation and wide-spread use of encryption.
Chaotic Image Encryption Based on Running-Key Related to Plaintext
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
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.
Energy Science and Technology Software Center (ESTSC)
2013-07-25
The Public Key (PK) FPGA software performs asymmetric authentication using the 163-bit Elliptic Curve Digital Signature Algorithm (ECDSA) on an embedded FPGA platform. A digital signature is created on user-supplied data, and communication with a host system is performed via a Serial Peripheral Interface (SPI) bus. Software includes all components necessary for signing, including custom random number generator for key creation and SHA-256 for data hashing.
NASA Astrophysics Data System (ADS)
Zhao, Tieyu; Ran, Qiwen; Yuan, Lin; Chi, Yingying; Ma, Jing
2016-08-01
A novel image encryption system based on double random phase encoding (DRPE) and RSA public-key algorithm is proposed. The main characteristic of the system is that each encryption process produces a new decryption key (even for the same plaintext), thus the encryption system conforms to the feature of the one-time pad (OTP) cryptography. The other characteristic of the system is the use of fingerprint key. Only with the rightful authorization will the true decryption be obtained, otherwise the decryption will result in noisy images. So the proposed system can be used to determine whether the ciphertext is falsified by attackers. In addition, the system conforms to the basic agreement of asymmetric cryptosystem (ACS) due to the combination with the RSA public-key algorithm. The simulation results show that the encryption scheme has high robustness against the existing attacks.
Controlled order rearrangement encryption for quantum key distribution
Deng Fuguo; Long, G.L.
2003-10-01
A technique is devised to perform orthogonal state quantum key distribution. In this scheme, entangled parts of a quantum information carrier are sent from Alice to Bob through two quantum channels. However, before the transmission, the order of the quantum information carrier in one channel is reordered so that Eve cannot steal useful information. At the receiver's end, the order of the quantum information carrier is restored. The order rearrangement operation in both parties is controlled by a prior shared control key which is used repeatedly in a quantum key distribution session.
Robust Public Key Cryptography — A New Cryptosystem Surviving Private Key Compromise
NASA Astrophysics Data System (ADS)
Shaik, Cheman
A weakness of the present-day public key cryptosystems is that these cryptosystems do not survive private-key compromise attacks resulting from an internal breach of trust. In a competitive business environment, private key compromise is a common incident that voids the strength of public key cryptosystems such as RSA and ECC. Bribing corporate employees to disclose their secret keys and inadvertently disclosing secret information are among a plethora of practical attacks that occur at the implementation level. Once a breach of trust takes place and subsequently the private key is revealed, any public key cryptosystem fails to secure electronic data in Internet communications. The revealed key may be used by an attacker to decipher the intercepted data at an intermediary router. This weakness of public key cryptography calls for an additional security measure that enables encryptions to survive private key compromise attacks.
Forward search as a cryptanalytic tool against a public key privacy channel
Simmons, G.J.; Holdridge, D.
1982-01-01
In symmetric cryptosystems that depend on a single (secret) key for both encryption and decryption, a cryptanalyst - since the key is unknown to him - must either work backward from the cipher or else from the cipher and some known pairs of plaintext messages and matching ciphers in attempting to recover the plaintext. In an asymmetric (two key) cryptosystem used in the public key, i.e., privacy channel, mode where the encryption key is publicly exposed so that anyone who wishes can encrypt messages that can only be decrypted by the person having the (secret) decryption key, a cryptanalytic weakness may occur that has no counterpart in symmetric systems. If the entropy of the input messages is too small (roughly speaking if it is computationally feasible to search through the most likely messages) either because the total number of messages is small or because a small number of the messages occur with high probabilities, the cryptanalyst can pre-encrypt these messages to form a cipher file that can then be matched against observed ciphers to accomplish a simple substitution decryption. This forward search cryptanalytic weakness of a public key privacy channel is purely a function of the entropy of the plaintext messages and does not depend on the existence of any cryptanalytic weakness in the concealment of the secret decryption key from a knowledge of the public encryption key in the underlying public key algorithm.
Channel-Based Key Generation for Encrypted Body-Worn Wireless Sensor Networks.
Van Torre, Patrick
2016-01-01
Body-worn sensor networks are important for rescue-workers, medical and many other applications. Sensitive data are often transmitted over such a network, motivating the need for encryption. Body-worn sensor networks are deployed in conditions where the wireless communication channel varies dramatically due to fading and shadowing, which is considered a disadvantage for communication. Interestingly, these channel variations can be employed to extract a common encryption key at both sides of the link. Legitimate users share a unique physical channel and the variations thereof provide data series on both sides of the link, with highly correlated values. An eavesdropper, however, does not share this physical channel and cannot extract the same information when intercepting the signals. This paper documents a practical wearable communication system implementing channel-based key generation, including an implementation and a measurement campaign comprising indoor as well as outdoor measurements. The results provide insight into the performance of channel-based key generation in realistic practical conditions. Employing a process known as key reconciliation, error free keys are generated in all tested scenarios. The key-generation system is computationally simple and therefore compatible with the low-power micro controllers and low-data rate transmissions commonly used in wireless sensor networks. PMID:27618051
Analysis of selected methods for the recovery of encrypted WEP key
NASA Astrophysics Data System (ADS)
Wójtowicz, Sebastian; Belka, Radosław
2014-11-01
This paper deals with some of the WEP (Wired Equivalent Privacy) key decryption methods based on aircrack-ng software, which was embedded in Backtrack operating system (Linux distribution). The 64-bit (40-bit) and 128-bit (104- bit) key encrypted with RC4 cipher weakness was shown. Research methods were made in different network environments. In this work we compared different types of keys to check how strong the RC4 stream cipher can be. The 40-bit and 104-bit WEP key has been tested on IEEE 802.11 based wireless LAN using laptop with live-CD Linux operating system. A short analysis of key creation methods was performed to compare the amount of time necessary to decrypt random and nonrandom WEP keys.
High efficient key-insulated attribute based encryption scheme without bilinear pairing operations.
Hong, Hanshu; Sun, Zhixin
2016-01-01
Attribute based encryption (ABE) has been widely applied for secure data protection in various data sharing systems. However, the efficiency of existing ABE schemes is not high enough since running encrypt and decrypt algorithms need frequent bilinear pairing operations, which may occupy too much computing resources on terminal devices. What's more, since different users may share the same attributes in the system, a single user's private key exposure will threaten the security and confidentiality of the whole system. Therefore, to further decrease the computation cost in attribute based cryptosystem as well as provide secure protection when key exposure happens, in this paper, we firstly propose a high efficient key-insulated ABE algorithm without pairings. The key-insulated mechanism guarantees both forward security and backward security when key exposure or user revocation happens. Besides, during the running of algorithms in our scheme, users and attribute authority needn't run any bilinear pairing operations, which will increase the efficiency to a large extent. The high efficiency and security analysis indicate that our scheme is more appropriate for secure protection in data sharing systems. PMID:26933630
A public-key cryptosystem for quantum message transmission
NASA Astrophysics Data System (ADS)
Yang, Li
2005-01-01
We present a quantum public-key cryptography protocol for quantum message transmission. The private key of this protocol includes three classical matrices: a generator matrix of a Goppa code, an invertible matrix and a permutation matrix. The public key is product of these three matrices. The encryption and decryption algorithms are merely quantum computations related with the transformations between bases of the quantum registers. The security of this protocol is based on the hypothesis that there is no effective algorithm of NP-complete problem.
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.
Quantum key distribution and 1 Gbps data encryption over a single fibre
NASA Astrophysics Data System (ADS)
Eraerds, P.; Walenta, N.; Legré, M.; Gisin, N.; Zbinden, H.
2010-06-01
We perform quantum key distribution (QKD) over a single fibre in the presence of four classical channels in a C-band dense wavelength division multiplexing (DWDM) configuration using a commercial QKD system. The classical channels are used for key distillation and 1 Gbps encrypted communication, rendering the entire system independent of any other communication channel than a single dedicated fibre. We successfully distil secret keys over fibre spans of up to 50 km. The separation between the quantum channel at 1551.72 nm and the nearest classical channel is only 200 GHz, while the classical channels are all separated by 100 GHz. In addition to that, we discuss possible improvements and alternative configurations, e.g. whether it is advantageous to choose the quantum channel at 1310 nm or to opt for a pure C-band (1530-1565 nm) configuration.
NASA Astrophysics Data System (ADS)
Peng, Xiang; Zhang, Peng; Cai, Lilong
In this paper, we present a virtual-optical based information security system model with the aid of public-key-infrastructure (PKI) techniques. The proposed model employs a hybrid architecture in which our previously published encryption algorithm based on virtual-optics imaging methodology (VOIM) can be used to encipher and decipher data while an asymmetric algorithm, for example RSA, is applied for enciphering and deciphering the session key(s). For an asymmetric system, given an encryption key, it is computationally infeasible to determine the decryption key and vice versa. The whole information security model is run under the framework of PKI, which is on basis of public-key cryptography and digital signatures. This PKI-based VOIM security approach has additional features like confidentiality, authentication, and integrity for the purpose of data encryption under the environment of network.
Applications of single-qubit rotations in quantum public-key cryptography
NASA Astrophysics Data System (ADS)
Nikolopoulos, Georgios M.
2008-03-01
We discuss cryptographic applications of single-qubit rotations from the perspective of trapdoor one-way functions and public-key encryption. In particular, we present an asymmetric cryptosystem whose security relies on fundamental principles of quantum physics. A quantum public key is used for the encryption of messages while decryption is possible by means of a classical private key only. The trapdoor one-way function underlying the proposed cryptosystem maps integer numbers to quantum states of a qubit and its inversion can be infeasible by virtue of the Holevo’s theorem.
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.
Secret Public Key Protocols Revisited
NASA Astrophysics Data System (ADS)
Lim, Hoon Wei; Paterson, Kenneth G.
Password-based protocols are important and popular means of providing human-to-machine authentication. The concept of secret public keys was proposed more than a decade ago as a means of securing password-based authentication protocols against off-line password guessing attacks, but was later found vulnerable to various attacks. In this paper, we revisit the concept and introduce the notion of identity-based secret public keys. Our new identity-based approach allows secret public keys to be constructed in a very natural way using arbitrary random strings, eliminating the structure found in, for example, RSA or ElGamal keys. We examine identity-based secret public key protocols and give informal security analyses, indicating that they are secure against off-line password guessing and other attacks.
Virtual-optical information security system based on public key infrastructure
NASA Astrophysics Data System (ADS)
Peng, Xiang; Zhang, Peng; Cai, Lilong; Niu, Hanben
2005-01-01
A virtual-optical based encryption model with the aid of public key infrastructure (PKI) is presented in this paper. The proposed model employs a hybrid architecture in which our previously published encryption method based on virtual-optics scheme (VOS) can be used to encipher and decipher data while an asymmetric algorithm, for example RSA, is applied for enciphering and deciphering the session key(s). The whole information security model is run under the framework of international standard ITU-T X.509 PKI, which is on basis of public-key cryptography and digital signatures. This PKI-based VOS security approach has additional features like confidentiality, authentication, and integrity for the purpose of data encryption under the environment of network. Numerical experiments prove the effectiveness of the method. The security of proposed model is briefly analyzed by examining some possible attacks from the viewpoint of a cryptanalysis.
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.
NASA Astrophysics Data System (ADS)
Liang, Chuang
New telecommunication techniques utilizing distinctive quantum properties, e.g., measurement uncertainties and entanglement, extend the capabilities of existing systems. Quantum cryptography, as an example, provides physical layer security enforced by fundamental physical laws, while modern cryptographic techniques rely on assumptions of intractability of certain mathematical problems with limited computational power. Rapid growth of the Internet leading to global telecommunications puts heavy demands on information security. A novel keyed direct data encryption technique based on the fundamental and irreducible quantum noise of laser light is shown to be compatible with the existing high-speed optical communications infrastructure. With this technique, line encryption for OC-12 (622 Mbps) SONET data over 250 km in a wavelength-division-multiplexing network is demonstrated with fully streaming data. Nonlocal correlation is employed in applications including cryptographic key generation whose practical realizations require telecom-band photon counting and entangled photon-pair generation. Existing telecom-band avalanche-photodiode based photon-counting techniques suffer from large detection noise at high operation rates. New techniques such as ultrashort gating and synchronous sampling at the onset of avalanches are introduced for suppressing the detection noise at high operation speeds. Photon counting at record speeds (25 MHz) that employing an avalanche photodiode is developed, demonstrated and deployed in the experimental studies. Telecom-band correlated photons can be directly created inside optical fibers through its chi(3) nonlinearity. This technique brings practical advantages such as the easy compatibility with fiber-optic systems, excellent spatial modal purity, and potential high-speed operation. As a practical development of this technique, a novel Faraday-mirror based ultra-stable scheme for generating polarization entangled photon-pairs is proposed
Modeling, Simulation and Analysis of Public Key Infrastructure
NASA Technical Reports Server (NTRS)
Liu, Yuan-Kwei; Tuey, Richard; Ma, Paul (Technical Monitor)
1998-01-01
Security is an essential part of network communication. The advances in cryptography have provided solutions to many of the network security requirements. Public Key Infrastructure (PKI) is the foundation of the cryptography applications. The main objective of this research is to design a model to simulate a reliable, scalable, manageable, and high-performance public key infrastructure. We build a model to simulate the NASA public key infrastructure by using SimProcess and MatLab Software. The simulation is from top level all the way down to the computation needed for encryption, decryption, digital signature, and secure web server. The application of secure web server could be utilized in wireless communications. The results of the simulation are analyzed and confirmed by using queueing theory.
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.
NASA Astrophysics Data System (ADS)
Weber, Robert E.
2001-11-01
approximately 15 Gigabyte table of IV values can be used to encrypt any packet. On a network only partially infiltrated, bit-wise manipulated packets can spoof their validity using the linear nature of the CSC checksum. Any combination of passive and active attacks can be used to modify commands as they are being sent or login information can be taken for use on another network to access personal accounts. WEP also has a critical flaw outside of the sophisticated attacks that can be used to subvert its security. WEP uses a shared key known by both the client machines and the base stations. For this reason the key can be lost through human security problems. This includes the loss of equipment to theft, employee turnover and general mishandling of key information. In order to implement secure wireless networks it has become clear that a new scheme must be developed which can address the 3 security concerns mentioned earlier and at the same time function on existing hardware and software.
Experiences of Using a Public Key Infrastructure for the Preparation of Examination Papers.
ERIC Educational Resources Information Center
Chadwick, David W.; Tassabehji, Rana; Young, Andrew
2000-01-01
Describes a project at the University of Salford (United Kingdom) that transferred examination papers between participants (lecturers, administrators and external examiners) using secure electronic mail via a managed public key infrastructure that used encryption methods. Discusses resistance to change and technology problems. (Contains 6…
NASA Astrophysics Data System (ADS)
Nikulin, Vladimir V.; Hughes, David H.; Malowicki, John; Bedi, Vijit
2015-05-01
Free-space optical communication channels offer secure links with low probability of interception and detection. Despite their point-to-point topology, additional security features may be required in privacy-critical applications. Encryption can be achieved at the physical layer by using quantized values of photons, which makes exploitation of such quantum communication links extremely difficult. One example of such technology is keyed communication in quantum noise, a novel quantum modulation protocol that offers ultra-secure communication with competitive performance characteristics. Its utilization relies on specific coherent measurements to decrypt the signal. The process of measurements is complicated by the inherent and irreducible quantum noise of coherent states. This problem is different from traditional laser communication with coherent detection; therefore continuous efforts are being made to improve the measurement techniques. Quantum-based encryption systems that use the phase of the signal as the information carrier impose aggressive requirements on the accuracy of the measurements when an unauthorized party attempts intercepting the data stream. Therefore, analysis of the secrecy of the data becomes extremely important. In this paper, we present the results of a study that had a goal of assessment of potential vulnerability of the running key. Basic results of the laboratory measurements are combined with simulation studies and statistical analysis that can be used for both conceptual improvement of the encryption approach and for quantitative comparison of secrecy of different quantum communication protocols.
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
An Identity-Based (IDB) Broadcast Encryption Scheme with Personalized Messages (BEPM)
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
An Identity-Based (IDB) Broadcast Encryption Scheme with Personalized Messages (BEPM).
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
Virtual microscopy and public-key cryptography for Internet telepathology.
Strauss, J S; Felten, C L; Okada, D H; Marchevsky, A M
1999-01-01
The Internet is a potentially inexpensive, widely available medium for telepathology, but there are concerns about its reliability and security. Using a digital camera, 41 photomicrographs of transbronchial biopsies, at x 100 optical magnification, were captured and digitized at 2700 x 3400 pixel, 24 bit/pixel resolution. The image files were saved in JPEG format at medium compression, attached to text files with patient information, encrypted for security in the S/MIME format using a digital signature and digital envelope, and transmitted by email. Received email files were decrypted automatically and the images viewed with standard software. Telepathology diagnoses were compared with original interpretations. The images averaged 810 kByte in size. The encryption and decryption did not cause significant delays in overall transmission time and, together with transmission, did not produce noticeable image degradation. The received image files could be viewed in a manner that simulated light microscopy. There was agreement between telepathology and original diagnoses in 92% of the cases. All the discrepancies were due to inadequate area selection because the pathological features of interest were present in histological levels other than those photographed. The use of high-resolution digital photomicrography, the Internet and public-key cryptography offers an effective and relatively inexpensive method of telepathology consultation. The method is best suited for the diagnosis of small biopsy specimens that require the transmission of only a few digital images that represent the majority of the biopsy materials. PMID:10628020
Tamaki, Kiyoshi; Kato, Go
2010-02-15
One of the simplest security proofs of quantum key distribution is based on the so-called complementarity scenario, which involves the complementarity control of an actual protocol and a virtual protocol [M. Koashi, e-print arXiv:0704.3661 (2007)]. The existing virtual protocol has a limitation in classical postprocessing, i.e., the syndrome for the error-correction step has to be encrypted. In this paper, we remove this limitation by constructing a quantum circuit for the virtual protocol. Moreover, our circuit with a shield system gives an intuitive proof of why adding noise to the sifted key increases the bit error rate threshold in the general case in which one of the parties does not possess a qubit. Thus, our circuit bridges the simple proof and the use of wider classes of classical postprocessing.
Yang, Yu-Guang; Xu, Peng; Yang, Rui; Zhou, Yi-Hua; Shi, Wei-Min
2016-01-01
Quantum information and quantum computation have achieved a huge success during the last years. In this paper, we investigate the capability of quantum Hash function, which can be constructed by subtly modifying quantum walks, a famous quantum computation model. It is found that quantum Hash function can act as a hash function for the privacy amplification process of quantum key distribution systems with higher security. As a byproduct, quantum Hash function can also be used for pseudo-random number generation due to its inherent chaotic dynamics. Further we discuss the application of quantum Hash function to image encryption and propose a novel image encryption algorithm. Numerical simulations and performance comparisons show that quantum Hash function is eligible for privacy amplification in quantum key distribution, pseudo-random number generation and image encryption in terms of various hash tests and randomness tests. It extends the scope of application of quantum computation and quantum information. PMID:26823196
Yang, Yu-Guang; Xu, Peng; Yang, Rui; Zhou, Yi-Hua; Shi, Wei-Min
2016-01-01
Quantum information and quantum computation have achieved a huge success during the last years. In this paper, we investigate the capability of quantum Hash function, which can be constructed by subtly modifying quantum walks, a famous quantum computation model. It is found that quantum Hash function can act as a hash function for the privacy amplification process of quantum key distribution systems with higher security. As a byproduct, quantum Hash function can also be used for pseudo-random number generation due to its inherent chaotic dynamics. Further we discuss the application of quantum Hash function to image encryption and propose a novel image encryption algorithm. Numerical simulations and performance comparisons show that quantum Hash function is eligible for privacy amplification in quantum key distribution, pseudo-random number generation and image encryption in terms of various hash tests and randomness tests. It extends the scope of application of quantum computation and quantum information. PMID:26823196
NASA Astrophysics Data System (ADS)
Yang, Yu-Guang; Xu, Peng; Yang, Rui; Zhou, Yi-Hua; Shi, Wei-Min
2016-01-01
Quantum information and quantum computation have achieved a huge success during the last years. In this paper, we investigate the capability of quantum Hash function, which can be constructed by subtly modifying quantum walks, a famous quantum computation model. It is found that quantum Hash function can act as a hash function for the privacy amplification process of quantum key distribution systems with higher security. As a byproduct, quantum Hash function can also be used for pseudo-random number generation due to its inherent chaotic dynamics. Further we discuss the application of quantum Hash function to image encryption and propose a novel image encryption algorithm. Numerical simulations and performance comparisons show that quantum Hash function is eligible for privacy amplification in quantum key distribution, pseudo-random number generation and image encryption in terms of various hash tests and randomness tests. It extends the scope of application of quantum computation and quantum information.
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.
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.
Fast WEP-Key Recovery Attack Using Only Encrypted IP Packets
NASA Astrophysics Data System (ADS)
Teramura, Ryoichi; Asakura, Yasuo; Ohigashi, Toshihiro; Kuwakado, Hidenori; Morii, Masakatu
Conventional efficient key recovery attacks against Wired Equivalent Privacy (WEP) require specific initialization vectors or specific packets. Since it takes much time to collect the packets sufficiently, any active attack should be performed. An Intrusion Detection System (IDS), however, will be able to prevent the attack. Since the attack logs are stored at the servers, it is possible to prevent such an attack. This paper proposes an algorithm for recovering a 104-bit WEP key from any IP packets in a realistic environment. This attack needs about 36, 500 packets with a success probability 0.5, and the complexity of our attack is equivalent to about 220 computations of the RC4 key setups. Since our attack is passive, it is difficult for both WEP users and administrators to detect our attack.
Public key infrastructure for DOE security research
Aiken, R.; Foster, I.; Johnston, W.E.
1997-06-01
This document summarizes the Department of Energy`s Second Joint Energy Research/Defence Programs Security Research Workshop. The workshop, built on the results of the first Joint Workshop which reviewed security requirements represented in a range of mission-critical ER and DP applications, discussed commonalties and differences in ER/DP requirements and approaches, and identified an integrated common set of security research priorities. One significant conclusion of the first workshop was that progress in a broad spectrum of DOE-relevant security problems and applications could best be addressed through public-key cryptography based systems, and therefore depended upon the existence of a robust, broadly deployed public-key infrastructure. Hence, public-key infrastructure ({open_quotes}PKI{close_quotes}) was adopted as a primary focus for the second workshop. The Second Joint Workshop covered a range of DOE security research and deployment efforts, as well as summaries of the state of the art in various areas relating to public-key technologies. Key findings were that a broad range of DOE applications can benefit from security architectures and technologies built on a robust, flexible, widely deployed public-key infrastructure; that there exists a collection of specific requirements for missing or undeveloped PKI functionality, together with a preliminary assessment of how these requirements can be met; that, while commercial developments can be expected to provide many relevant security technologies, there are important capabilities that commercial developments will not address, due to the unique scale, performance, diversity, distributed nature, and sensitivity of DOE applications; that DOE should encourage and support research activities intended to increase understanding of security technology requirements, and to develop critical components not forthcoming from other sources in a timely manner.
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.
Number Theory and Public-Key Cryptography.
ERIC Educational Resources Information Center
Lefton, Phyllis
1991-01-01
Described are activities in the study of techniques used to conceal the meanings of messages and data. Some background information and two BASIC programs that illustrate the algorithms used in a new cryptographic system called "public-key cryptography" are included. (CW)
Compressive Optical Image Encryption
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
Compressive optical image encryption.
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
Arithmetic for Public-Key Cryptography
NASA Astrophysics Data System (ADS)
Sakiyama, Kazuo; Batina, Lejla
In this chapter, we discuss arithmetic algorithms used for implementing public-key cryptography (PKC). More precisely, we explore the various algorithms for RSA exponentiation and point/divisor multiplication for curve-based cryptography. The selection of the algorithms has a profound impact on the trade-off between cost, performance, and security. The goal of this chapter is to introduce the different recoding techniques to reduce the number of computations efficiently.
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.
Information hiding based on double random-phase encoding and public-key cryptography.
Sheng, Yuan; Xin, Zhou; Alam, Mohammed S; Xi, Lu; Xiao-Feng, Li
2009-03-01
A novel information hiding method based on double random-phase encoding (DRPE) and Rivest-Shamir-Adleman (RSA) public-key cryptosystem is proposed. In the proposed technique, the inherent diffusion property of DRPE is cleverly utilized to make up the diffusion insufficiency of RSA public-key cryptography, while the RSA cryptosystem is utilized for simultaneous transmission of the cipher text and the two phase-masks, which is not possible under the DRPE technique. This technique combines the complementary advantages of the DPRE and RSA encryption techniques and brings security and convenience for efficient information transmission. Extensive numerical simulation results are presented to verify the performance of the proposed technique. PMID:19259163
PEM public key certificate cache server
NASA Astrophysics Data System (ADS)
Cheung, T.
1993-12-01
Privacy Enhanced Mail (PEM) provides privacy enhancement services to users of Internet electronic mail. Confidentiality, authentication, message integrity, and non-repudiation of origin are provided by applying cryptographic measures to messages transferred between end systems by the Message Transfer System. PEM supports both symmetric and asymmetric key distribution. However, the prevalent implementation uses a public key certificate-based strategy, modeled after the X.509 directory authentication framework. This scheme provides an infrastructure compatible with X.509. According to RFC 1422, public key certificates can be stored in directory servers, transmitted via non-secure message exchanges, or distributed via other means. Directory services provide a specialized distributed database for OSI applications. The directory contains information about objects and then provides structured mechanisms for accessing that information. Since directory services are not widely available now, a good approach is to manage certificates in a centralized certificate server. This document describes the detailed design of a centralized certificate cache serve. This server manages a cache of certificates and a cache of Certificate Revocation Lists (CRL's) for PEM applications. PEMapplications contact the server to obtain/store certificates and CRL's. The server software is programmed in C and ELROS. To use this server, ISODE has to be configured and installed properly. The ISODE library 'libisode.a' has to be linked together with this library because ELROS uses the transport layer functions provided by 'libisode.a.' The X.500 DAP library that is included with the ELROS distribution has to be linked in also, since the server uses the DAP library functions to communicate with directory servers.
Low-Power Public Key Cryptography
BEAVER,CHERYL L.; DRAELOS,TIMOTHY J.; HAMILTON,VICTORIA A.; SCHROEPPEL,RICHARD C.; GONZALES,RITA A.; MILLER,RUSSELL D.; THOMAS,EDWARD V.
2000-11-01
This report presents research on public key, digital signature algorithms for cryptographic authentication in low-powered, low-computation environments. We assessed algorithms for suitability based on their signature size, and computation and storage requirements. We evaluated a variety of general purpose and special purpose computing platforms to address issues such as memory, voltage requirements, and special functionality for low-powered applications. In addition, we examined custom design platforms. We found that a custom design offers the most flexibility and can be optimized for specific algorithms. Furthermore, the entire platform can exist on a single Application Specific Integrated Circuit (ASIC) or can be integrated with commercially available components to produce the desired computing platform.
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.
76 FR 48807 - Public Key Infrastructure (PKI) Certificate Action Form
Federal Register 2010, 2011, 2012, 2013, 2014
2011-08-09
... From the Federal Register Online via the Government Publishing Office DEPARTMENT OF COMMERCE United States Patent and Trademark Office Public Key Infrastructure (PKI) Certificate Action Form ACTION.... Abstract The United States Patent and Trademark Office (USPTO) uses Public Key Infrastructure...
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.
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.
Private predictive analysis on encrypted medical data.
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
Privacy-preserving photo sharing based on a public key infrastructure
NASA Astrophysics Data System (ADS)
Yuan, Lin; McNally, David; Küpçü, Alptekin; Ebrahimi, Touradj
2015-09-01
A significant number of pictures are posted to social media sites or exchanged through instant messaging and cloud-based sharing services. Most social media services offer a range of access control mechanisms to protect users privacy. As it is not in the best interest of many such services if their users restrict access to their shared pictures, most services keep users' photos unprotected which makes them available to all insiders. This paper presents an architecture for a privacy-preserving photo sharing based on an image scrambling scheme and a public key infrastructure. A secure JPEG scrambling is applied to protect regional visual information in photos. Protected images are still compatible with JPEG coding and therefore can be viewed by any one on any device. However, only those who are granted secret keys will be able to descramble the photos and view their original versions. The proposed architecture applies an attribute-based encryption along with conventional public key cryptography, to achieve secure transmission of secret keys and a fine-grained control over who may view shared photos. In addition, we demonstrate the practical feasibility of the proposed photo sharing architecture with a prototype mobile application, ProShare, which is built based on iOS platform.
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.
Quantum computing on encrypted data.
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
Multiplexing of encrypted data using fractal masks.
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
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
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.
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
Novel Image Encryption based on Quantum Walks
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
Novel image encryption based on quantum walks.
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
NASA Astrophysics Data System (ADS)
Gunn, Lachlan J.; Chappell, James M.; Allison, Andrew; Abbott, Derek
2014-09-01
While information-theoretic security is often associated with the one-time pad and quantum key distribution, noisy transport media leave room for classical techniques and even covert operation. Transit times across the public internet exhibit a degree of randomness, and cannot be determined noiselessly by an eavesdropper. We demonstrate the use of these measurements for information-theoretically secure communication over the public internet.
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.
Partially Key Distribution with Public Key Cryptosystem Based on Error Control Codes
NASA Astrophysics Data System (ADS)
Tavallaei, Saeed Ebadi; Falahati, Abolfazl
Due to the low level of security in public key cryptosystems based on number theory, fundamental difficulties such as "key escrow" in Public Key Infrastructure (PKI) and a secure channel in ID-based cryptography, a new key distribution cryptosystem based on Error Control Codes (ECC) is proposed . This idea is done by some modification on McEliece cryptosystem. The security of ECC cryptosystem obtains from the NP-Completeness of block codes decoding. The capability of generating public keys with variable lengths which is suitable for different applications will be provided by using ECC. It seems that usage of these cryptosystems because of decreasing in the security of cryptosystems based on number theory and increasing the lengths of their keys would be unavoidable in future.
Development of a public key infrastructure across multiple enterprises
Sharick, T.M.; Long, J.P.; Desind, B.J.
1997-05-01
Main-stream applications are beginning to incorporate public key cryptography. It can be difficult to deploy this technology without a robust infrastructure to support it. It can also be difficult to deploy a public key infrastructure among multiple enterprises when different applications and standards must be supported. This discussion chronicles the efforts by a team within the US Department of Energy`s Nuclear Weapons Complex to build a public key infrastructure and deploy applications that use it. The emphasis of this talk will be on the lessons learned during this effort and an assessment of the overall impact of this technology.
A Public-Key Based Authentication and Key Establishment Protocol Coupled with a Client Puzzle.
ERIC Educational Resources Information Center
Lee, M. C.; Fung, Chun-Kan
2003-01-01
Discusses network denial-of-service attacks which have become a security threat to the Internet community and suggests the need for reliable authentication protocols in client-server applications. Presents a public-key based authentication and key establishment protocol coupled with a client puzzle protocol and validates it through formal logic…
Dunigan, T.; Cao, C.
1997-08-01
This report describes an architecture and implementation for doing group key management over a data communications network. The architecture describes a protocol for establishing a shared encryption key among an authenticated and authorized collection of network entities. Group access requires one or more authorization certificates. The implementation includes a simple public key and certificate infrastructure. Multicast is used for some of the key management messages. An application programming interface multiplexes key management and user application messages. An implementation using the new IP security protocols is postulated. The architecture is compared with other group key management proposals, and the performance and the limitations of the implementation are described.
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.
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.
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.
An Efficient and Provable Secure Revocable Identity-Based Encryption Scheme
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
Public Expenditures on Children through 2008: Key Facts
ERIC Educational Resources Information Center
Macomber, Jennifer; Isaacs, Julia; Kent, Adam; Vericker, Tracy
2010-01-01
This report provides the key findings on the public spending on children through 2008. They are: (1) Spending on children increased under the American Recovery and Reinvestment Act (ARRA) and other stimulus spending, but not proportionately to other federal spending. As ARRA expires, we project that spending on children will decline, assuming no…
An investigation of DUA caching strategies for public key certificates
Cheung, T.C.
1993-11-01
Internet Privacy Enhanced Mail (PEM) provides security services to users of Internet electronic mail. PEM is designed with the intention that it will eventually obtain public key certificates from the X.500 directory service. However, such a capability is not present in most PEM implementations today. While the prevalent PEM implementation uses a public key certificate-based strategy, certificates are mostly distributed via e-mail exchanges, which raises several security and performance issues. In this thesis research, we changed the reference PEM implementation to make use of the X.500 directory service instead of local databases for public key certificate management. The thesis discusses some problems with using the X.500 directory service, explores the relevant issues, and develops an approach to address them. The approach makes use of a memory cache to store public key certificates. We implemented a centralized cache server and addressed the denial-of-service security problem that is present in the server. In designing the cache, we investigated several cache management strategies. One result of our study is that the use of a cache significantly improves performance. Our research also indicates that security incurs extra performance cost. Different cache replacement algorithms do not seem to yield significant performance differences, while delaying dirty-writes to the backing store does improve performance over immediate writes.
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.
GENERAL: Efficient quantum secure communication with a publicly known key
NASA Astrophysics Data System (ADS)
Li, Chun-Yan; Li, Xi-Han; Deng, Fu-Guo; Zhou, Hong-Yu
2008-07-01
This paper presents a simple way for an eavesdropper to eavesdrop freely the secret message in the experimental realization of quantum communication protocol proposed by Beige et al (2002 Acta Phys. Pol. A 101 357). Moreover, it introduces an efficient quantum secure communication protocol based on a publicly known key with decoy photons and two biased bases by modifying the original protocol. The total efficiency of this new protocol is double that of the original one. With a low noise quantum channel, this protocol can be used for transmitting a secret message. At present, this protocol is good for generating a private key efficiently.
An application of different dioids in public key cryptography
Durcheva, Mariana I.
2014-11-18
Dioids provide a natural framework for analyzing a broad class of discrete event dynamical systems such as the design and analysis of bus and railway timetables, scheduling of high-throughput industrial processes, solution of combinatorial optimization problems, the analysis and improvement of flow systems in communication networks. They have appeared in several branches of mathematics such as functional analysis, optimization, stochastic systems and dynamic programming, tropical geometry, fuzzy logic. In this paper we show how to involve dioids in public key cryptography. The main goal is to create key – exchange protocols based on dioids. Additionally the digital signature scheme is presented.
A Survey of Research Progress and Development Tendency of Attribute-Based Encryption
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
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.
Report on the Development of the Advanced Encryption Standard (AES).
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
Report on the Development of the Advanced Encryption Standard (AES)
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.
Multiply-agile encryption in high speed communication networks
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.
Security of Color Image Data Designed by Public-Key Cryptosystem Associated with 2D-DWT
NASA Astrophysics Data System (ADS)
Mishra, D. C.; Sharma, R. K.; Kumar, Manish; Kumar, Kuldeep
2014-08-01
In present times the security of image data is a major issue. So, we have proposed a novel technique for security of color image data by public-key cryptosystem or asymmetric cryptosystem. In this technique, we have developed security of color image data using RSA (Rivest-Shamir-Adleman) cryptosystem with two-dimensional discrete wavelet transform (2D-DWT). Earlier proposed schemes for security of color images designed on the basis of keys, but this approach provides security of color images with the help of keys and correct arrangement of RSA parameters. If the attacker knows about exact keys, but has no information of exact arrangement of RSA parameters, then the original information cannot be recovered from the encrypted data. Computer simulation based on standard example is critically examining the behavior of the proposed technique. Security analysis and a detailed comparison between earlier developed schemes for security of color images and proposed technique are also mentioned for the robustness of the cryptosystem.
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.
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.
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.
Dynamic video encryption algorithm for H.264/AVC based on a spatiotemporal chaos system.
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
The role of decimated sequences in scaling encryption speeds through parallelism
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.
Attribute-based proxy re-encryption with keyword search.
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
Attribute-Based Proxy Re-Encryption with Keyword Search
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
Federal Register 2010, 2011, 2012, 2013, 2014
2010-04-19
... From the Federal Register Online via the Government Publishing Office GENERAL SERVICES ADMINISTRATION Public Buildings Service; Key Largo Beacon Annex Site; Key Largo, FL; Transfer of Property..., identified as Key Largo Beacon Annex Site, Key Largo, FL to the U.S. Fish and Wildlife Service, Department...
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
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.
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.
Optical image encryption based on multifractional Fourier transforms.
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
Public key cryptosystem based on max-semirings
NASA Astrophysics Data System (ADS)
Durcheva, Mariana I.; Trendafilov, Ivan D.
2012-11-01
When we replace addition and multiplication of real numbers by the operations of taking the maximum of two numbers and of adding two numbers respectively, we obtain the so-called max-algebra which offers an attractive language to deal with certain problems in automata theory, scheduling theory, discrete event systems, manufacturing systems, telecommunication networks, parallel processing systems and traffic control. The aim of this paper is to employ max-algebra as platforms for secret key establishment between two individuals whose only means of communication is a public channel. The proposed new cryptographic protocols are based on the difficulty of solving matrix equations since matrices over max-semirings are generally not invertible.
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.
The Case for Quantum Key Distribution
NASA Astrophysics Data System (ADS)
Stebila, Douglas; Mosca, Michele; Lütkenhaus, Norbert
Quantum key distribution (QKD) promises secure key agreement by using quantum mechanical systems. We argue that QKD will be an important part of future cryptographic infrastructures. It can provide long-term confidentiality for encrypted information without reliance on computational assumptions. Although QKD still requires authentication to prevent man-in-the-middle attacks, it can make use of either information-theoretically secure symmetric key authentication or computationally secure public key authentication: even when using public key authentication, we argue that QKD still offers stronger security than classical key agreement.
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.
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.
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.
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
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
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.
Sandia Scalable Encryption Software
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.
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.
Sandia Scalable Encryption Software
Energy Science and Technology Software Center (ESTSC)
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
A Novel Image Encryption Algorithm Based on DNA Subsequence Operation
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
A novel image encryption algorithm based on DNA subsequence operation.
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
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.
Lin, Chao; Shen, Xueju; Li, Baochen
2014-08-25
We demonstrate that all parameters of optical lightwave can be simultaneously designed as keys in security system. This multi-dimensional property of key can significantly enlarge the key space and further enhance the security level of the system. The single-shot off-axis digital holography with orthogonal polarized reference waves is employed to perform polarization state recording on object wave. Two pieces of polarization holograms are calculated and fabricated to be arranged in reference arms to generate random amplitude and phase distribution respectively. When reconstruction, original information which is represented with QR code can be retrieved using Fresnel diffraction with decryption keys and read out noise-free. Numerical simulation results for this cryptosystem are presented. An analysis on the key sensitivity and fault tolerance properties are also provided. PMID:25321276
Argumentation Key to Communicating Climate Change to the Public
NASA Astrophysics Data System (ADS)
Bleicher, R. E.; Lambert, J. L.
2012-12-01
Argumentation plays an important role in how we communicate climate change science to the public and is a key component integrated throughout the Next Generation Science Standards. A scientific argument can be described as a disagreement between explanations with data being used to justify each position. Argumentation is social process where two or more individuals construct and critique arguments (Kuhn & Udell, 2003; Nussbaum, 1997). Sampson, Grooms, and Walker's (2011) developed a framework for understanding the components of a scientific argument. The three components start with a claim (a conjecture, conclusion, explanation, or an answer to a research question). This claim must fit the evidence (observations that show trends over time, relationships between variables or difference between groups). The evidence must be justified with reasoning (explains how the evidence supports the explanation and whey it should count as support). In a scientific argument, or debate, the controversy focuses on how data were collected, what data can or should be included, and what inferences can be made based on a set of evidence. Toulmin's model (1969) also includes rebutting or presenting an alternative explanation supported by counter evidence and reasoning of why the alternative is not the appropriate explanation for the question of the problem. The process of scientific argumentation should involve the construction and critique of scientific arguments, one that involves the consideration of alternative hypotheses (Lawson, 2003). Scientific literacy depends as much on the ability to refute and recognize poor scientific arguments as much as it does on the ability to present an effective argument based on good scientific data (Osborne, 2010). Argument is, therefore, a core feature of science. When students learn to construct a sound scientific argument, they demonstrate critical thinking and a mastery of the science being taught. To present a convincing argument in support of
Key Information Systems Issues: An Analysis of MIS Publications.
ERIC Educational Resources Information Center
Palvia, Prashant C.; And Others
1996-01-01
Presents results of a content analysis of journal articles discussing management information systems (MIS) that was conducted to identify, classify, and prioritize the key issues; to perform a trend analysis; and to compare results with previous studies. Twenty-six key issues are ranked according to frequency of occurrence. Contains 52 references.…
Encryption and the loss of patient data.
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
Known-plaintext attack on a joint transform correlator encrypting system.
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
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.
On the security of a simple three-party key exchange protocol without server's public keys.
Nam, Junghyun; Choo, Kim-Kwang Raymond; Park, Minkyu; Paik, Juryon; Won, Dongho
2014-01-01
Authenticated key exchange protocols are of fundamental importance in securing communications and are now extensively deployed for use in various real-world network applications. In this work, we reveal major previously unpublished security vulnerabilities in the password-based authenticated three-party key exchange protocol according to Lee and Hwang (2010): (1) the Lee-Hwang protocol is susceptible to a man-in-the-middle attack and thus fails to achieve implicit key authentication; (2) the protocol cannot protect clients' passwords against an offline dictionary attack; and (3) the indistinguishability-based security of the protocol can be easily broken even in the presence of a passive adversary. We also propose an improved password-based authenticated three-party key exchange protocol that addresses the security vulnerabilities identified in the Lee-Hwang protocol. PMID:25258723
On the Security of a Simple Three-Party Key Exchange Protocol without Server's Public Keys
Nam, Junghyun; Choo, Kim-Kwang Raymond; Park, Minkyu; Paik, Juryon; Won, Dongho
2014-01-01
Authenticated key exchange protocols are of fundamental importance in securing communications and are now extensively deployed for use in various real-world network applications. In this work, we reveal major previously unpublished security vulnerabilities in the password-based authenticated three-party key exchange protocol according to Lee and Hwang (2010): (1) the Lee-Hwang protocol is susceptible to a man-in-the-middle attack and thus fails to achieve implicit key authentication; (2) the protocol cannot protect clients' passwords against an offline dictionary attack; and (3) the indistinguishability-based security of the protocol can be easily broken even in the presence of a passive adversary. We also propose an improved password-based authenticated three-party key exchange protocol that addresses the security vulnerabilities identified in the Lee-Hwang protocol. PMID:25258723
An Image Encryption Algorithm Utilizing Julia Sets and Hilbert Curves
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
Secure key storage and distribution
Agrawal, Punit
2015-06-02
This disclosure describes a distributed, fault-tolerant security system that enables the secure storage and distribution of private keys. In one implementation, the security system includes a plurality of computing resources that independently store private keys provided by publishers and encrypted using a single security system public key. To protect against malicious activity, the security system private key necessary to decrypt the publication private keys is not stored at any of the computing resources. Rather portions, or shares of the security system private key are stored at each of the computing resources within the security system and multiple security systems must communicate and share partial decryptions in order to decrypt the stored private key.
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.
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.
A DNA-Inspired Encryption Methodology for Secure, Mobile Ad Hoc Networks
NASA Technical Reports Server (NTRS)
Shaw, Harry
2012-01-01
Users are pushing for greater physical mobility with their network and Internet access. Mobile ad hoc networks (MANET) can provide an efficient mobile network architecture, but security is a key concern. A figure summarizes differences in the state of network security for MANET and fixed networks. MANETs require the ability to distinguish trusted peers, and tolerate the ingress/egress of nodes on an unscheduled basis. Because the networks by their very nature are mobile and self-organizing, use of a Public Key Infra structure (PKI), X.509 certificates, RSA, and nonce ex changes becomes problematic if the ideal of MANET is to be achieved. Molecular biology models such as DNA evolution can provide a basis for a proprietary security architecture that achieves high degrees of diffusion and confusion, and resistance to cryptanalysis. A proprietary encryption mechanism was developed that uses the principles of DNA replication and steganography (hidden word cryptography) for confidentiality and authentication. The foundation of the approach includes organization of coded words and messages using base pairs organized into genes, an expandable genome consisting of DNA-based chromosome keys, and a DNA-based message encoding, replication, and evolution and fitness. In evolutionary computing, a fitness algorithm determines whether candidate solutions, in this case encrypted messages, are sufficiently encrypted to be transmitted. The technology provides a mechanism for confidential electronic traffic over a MANET without a PKI for authenticating users.
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.
Key Performance Indicators of Public Universities Based on Quality Assessment Criteria in Thailand
ERIC Educational Resources Information Center
Sukboonyasatit, Kritsana; Thanapaisarn, Chaiwit; Manmar, Lampang
2011-01-01
The research objective was to develop public universities' key performance indicators. Qualitative research and interviews were employed with each public university's senior executive and quality assessors. The sample group was selected by the office of the public sector development commission and Thailand's public universities can be separated…
Photonic encryption using all optical logic.
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
Writing for Professional Publication. Keys to Academic and Business Success.
ERIC Educational Resources Information Center
Henson, Kenneth T.
This book provides practical help for people writing for publication, especially for those writing for professional journals or university presses. Chapters cover the following topics: (1) reasons for writing; (2) finding topics; (3) getting started; (4) writing style; (5) organizing articles; (6) using journals, libraries, surveys, and action…
Status report on knapsack-based public key cryptosystems
Brickell, E.F.; Simmons, G.J.
1983-02-01
In the period since 1976, when Diffie and Hellman published the first discussion of two-key cryptography to appear in the open literature, only a handful of two-key cryptoalgorithms have been proposed - two of which are based on the knapsack problem. Consequently there was enormous interest when Shamir announced in early 1982 a cryptanalytic technique that could break many Merkle-Hellman knapsacks. In a rapid sequence of developments, Simmons and Brickell, Adleman, and Lagarias all announced other attacks on knapsack-based cryptosystems that were either computationally much more efficient or else directed at other knapsack schemes such as the Graham-Shamir or iterated systems. This paper analyzes the common features of knapsack-based cryptosystems and presents all of the cryptanalytic attacks made in 1982 from a unified viewpoint.
Security enhancement of a phase-truncation based image encryption algorithm.
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
Chaos based encryption system for encrypting electroencephalogram signals.
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
DOE and Public Involvement A Key to Successful Clean Up
Sarten, S.
2008-07-01
The combination of two vital elements in the Oak Ridge, TN area are the Department of Energy and the education of the public, at any age, of the necessary work that is and has been going on this region of the country since the setting aside of land during the World War II era. A wide variety of interested citizens from surrounding counties make up a group of individuals that bring different elements of education and involvement to form a committee of whose interest is the Department of Energy's handling of contaminated material. The effort of one of the committees on this board has given the public a resource of material to develop a better understanding of the history and stewardship efforts taking place at the Oak Ridge Reservation. (authors)
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.
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.
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.
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.
Wikipedia: a key tool for global public health promotion.
Heilman, James M; Kemmann, Eckhard; Bonert, Michael; Chatterjee, Anwesh; Ragar, Brent; Beards, Graham M; Iberri, David J; Harvey, Matthew; Thomas, Brendan; Stomp, Wouter; Martone, Michael F; Lodge, Daniel J; Vondracek, Andrea; de Wolff, Jacob F; Liber, Casimir; Grover, Samir C; Vickers, Tim J; Meskó, Bertalan; Laurent, Michaël R
2011-01-01
The Internet has become an important health information resource for patients and the general public. Wikipedia, a collaboratively written Web-based encyclopedia, has become the dominant online reference work. It is usually among the top results of search engine queries, including when medical information is sought. Since April 2004, editors have formed a group called WikiProject Medicine to coordinate and discuss the English-language Wikipedia's medical content. This paper, written by members of the WikiProject Medicine, discusses the intricacies, strengths, and weaknesses of Wikipedia as a source of health information and compares it with other medical wikis. Medical professionals, their societies, patient groups, and institutions can help improve Wikipedia's health-related entries. Several examples of partnerships already show that there is enthusiasm to strengthen Wikipedia's biomedical content. Given its unique global reach, we believe its possibilities for use as a tool for worldwide health promotion are underestimated. We invite the medical community to join in editing Wikipedia, with the goal of providing people with free access to reliable, understandable, and up-to-date health information. PMID:21282098
Wikipedia: A Key Tool for Global Public Health Promotion
Heilman, James M; Kemmann, Eckhard; Bonert, Michael; Chatterjee, Anwesh; Ragar, Brent; Beards, Graham M; Iberri, David J; Harvey, Matthew; Thomas, Brendan; Stomp, Wouter; Martone, Michael F; Lodge, Daniel J; Vondracek, Andrea; de Wolff, Jacob F; Liber, Casimir; Grover, Samir C; Vickers, Tim J; Meskó, Bertalan
2011-01-01
The Internet has become an important health information resource for patients and the general public. Wikipedia, a collaboratively written Web-based encyclopedia, has become the dominant online reference work. It is usually among the top results of search engine queries, including when medical information is sought. Since April 2004, editors have formed a group called WikiProject Medicine to coordinate and discuss the English-language Wikipedia’s medical content. This paper, written by members of the WikiProject Medicine, discusses the intricacies, strengths, and weaknesses of Wikipedia as a source of health information and compares it with other medical wikis. Medical professionals, their societies, patient groups, and institutions can help improve Wikipedia’s health-related entries. Several examples of partnerships already show that there is enthusiasm to strengthen Wikipedia’s biomedical content. Given its unique global reach, we believe its possibilities for use as a tool for worldwide health promotion are underestimated. We invite the medical community to join in editing Wikipedia, with the goal of providing people with free access to reliable, understandable, and up-to-date health information. PMID:21282098
Optoelectronic information encryption with phase-shifting interferometry.
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
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.
A New Color Image Encryption Scheme Using CML and a Fractional-Order Chaotic System
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
Public key suppression and recovery using a PANDA ring resonator for high security communication
NASA Astrophysics Data System (ADS)
Juleang, Pakorn; Phongsanam, Prapas; Mitatha, Somsak; Yupapin, Preecha P.
2011-03-01
An interesting security technique that uses the dark-bright soliton conversion control within the microring resonator is proposed. The obtained outputs for a dark-bright soliton dynamic state can be controlled and used to form the public key suppression for communication security application. However, a good design should be possible to be fabricated; therefore, by using the parameters based on the practical device parameters, the simulation results obtained have shown that the proposed system can indeed be achieved. The public key suppression and public key recovery can be used in a highly secure communication system and has potential applications in optical cryptography.
The Public-Key-Infrastructure of the Radiological Society of Germany.
Schütze, B; Kämmerer, M; Klos, G; Mildenberger, P
2006-03-01
Pretty Good Privacy (PGP) encoding is based on the Public-Key-Procedure and permits the safe transmission of medical data. Furthermore it allows the use of an electronic signature provided that keys used belong to the key owner and that the key owner's identity is guaranteed by a trusted third party. Under the auspices of the Radiological Society of Germany (Deutsche Röntgengesellschaft, DRG) its IT-Working Group (Arbeitsgemeinschaft für Informationstechnik, @GIT) built up an appropriate Certification Authority including the required Public-Key-Infrastructure. These @GIT certified PGP keys allow the legal use of telemedicine in Germany. Digital signatures based to those certified keys correspond to the advanced signature according to the German Signature Law. PMID:16324813
NASA Astrophysics Data System (ADS)
Knobler, Ron; Scheffel, Peter; Jackson, Scott; Gaj, Kris; Kaps, Jens Peter
2013-05-01
Various embedded systems, such as unattended ground sensors (UGS), are deployed in dangerous areas, where they are subject to compromise. Since numerous systems contain a network of devices that communicate with each other (often times with commercial off the shelf [COTS] radios), an adversary is able to intercept messages between system devices, which jeopardizes sensitive information transmitted by the system (e.g. location of system devices). Secret key algorithms such as AES are a very common means to encrypt all system messages to a sufficient security level, for which lightweight implementations exist for even very resource constrained devices. However, all system devices must use the appropriate key to encrypt and decrypt messages from each other. While traditional public key algorithms (PKAs), such as RSA and Elliptic Curve Cryptography (ECC), provide a sufficiently secure means to provide authentication and a means to exchange keys, these traditional PKAs are not suitable for very resource constrained embedded systems or systems which contain low reliability communication links (e.g. mesh networks), especially as the size of the network increases. Therefore, most UGS and other embedded systems resort to pre-placed keys (PPKs) or other naïve schemes which greatly reduce the security and effectiveness of the overall cryptographic approach. McQ has teamed with the Cryptographic Engineering Research Group (CERG) at George Mason University (GMU) to develop an approach using revolutionary cryptographic techniques that provides both authentication and encryption, but on resource constrained embedded devices, without the burden of large amounts of key distribution or storage.
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.
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.
The Emissions Characterization and Prevention Branch (ECPB) of NRMRL's Air Pollution Prevention and Control Division in Research Triangle Park, NC, produces highly specialized scientific and technical documents relating to ECPB's research areas. A list of key publications coveri...
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.
Data publication and dissemination of interactive keys under the open access model
Technology Transfer Automated Retrieval System (TEKTRAN)
The concepts of publication, citation and dissemination of interactive keys and other online keys are discussed and illustrated by a sample paper published in the present issue (doi: 10.3897/zookeys.21.271). The present model is based on previous experience with several existing examples of publishi...
Encryption and networking applications
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.
Cancelable face verification using optical encryption and authentication.
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
Secure Genomic Computation through Site-Wise Encryption.
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
Secure Genomic Computation through Site-Wise Encryption
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
Integrating end-to-end encryption and authentication technology into broadband networks
Pierson, L.G.
1995-11-01
BISDN services will involve the integration of high speed data, voice, and video functionality delivered via technology similar to Asynchronous Transfer Mode (ATM) switching and SONET optical transmission systems. Customers of BISDN services may need a variety of data authenticity and privacy assurances, via Asynchronous Transfer Mode (ATM) services 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. While there are many design issues associated with the serving of public keys for authenticated signaling and for establishment of session cryptovariables, this paper is concerned with the impact of encryption itself on such communications once the signaling and setup have been completed. Network security protections should be carefully matched to the threats against which protection is desired. Even after eliminating unnecessary protections, the remaining customer-required network security protections can impose severe performance penalties. These penalties (further discussed below) usually involve increased communication processing for authentication or encryption, increased error rate, increased communication delay, and decreased reliability/availability. Protection measures involving encryption should be carefully engineered so as to impose the least performance, reliability, and functionality penalties, while achieving the required security protection. 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.
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.
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.
Optimal encryption of quantum bits
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.
Interactive identification protocol based on a quantum public-key cryptosystem
NASA Astrophysics Data System (ADS)
Wu, Chenmiao; Yang, Li
2014-11-01
We propose two interactive identification protocols based on a general construction of quantum public-key cryptosystem. Basic protocol contains set-up phase and authentication phase. Participants do operation with quantum computing of Boolean function in two-round transmission of authentication phase. Basic one only ensures completeness and soundness, but leaks information about private-key. We modify basic protocol with random string and random Boolean permutation. After modification, both transmitted states in two-round transmission can be proved to be ultimate mixed states. No participant or attacker will get useful information about private-key by measuring such states. Modified protocol achieves property of zero-knowledge.
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.
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…
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.
Optical encryption/decryption of 8PSK signal using FWM-based modified XOR.
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
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.
Federal Register 2010, 2011, 2012, 2013, 2014
2011-01-03
... commercial entities by the Surface Deployment and Distribution Command, the United States Department of the... Department of the Army Requirement for Commercial Users To Use Commercial Public Key Information (PKI) Certificate AGENCY: Department of the Army, DoD. Surface Deployment and Distribution Command (SDDC)....
Management of PEM public key certificates using X.500 directory service: Some problems and solutions
Cheung, Terry C.
1993-08-01
Internet Privacy Enhanced Mail (PEM) provides security services to users of Internet electronic mail. While the prevalent PEM implementation uses a public key certificate-based strategy, certificates are mostly distributed vie e-mail exchanges, which raises several security and performance issues. This paper discusses some problems with this strategy, explores the relevant issues, and develops an approach to address them.
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.
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.
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.
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.
Optical-data storage-readout technique based on fractal encrypting masks.
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
The Development of a Portable Hard Disk Encryption/Decryption System with a MEMS Coded Lock.
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
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.
Photonic encryption : modeling and functional analysis of all optical logic.
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
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.
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,...
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,...
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.
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.
Testing a Variety of Encryption Technologies
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.
Private genome analysis through homomorphic encryption
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
Nghiem, Nhung; Genç, Murat; Blakely, Tony
2013-01-01
Pricing policies such as taxes and subsidies are important tools in preventing and controlling a range of threats to public health. This is particularly so in tobacco and alcohol control efforts and efforts to change dietary patterns and physical activity levels as a means of addressing increases in noncommunicable diseases. To understand the potential impact of pricing policies, it is critical to understand the nature of price elasticities for consumer products. For example, price elasticities are key parameters in models of any food tax or subsidy that aims to quantify health impacts and cost-effectiveness. We detail relevant terms and discuss key issues surrounding price elasticities to inform public health research and intervention studies. PMID:24028228
Li, Jiguo
2014-01-01
Signcryption is a useful cryptographic primitive that achieves confidentiality and authentication in an efficient manner. As an extension of signcryption in certificate-based cryptography, certificate-based signcryption preserves the merits of certificate-based cryptography and signcryption simultaneously. In this paper, we present an improved security model of certificate-based signcryption that covers both public key replacement attack and insider security. We show that an existing certificate-based signcryption scheme is insecure in our model. We also propose a new certificate-based signcryption scheme that achieves security against both public key replacement attacks and insider attacks. We prove in the random oracle model that the proposed scheme is chosen-ciphertext secure and existentially unforgeable. Performance analysis shows that the proposed scheme outperforms all the previous certificate-based signcryption schemes in the literature. PMID:24959606
Shor-Preskill-type security proof for quantum key distribution without public announcement of bases
Hwang, Won-Young; Wang Xiangbin; Matsumoto, Keiji; Kim, Jaewan; Lee, Hai-Woong
2003-01-01
We give a Shor-Preskill-type security proof to quantum key distribution without public announcement of bases [W.Y. Hwang et al., Phys. Lett. A 244, 489 (1998)]. First, we modify the Lo-Chau protocol once more so that it finally reduces to the quantum key distribution without public announcement of bases. Then we show how we can estimate the error rate in the code bits based on that in the checked bits in the proposed protocol, which is the central point of the proof. We discuss the problem of imperfect sources and that of large deviation in the error rate distributions. We discuss when the bases sequence must be discarded.
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.
A DES ASIC Suitable for Network Encryption at 10 Gbps and Beyond
Gass, Karl; Pierson, Lyndon G.; Robertson, Perry J.; Wilcox, D. Craig; Witzke, Edward L.
1999-04-30
The Sandia National Laboratories (SNL) Data Encryption Standard (DES) Application Specific Integrated Circuit (ASIC) is the fastest known implementation of the DES algorithm as defined in the Federal Information Processing Standards (FIPS) Publication 46-2. DES is used for protecting data by cryptographic means. The SNL DES ASIC, over 10 times faster than other currently available DES chips, is a high-speed, filly pipelined implementation offering encryption, decryption, unique key input, or algorithm bypassing on each clock cycle. Operating beyond 105 MHz on 64 bit words, this device is capable of data throughputs greater than 6.7 Billion bits per second (tester limited). Simulations predict proper operation up to 9.28 Billion bits per second. In low frequency, low data rate applications, the ASIC consumes less that one milliwatt of power. The device has features for passing control signals synchronized to throughput data. Three SNL DES ASICS may be easily cascaded to provide the much greater security of triple-key, triple-DES.
Communicating Herschel Key Programs in Solar System Studies to the Public
NASA Astrophysics Data System (ADS)
Rengel, M.; Hartogh, P.; Müller, T.
2011-10-01
The Herschel Space Observatory, one of the cornerstone missions of the European Space Agency (ESA) with participation from NASA, is delivering a wealth of far-infrared and sub-millimeter observations of the cold Universe. A considerable part of the observing time for the nominal three year mission lifetime has been awarded in the form of Key Programs. Between the 42 key programs (guaranteed and open times), only two key programs are dedicated to study the Solar System: "Water and Related Chemistry in the Solar System", also known as Herschel Solar System Observations (HssO) project [1], and "TNOs are Cool: A Survey of the Transneptunian Region" [2]. In the framework of these Programs, a serie of public outreach activities and efforts of its results are being carried out. We present some of the outreach strategies developed (e.g. press releases, web pages, logos, public lectures, exhibitions, interviews, reports, etc.) and some plans in this direction. Our activities introduce people to knowledge and beauty of solar system research and wider the opportunities for the public to become more involved in topics like solar system studies, specially in the times of frequent exo-planet discoveries.
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.
A new image encryption algorithm based on logistic chaotic map with varying parameter.
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
Enhancement of utilization of encryption engine
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.
Ensemble of Chaotic and Naive Approaches for Performance Enhancement in Video Encryption.
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
Ensemble of Chaotic and Naive Approaches for Performance Enhancement in Video Encryption
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
Secure Obfuscation for Encrypted Group Signatures
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
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.
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.
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.
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.
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.
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.
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.
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
Quantum-noise randomized data encryption for wavelength-division-multiplexed fiber-optic networks
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.
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.
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.
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.
An improved piecewise linear chaotic map based image encryption algorithm.
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
An Improved Piecewise Linear Chaotic Map Based Image Encryption Algorithm
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
Secure Data Aggregation with Fully Homomorphic Encryption in Large-Scale Wireless Sensor Networks.
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
Secure Data Aggregation with Fully Homomorphic Encryption in Large-Scale Wireless Sensor Networks
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
Novel Authentication of Monitoring Data Through the use of Secret and Public Cryptographic Keys
Benz, Jacob M.; Tolk, Keith; Tanner, Jennifer E.
2014-07-21
The Office of Nuclear Verification (ONV) is supporting the development of a piece of equipment to provide data authentication and protection for a suite of monitoring sensors as part of a larger effort to create an arms control technology toolkit. This device, currently called the Red Box, leverages the strengths of both secret and public cryptographic keys to authenticate, digitally sign, and pass along monitoring data to allow for host review, and redaction if necessary, without the loss of confidence in the authenticity of the data by the monitoring party. The design of the Red Box will allow for the addition and removal of monitoring equipment and can also verify that the data was collected by authentic monitoring equipment prior to signing the data and sending it to the host and for review. The host will then forward the data to the monitor for review and inspection. This paper will highlight the progress to date of the Red Box development, and will explain the novel method of leveraging both symmetric and asymmetric (secret and public key) cryptography to authenticate data within a warhead monitoring regime.
Global trade, public health, and health services: stakeholders' constructions of the key issues.
Waitzkin, Howard; Jasso-Aguilar, Rebeca; Landwehr, Angela; Mountain, Carolyn
2005-09-01
Focusing mainly on the United States and Latin America, we aimed to identify the constructions of social reality held by the major stakeholders participating in policy debates about global trade, public health, and health services. In a multi-method, qualitative design, we used three sources of data: research and archival literature, 1980-2004; interviews with key informants who represented major organizations participating in these debates, 2002-2004; and organizational reports, 1980-2004. We targeted several types of organizations: government agencies, international financial institutions (IFIs) and trade organizations, international health organizations, multinational corporations, and advocacy groups. Many governments in Latin America define health as a right and health services as a public good. Thus, the government bears responsibility for that right. In contrast, the US government's philosophy of free trade and promoting a market economy assumes that by expanding the private sector, improved economic conditions will improve overall health with a minimum government provision of health care. US government agencies also view promotion of global health as a means to serve US interests. IFIs have emphasized reforms that include reduction and privatization of public sector services. International health organizations have tended to adopt the policy perspectives of IFIs and trade organizations. Advocacy groups have emphasized the deleterious effects of international trade agreements on public health and health services. Organizational stakeholders hold widely divergent constructions of reality regarding trade, public health, and health services. Social constructions concerning trade and health reflect broad ideologies concerning the impacts of market processes. Such constructions manifest features of "creed," regarding the role of the market in advancing human purposes and meeting human needs. Differences in constructions of trade and health constrain policies to
Dual-channel in-line digital holographic double random phase encryption
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
Butterfly Encryption Scheme for Resource-Constrained Wireless Networks †
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
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.
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.
Butterfly Encryption Scheme for Resource-Constrained Wireless Networks.
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
Pure optical dynamical color encryption.
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
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.
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).
Novel Image Encryption Scheme Based on Chebyshev Polynomial and Duffing Map
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
Takeda, Hiroshi; Matsumura, Yasushi; Nakagawa, Katsuhiko; Teratani, Tadamasa; Qiyan, Zhang; Kusuoka, Hideo; Matsuoka, Masami
2004-01-01
To share healthcare information and to promote cooperation among healthcare providers and customers (patients) under computerized network environment, a non-profit organization (NPO), named as OCHIS, was established at Osaka, Japan in 2003. Since security and confidentiality issues on the Internet have been major concerns in the OCHIS, the system has been based on healthcare public key infrastructure (HPKI), and found that there remained problems to be solved technically and operationally. An experimental study was conducted to elucidate the central and the local function in terms of a registration authority and a time stamp authority by contracting with the Ministry of Economics and Trading Industries in 2003. This paper describes the experimental design with NPO and the results of the study concerning message security and HPKI. The developed system has been operated practically in Osaka urban area. PMID:15361019
Countermeasures against Power Analysis Attacks for the NTRU Public Key Cryptosystem
NASA Astrophysics Data System (ADS)
Lee, Mun-Kyu; Song, Jeong Eun; Choi, Dooho; Han, Dong-Guk
The NTRU cryptosystem is a public key system based on lattice problems. While its theoretical security has been well studied, little effort has been made to analyze its security against implementation attacks including power analysis attacks. In this paper, we show that a typical software implementation of NTRU is vulnerable to the simple power analysis and the correlation power analysis including a second-order power attack. We also present novel countermeasures to prevent these attacks, and perform experiments to estimate the performance overheads of our countermeasures. According to our experimental results, the overheads in required memory and execution time are only 8.17% and 9.56%, respectively, over a Tmote Sky equipped with an MSP430 processor.
Modular multiplication in GF(p) for public-key cryptography
NASA Astrophysics Data System (ADS)
Olszyna, Jakub
Modular multiplication forms the basis of modular exponentiation which is the core operation of the RSA cryptosystem. It is also present in many other cryptographic algorithms including those based on ECC and HECC. Hence, an efficient implementation of PKC relies on efficient implementation of modular multiplication. The paper presents a survey of most common algorithms for modular multiplication along with hardware architectures especially suitable for cryptographic applications in energy constrained environments. The motivation for studying low-power and areaefficient modular multiplication algorithms comes from enabling public-key security for ultra-low power devices that can perform under constrained environments like wireless sensor networks. Serial architectures for GF(p) are analyzed and presented. Finally proposed architectures are verified and compared according to the amount of power dissipated throughout the operation.
Analysis of common attacks in public-key cryptosystems based on low-density parity-check codes
NASA Astrophysics Data System (ADS)
Skantzos, N. S.; Saad, D.; Kabashima, Y.
2003-11-01
We analyze the security and reliability of a recently proposed class of public-key cryptosystems against attacks by unauthorized parties who have acquired partial knowledge of one or more of the private key components and/or of the plaintext. Phase diagrams are presented, showing critical partial knowledge levels required for unauthorized decryption.
Mapping the key issues shaping the landscape of global public health.
Ager, Alastair; Yu, Gary; Hermosilla, Sabrina
2012-01-01
A survey of global health experts attending an invited meeting provided a means to map key issues perceived to be shaping emerging global public health agendas. Eighty-five participants proposed three major issues likely to have the most significant impact on the field of global health in the coming years. Six raters grouped the resultant items, with multi-dimensional scaling (MDS) analysis producing a composite two-dimensional map depicting the overall patterning of items. Thematic clusters were incorporated within four major domains: changing health and prevention needs (15% of items), globalisation and global health governance (33% of items), transforming health systems (30% of items) and innovations in science and technology (7% of items). The remaining 15% of items addressed forms of environmental change. The distribution of items across domains was not significantly influenced by the current professional role of participants, their current location in the 'global north' or 'global south' or their region of focus (although the latter approached threshold significance). The constraints on interpretation imposed by the biases influencing participation in the survey are noted. However, the exercise suggests the potential for coherently defining shared agendas for diverse stakeholders to address emerging priorities. The closer integration of environmental concerns with other global public issues is clearly warranted. PMID:22765282
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.
O'Rourke, Joanne McFarland; Roehrig, Stephen; Heeringa, Steven G; Reed, Beth Glover; Birdsall, William C; Overcashier, Margaret; Zidar, Kelly
2006-09-01
MEASURES USED TO PROTECT SUBJECTS in publicly distributed microdata files often have a significant negative impact on key analytic uses of the data. For example, it may be important to analyze subpopulations within a data file such as racial minorities, yet these subjects may present the greatest disclosure risk because their records tend to stand out or be unique. Files or records that are linkable create another type of disclosure risk-common elements between two files can be used to link files with sensitive data to externally available files that disclose identity. Examples of disclosure limitation methods used to address these types of issues include blanking out data, coarsening response categories, or withholding data altogether. However, the very detail that creates the greatest risk also provides insight into differences that are of greatest interest to analysts. Restricted-use agreements that provide unaltered versions of the data may not be available, or only selectively so. The public-use version of the data is very important because it is likely to be the only one to which most researchers, policy analysts, teaching faculty, and students will ever have access. Hence, it is the version from which much of the utility of the data is extracted and often it effectively becomes the historical record of the data collection. This underscores the importance that the disclosure review c ommittee s trikes a g ood b alance b etween protection and u tility. In this paper we d escrib e our disclosure review committee's (DRC) analysis and resulting data protection plans for two national studies and one administrative data system. Three distinct disclosure limitation methods were employed, taking key uses of the data into consideration, to protect respondents while still providing statistically accurate and highly useful public-use data. The techniques include data swapping, microaggregation, and suppression of detailed geographic data. We describe the characteristics
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
Iterative phase retrieval algorithms. Part II: Attacking optical encryption systems.
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
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.
ERIC Educational Resources Information Center
Biesma, R. G.; Pavlova, M.; van Merode, G. G.; Groot, W.
2007-01-01
This paper uses an experimental design to estimate preferences of employers for key competencies during the transition from initial education to the labor market. The study is restricted to employers of entry-level academic graduates entering public health organizations in the Netherlands. Given the changing and complex demands in public health,…
ERIC Educational Resources Information Center
Young, Charles Keith
2010-01-01
Owing to the significant structural changes that have occurred in the global marketplace over the past 2 decades, a corresponding increase of public-private partnerships have been established among the business sector, local governments, and public community colleges. This qualitative project sought to identify and substantiate key elements that…
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...
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.
Double image encryption based on random phase encoding in the fractional Fourier domain.
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
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.
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.
Manticore and CS mode : parallelizable encryption with joint cipher-state authentication.
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.
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.
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...
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...
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.
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.
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.
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.
Secret Key Crypto Implementations
NASA Astrophysics Data System (ADS)
Bertoni, Guido Marco; Melzani, Filippo
This chapter presents the algorithm selected in 2001 as the Advanced Encryption Standard. This algorithm is the base for implementing security and privacy based on symmetric key solutions in almost all new applications. Secret key algorithms are used in combination with modes of operation to provide different security properties. The most used modes of operation are presented in this chapter. Finally an overview of the different techniques of software and hardware implementations is given.
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.
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.
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.
Design of secure group key management system
NASA Astrophysics Data System (ADS)
Lee, Jeong-Min; Hwang, Kyo-Cheul; Lee, Kyoon-Ha
2001-07-01
Needs of Information Security in Multicast is increased. As clients join or leave a specific service group, Backward and Forward Secrecy problem occurred. Solving this problem, service group will make a re-key operation periodically. But because of this operation need translation frequently so it may have a bad influence to Real time property, which needs minimum bandwidth requirement. In this paper, we proposed a Group Key Management System, which is comprised of two levels, KD (Key Distributor) subsystem and subgroup, for managing encryption key. A KD (Key Distributor) subsystem is composed of SKDs (Subgroup Key Distributor) and TKD (Top-level Key Distributor). A SKD manages a encryption key of a subgroup. A TKD generates a KD group key that is a encryption key used in a KD group and transmits it to SKDs with safety. Subgroup consists of hosts in Multicast group. Hosts and a SKD share a encryption key, a subgroup key. This key is generated by a SKD and cannot be disclosed outside of the subgroup. As a result, a load of key management can be distributed into many KD so that the overhead of key translation can be decreased, which is needed at each stage of Multicast traffic. In joining and leaving a Multicast group frequently, a group key is distributed only in a specific subgroup. Therefore the overhead needed to redistribute a key can be decreased. By reducing overhead from security service, we expect to satisfy real time property.
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.
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.
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.
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.
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 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...
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...
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.
ERIC Educational Resources Information Center
Quarles, Roger C.
2011-01-01
This multiple case qualitative study addressed the National School Board Association's (NSBA) Key Work standards for public policy leadership by local school boards, and how three elite school board chairs understood and implemented those standards. Elite board chair status was defined by experience, training, and peer recognition. The study…
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.
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.
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.
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.
Symmetric encryption algorithms using chaotic and non-chaotic generators: A review
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
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...
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...
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...
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...
Symmetric encryption algorithms using chaotic and non-chaotic generators: A review.
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
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.
The Right to Strike in Public Employment. Key Issues Series--No. 15. Second Edition, Revised.
ERIC Educational Resources Information Center
Sterret, Grace; Aboud, Antone
Since the 1960s, the number of strikes by public employees, especially local government employees, has increased, and the number of employees belonging to unions or associations has about tripled. Recently, attention has been focused on strikes by public employees as a result of the strike in 1981 by air traffic controllers and their subsequent…
Scalable end-to-end encryption technology for supra-gigabit/second networking
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.
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.
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.
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.
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.
ERIC Educational Resources Information Center
Pospichal, Wendy
2011-01-01
Purpose: The purpose of this study was to describe and compare the similarities and differences between five key motivational factors: (a) new teacher induction, (b) noninduction mentor support in the early years of teaching, (c) salary and benefits, (d) working conditions, and (e) administrative support influential in retention of employment in…
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.
ERIC Educational Resources Information Center
Kayaga, Sam
2007-01-01
The capacity of public service staff in developing countries is crucial for achieving the Millennium Development Goals. Literature from developed countries shows that, working with higher education institutions (HEIs), industries have improved their human resource capacity through continuing professional development. This paper reports on research…
Interviewing Key Informants: Strategic Planning for a Global Public Health Management Program
ERIC Educational Resources Information Center
Kun, Karen E.; Kassim, Anisa; Howze, Elizabeth; MacDonald, Goldie
2013-01-01
The Centers for Disease Control and Prevention's Sustainable Management Development Program (SMDP) partners with low- and middle-resource countries to develop management capacity so that effective global public health programs can be implemented and better health outcomes can be achieved. The program's impact however, was variable. Hence, there…
Selective image encryption using a spatiotemporal chaotic system.
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
Seo, Jung Woo; Lee, Sang Jin
2016-01-01
Weather information provides a safe working environment by contributing to the economic activity of the nation, and plays role of the prevention of natural disasters, which can cause large scaled casualties and damage of property. Especially during times of war, weather information plays a more important role than strategy, tactics and information about trends of the enemy. Also, it plays an essential role for the taking off and landing of fighter jet and the sailing of warships. If weather information, which plays a major role in national security and economy, gets misused for cyber terrorism resulting false weather information, it could be a huge threat for national security and the economy. We propose a plan to safely transmit the measured value from meteorological sensors through a meteorological telecommunication network in order to guarantee the confidentiality and integrity of the data despite cyber-attacks. Also, such a plan allows one to produce reliable weather forecasts by performing mutual authentication through authentication devices. To make sure of this, one can apply an Identity Based Signature to ensure the integrity of measured data, and transmit the encrypted weather information with mutual authentication about the authentication devices. There are merits of this research: It is not necessary to manage authentication certificates unlike the Public Key Infrastructure methodology, and it provides a powerful security measure with the capability to be realized in a small scale computing environment, such as the meteorological observation system due to the low burden on managing keys. PMID:27536509
Public-private relationships in biobanking: a still underestimated key component of open innovation.
Hofman, Paul; Bréchot, Christian; Zatloukal, Kurt; Dagher, Georges; Clément, Bruno
2014-01-01
Access to human bioresources is essential to the understanding of human diseases and to the discovery of new biomarkers aimed at improving the diagnosis, prognosis, and the predictive response of patients to treatments. The use of biospecimens is strictly controlled by ethical assessment, which complies with the laws of the country. These laws regulate the partnerships between the biobanks and industrial actors. However, private-public partnerships (PPP) can be limiting for several reasons, which can hamper the discovery of new biological tests and new active molecules targeted to human diseases. The bottlenecks and roadblocks in establishing these partnerships include: poor organization of the biobank in setting up PPP, evaluation of the cost of human samples, the absence of experience on the public side in setting up contracts with industry, and the fact that public and private partners may not share the same objectives. However, it is critical, in particular for academic biobanks, to establish strong PPP to accelerate translational research for the benefits of patients, and to allow the sustainability of the biobank. The purpose of this review is to discuss the main bottlenecks and roadblocks that can hamper the establishment of PPP based on solid and trusting relationships. PMID:24337181
2013-01-01
Background If Public Health is the science and art of how society collectively aims to improve health, and reduce inequalities in health, then Public Health Economics is the science and art of supporting decision making as to how society can use its available resources to best meet these objectives and minimise opportunity cost. A systematic review of published guidance for the economic evaluation of public health interventions within this broad public policy paradigm was conducted. Methods Electronic databases and organisation websites were searched using a 22 year time horizon (1990–2012). References of papers were hand searched for additional papers for inclusion. Government reports or peer-reviewed published papers were included if they; referred to the methods of economic evaluation of public health interventions, identified key challenges of conducting economic evaluations of public health interventions or made recommendations for conducting economic evaluations of public health interventions. Guidance was divided into three categories UK guidance, international guidance and observations or guidance provided by individual commentators in the field of public health economics. An assessment of the theoretical frameworks underpinning the guidance was made and served as a rationale for categorising the papers. Results We identified 5 international guidance documents, 7 UK guidance documents and 4 documents by individual commentators. The papers reviewed identify the main methodological challenges that face analysts when conducting such evaluations. There is a consensus within the guidance that wider social and environmental costs and benefits should be looked at due to the complex nature of public health. This was reflected in the theoretical underpinning as the majority of guidance was categorised as extra-welfarist. Conclusions In this novel review we argue that health economics may have come full circle from its roots in broad public policy economics. We may
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.
Mt-Isa, Shahrul; Ouwens, Mario; Robert, Veronique; Gebel, Martin; Schacht, Alexander; Hirsch, Ian
2016-07-01
Introduction The conduct of structured benefit-risk assessment (BRA) of pharmaceutical products is a key area of interest for regulatory agencies and the pharmaceutical industry. However, the acceptance of a standardized approach and implementation are slow. Statisticians play major roles in these organizations, and have a great opportunity to be involved and drive the shaping of future BRA. Method We performed a literature search of recent reviews and initiatives assessing BRA methodologies, and grouped them to assist those new to BRA in learning, understanding, and choosing methodologies. We summarized the key points and discussed the impact of this emerging field on various stakeholders, particularly statisticians in the pharmaceutical industry. Results We provide introductory, essential, special interest, and further information and initiatives materials that direct readers to the most relevant materials, which were published between 2000 and 2013. Based on recommendations in these materials we supply a toolkit of advocated BRA methodologies. Discussion Despite initiatives promoting these methodologies, there are still barriers, one of which being the lack of a consensus on the most appropriate methodologies among stakeholders. However, this opens up opportunities, for statisticians in the pharmaceutical industry especially, to champion appropriate BRA methodology use throughout the pharmaceutical product lifecycle. Conclusions This article may serve as a starting point for discussions and to reach a mutual consensus for methodology selection in a particular situation. Regulators and pharmaceutical industry should continue to collaborate to develop and take forward BRA methodologies, and by clear communication develop a mutual understanding of the key issues. Copyright © 2015 John Wiley & Sons, Ltd. PMID:25981683
A Scenario-Based Protocol Checker for Public-Key Authentication Scheme
NASA Astrophysics Data System (ADS)
Saito, Takamichi
Security protocol provides communication security for the internet. One of the important features of it is authentication with key exchange. Its correctness is a requirement of the whole of the communication security. In this paper, we introduce three attack models realized as their attack scenarios, and provide an authentication-protocol checker for applying three attack-scenarios based on the models. We also utilize it to check two popular security protocols: Secure SHell (SSH) and Secure Socket Layer/Transport Layer Security (SSL/TLS).
Cryptanalysis of a GL(r,Zn)-Based Public Key System
NASA Astrophysics Data System (ADS)
Kamal, Abdel Alim; Youssef, Amr
Keith Salvin presented a key exchange protocol using matrices in the general linear group, GL(r,Zn), where n is the product of two distinct large primes. The system is fully specified in the US patent number 7346162 issued in 2008. In the patent claims, it is argued that the best way to break this system is to factor n. Furthermore, for efficiency reasons, it is suggested to use r=2. In this letter, we show that this cryptosystem can be easily broken by solving a set of consistent homogeneous r2 linear equations in 2r unknowns over n.
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.
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.
Why sustainable population growth is a key to climate change and public health equity.
Howat, Peter; Stoneham, Melissa
2011-12-01
Australia's population could reach 42 million by 2050. This rapid population growth, if unabated, will have significant social, public health and environmental implications. On the one hand, it is a major driver of climate change and environmental degradation; on the other it is likely to be a major contributor to growing social and health issues including a decline in quality of life for many residents. Disadvantaged and vulnerable groups will be most affected. The environmental, social and health-related issues include: pressure on the limited arable land in Australia; increased volumes of industrial and domestic waste; inadequate essential services; traffic congestion; lack of affordable housing; declining mental health; increased obesity problems; and inadequate aged care services. Many of these factors are related to the aggravation of climate change and health inequities. It is critical that the Australian Government develops a sustainable population plan with stabilisation of population growth as an option. The plan needs to ensure adequate hospitals and healthcare services, education facilities, road infrastructure, sustainable transport options, water quality and quantity, utilities and other amenities that are already severely overburdened in Australian cities. There is a need for a guarantee that affordable housing will be available and priority be given to training young people and Indigenous people for employment. This paper presents evidence to support the need for the stabilisation of population growth as one of the most significant measures to control climate change as well as to improve public health equity. PMID:22518917
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.
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.
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.
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.
Quantum proxy signature scheme with public verifiability
NASA Astrophysics Data System (ADS)
Zhou, Jingxian; Zhou, Yajian; Niu, Xinxin; Yang, Yixian
2011-10-01
In recent years, with the development of quantum cryptography, quantum signature has also made great achievement. However, the effectiveness of all the quantum signature schemes reported in the literature can only be verified by a designated person. Therefore, its wide applications are limited. For solving this problem, a new quantum proxy signature scheme using EPR quantum entanglement state and unitary transformation to generate proxy signature is presented. Proxy signer announces his public key when he generates the final signature. According to the property of unitary transformation and quantum one-way function, everyone can verify whether the signature is effective or not by the public key. So the quantum proxy signature scheme in our paper can be public verified. The quantum key distribution and one-time pad encryption algorithm guarantee the unconditional security of this scheme. Analysis results show that this new scheme satisfies strong non-counterfeit and strong non-disavowal.
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.
Small Private Key PKS on an Embedded Microprocessor
Seo, Hwajeong; Kim, Jihyun; Choi, Jongseok; Park, Taehwan; Liu, Zhe; Kim, Howon
2014-01-01
Multivariate quadratic ( ) cryptography requires the use of long public and private keys to ensure a sufficient security level, but this is not favorable to embedded systems, which have limited system resources. Recently, various approaches to cryptography using reduced public keys have been studied. As a result of this, at CHES2011 (Cryptographic Hardware and Embedded Systems, 2011), a small public key scheme, was proposed, and its feasible implementation on an embedded microprocessor was reported at CHES2012. However, the implementation of a small private key scheme was not reported. For efficient implementation, random number generators can contribute to reduce the key size, but the cost of using a random number generator is much more complex than computing on modern microprocessors. Therefore, no feasible results have been reported on embedded microprocessors. In this paper, we propose a feasible implementation on embedded microprocessors for a small private key scheme using a pseudo-random number generator and hash function based on a block-cipher exploiting a hardware Advanced Encryption Standard (AES) accelerator. To speed up the performance, we apply various implementation methods, including parallel computation, on-the-fly computation, optimized logarithm representation, vinegar monomials and assembly programming. The proposed method reduces the private key size by about 99.9% and boosts signature generation and verification by 5.78% and 12.19% than previous results in CHES2012. PMID:24651722
Small private key MQPKS on an embedded microprocessor.
Seo, Hwajeong; Kim, Jihyun; Choi, Jongseok; Park, Taehwan; Liu, Zhe; Kim, Howon
2014-01-01
Multivariate quadratic (MQ) cryptography requires the use of long public and private keys to ensure a sufficient security level, but this is not favorable to embedded systems, which have limited system resources. Recently, various approaches to MQ cryptography using reduced public keys have been studied. As a result of this, at CHES2011 (Cryptographic Hardware and Embedded Systems, 2011), a small public key MQ scheme, was proposed, and its feasible implementation on an embedded microprocessor was reported at CHES2012. However, the implementation of a small private key MQ scheme was not reported. For efficient implementation, random number generators can contribute to reduce the key size, but the cost of using a random number generator is much more complex than computing MQ on modern microprocessors. Therefore, no feasible results have been reported on embedded microprocessors. In this paper, we propose a feasible implementation on embedded microprocessors for a small private key MQ scheme using a pseudo-random number generator and hash function based on a block-cipher exploiting a hardware Advanced Encryption Standard (AES) accelerator. To speed up the performance, we apply various implementation methods, including parallel computation, on-the-fly computation, optimized logarithm representation, vinegar monomials and assembly programming. The proposed method reduces the private key size by about 99.9% and boosts signature generation and verification by 5.78% and 12.19% than previous results in CHES2012. PMID:24651722
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...
Smolders, Roel; Colles, Ann; Cornelis, Christa; Van Holderbeke, Mirja; Chovanova, Hana; Wildemeersch, Dirk; Mampaey, Maja; Van Campenhout, Karen
2014-12-15
Although well-established protocols are available for emergency services and first-responders in case of chemical release incidents, a well-developed system to monitor and safeguard public health was, until recently, lacking in Flanders. We therefore developed a decision support system (DSS) to aid public health officials in identifying the appropriate actions in case of incidents. Although the DSS includes human biomonitoring as one of its key instruments, it also goes well beyond this instrument alone. Also other, complementary, approaches that focus more on effect assessment using in vitro toxicity testing, indirect exposures through the food chain, and parallel means of data collection (e.g. through ecosurveillance or public consultation), are integrated in the Flemish approach. Even though the DSS is set up to provide a flexible and structured decision tree, the value of expert opinion is deemed essential to account for the many uncertainties associated with the early phases of technological incidents. When the DSS and the associated instruments will be fully operational, it will provide a valuable addition to the already available protocols, and will specifically safeguard public health interests. PMID:24866056
An Efficient Image Encryption Scheme Based on a Peter De Jong Chaotic Map and a RC4 Stream Cipher
NASA Astrophysics Data System (ADS)
Hanchinamani, Gururaj; Kulkarni, Linganagouda
2015-09-01
Security is a vital issue in communication and storage of the images and encryption is one of the ways to ensure the security. This paper proposes an efficient image encryption scheme based on a Peter De Jong chaotic map and a RC4 stream cipher. A Peter De Jong map is employed to determine the initial keys for the RC4 stream generator and also during permutation stage. The RC4 stream generator is utilized to generate the pseudo random numbers for the pixel value rotation and diffusion operations. Each encryption round is comprised of three stages: permutation, pixel value rotation and diffusion. The permutation is based on scrambling the rows and columns, in addition, circular rotations of the rows and columns in alternate orientations. The second stage circularly rotates each and every pixel value by utilizing M × N pseudo random numbers. The last stage carries out the diffusion twice by scanning the image in two different ways. Each of the two diffusions accomplishes the diffusion in two orientations (forward and backward) with two previously diffused pixels and two pseudo random numbers. The security and performance of the proposed method is assessed thoroughly by using key space, statistical, differential, entropy and performance analysis. Moreover, two rounds of the call to the encrypt function provide the sufficient security. The experimental results show that the proposed encryption scheme is computationally fast with high security.
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
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.
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.
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.
Calculation of key reduction for B92 QKD protocol
NASA Astrophysics Data System (ADS)
Mehic, Miralem; Partila, Pavol; Tovarek, Jaromir; Voznak, Miroslav
2015-05-01
It is well known that Quantum Key Distribution (QKD) can be used with the highest level of security for distribution of the secret key, which is further used for symmetrical encryption. B92 is one of the oldest QKD protocols. It uses only two non-orthogonal states, each one coding for one bit-value. It is much faster and simpler when compared to its predecessors, but with the idealized maximum efficiencies of 25% over the quantum channel. B92 consists of several phases in which initial key is significantly reduced: secret key exchange, extraction of the raw key (sifting), error rate estimation, key reconciliation and privacy amplification. QKD communication is performed over two channels: the quantum channel and the classical public channel. In order to prevent a man-in-the-middle attack and modification of messages on the public channel, authentication of exchanged values must be performed. We used Wegman-Carter authentication because it describes an upper bound for needed symmetric authentication key. We explained the reduction of the initial key in each of QKD phases.
FORESEE: Fully Outsourced secuRe gEnome Study basEd on homomorphic Encryption
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
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.
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.
High-performance multimedia encryption system based on chaos.
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
Restricted Authentication and Encryption for Cyber-physical Systems
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.
Madsen, Heidi Holst; Madsen, Dicte; Gauffriau, Marianne
2016-01-01
Unique identifiers (UID) are seen as an effective key to match identical publications across databases or identify duplicates in a database. The objective of the present study is to investigate how well UIDs work as match keys in the integration between Pure and SciVal, based on a case with publications from the health sciences. We evaluate the matching process based on information about coverage, precision, and characteristics of publications matched versus not matched with UIDs as the match keys. We analyze this information to detect errors, if any, in the matching process. As an example we also briefly discuss how publication sets formed by using UIDs as the match keys may affect the bibliometric indicators number of publications, number of citations, and the average number of citations per publication. The objective is addressed in a literature review and a case study. The literature review shows that only a few studies evaluate how well UIDs work as a match key. From the literature we identify four error types: Duplicate digital object identifiers (DOI), incorrect DOIs in reference lists and databases, DOIs not registered by the database where a bibliometric analysis is performed, and erroneous optical or special character recognition. The case study explores the use of UIDs in the integration between the databases Pure and SciVal. Specifically journal publications in English are matched between the two databases. We find all error types except erroneous optical or special character recognition in our publication sets. In particular the duplicate DOIs constitute a problem for the calculation of bibliometric indicators as both keeping the duplicates to improve the reliability of citation counts and deleting them to improve the reliability of publication counts will distort the calculation of average number of citations per publication. The use of UIDs as a match key in citation linking is implemented in many settings, and the availability of UIDs may become
NASA Astrophysics Data System (ADS)
Hao, Longjie; Min, Lequan
2014-06-01
Recently, a stream encryption scheme using d-bit segment sequences has been proposed. This scheme may generate key avalanche effect. The randomness tests of d-bit segment pseudorandom number generator will be important for implementing such a scheme. Firstly this paper extends Beker and Piper's binary pseudorandom sequence statistical test suite to d-bit segment sequences case. Secondly, a novel 3-dimensional polynomial discrete chaotic map (3DPDCM) is proposed. The calculated Lyapunov exponents of the 3DPCDM are 0.213, 0.125 and - 3.228. Using the 3DPDCM constructs a 6-dimensional generalized synchronization chaotic system. Based on this system, a 8-bit segment chaotic pseudorandom number generator (CPRNG) is introduced. Using the generalized test suite tests 100 key streams generated via the 8-bit PRNG with different initial conditions and perturbed system parameters. The tested results are similar to those of the key streams generated via RC4 PRNG. As an application, using the key streams generated via the CPRNG and the RC4 PRNG encrypts an RGB image Landscape. The results have shown that the encrypted RGB images have significant avalanche effects. This research suggests that the requirements for PRNGs are not as strict as those under the traditional avalanche criteria. Suitable designed chaos-based d-bit string PRNGs may be qualified candidates for the stream encryption scheme with avalanche effect.
On the security of Y-00 under fast correlation and other attacks on the key
NASA Astrophysics Data System (ADS)
Yuen, Horace P.; Nair, Ranjith
2007-04-01
The security of the Y-00 direct encryption protocol under correlation attack is addressed. A Y-00 configuration that is more secure than AES under known-plaintext attack is presented. It is shown that under any ciphertext-only attack, full information-theoretic security on the Y-00 seed key is obtained for any encryption box ENC with proper deliberate signal randomization.
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.
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.
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.
Triple-image encryption based on phase-truncated Fresnel transform and basic vector operation.
Pan, Xuemei; Meng, Xiangfeng; Yang, Xiulun; Wang, Yurong; Peng, Xiang; He, Wenqi; Dong, Guoyan; Chen, Hongyi
2015-10-01
A triple-image encryption method is proposed that is based on phase-truncated Fresnel transform (PTFT), basic vector composition, and XOR operation. In the encryption process, two random phase masks, with one each placed at the input plane and the transform plane, are generated by basic vector resolution operations over the first and the second plaintext images, and then a ciphered image in the input plane is fabricated by XOR encoding for the third plaintext image. When the cryptosystem is illuminated by an on-axis plane, assisted by PTFT, the ciphered image is finally encrypted into an amplitude-only noise-like image in the output plane. During decryption, possessing the correct private key, decryption keys, and the assistant geometrical parameter keys, and placing them at the corresponding correct positions, the original three plaintext images can be successfully decrypted by inverse PTFT, basic vector composition, and XOR decoding. Theoretical analysis and numerical simulations both verify the feasibility of the proposed method. PMID:26479627
Privacy protection in HealthGrid: distributing encryption management over the VO.
Torres, Erik; de Alfonso, Carlos; Blanquer, Ignacio; Hernández, Vicente
2006-01-01
Grid technologies have proven to be very successful in tackling challenging problems in which data access and processing is a bottleneck. Notwithstanding the benefits that Grid technologies could have in Health applications, privacy leakages of current DataGrid technologies due to the sharing of data in VOs and the use of remote resources, compromise its widespreading. Privacy control for Grid technology has become a key requirement for the adoption of Grids in the Healthcare sector. Encrypted storage of confidential data effectively reduces the risk of disclosure. A self-enforcing scheme for encrypted data storage can be achieved by combining Grid security systems with distributed key management and classical cryptography techniques. Virtual Organizations, as the main unit of user management in Grid, can provide a way to organize key sharing, access control lists and secure encryption management. This paper provides programming models and discusses the value, costs and behavior of such a system implemented on top of one of the latest Grid middlewares. This work is partially funded by the Spanish Ministry of Science and Technology in the frame of the project Investigación y Desarrollo de Servicios GRID: Aplicación a Modelos Cliente-Servidor, Colaborativos y de Alta Productividad, with reference TIC2003-01318. PMID:16823130
Steganography and encrypting based on immunochemical systems.
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
Current status of link access control and encryption system
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.
Three-dimensional photon counting double-random-phase encryption.
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
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.
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...
Teitelbaum, J; Rosenbaum, S; Burgess, W; DeCourcy, L
1998-12-01
The development of managed behavioral health care carve-out contracts covering a discrete subset of benefits available for use by persons with mental health and/or substance abuse disorders poses major challenges for public purchasers. This Issue Brief explores several key issues that arise when drafting such agreements. Many of the issues that arise in the drafting of carve-out agreements will require the public purchaser to resolve basic policy questions well before the drafting of requests for proposals or contracts can proceed. Analyses of public sector managed behavioral health care contracts by attorneys at the Center for Health Policy Research suggest that there are four essential areas that must be addressed if mental health and substance abuse services are carved-out (either by the purchaser or by a comprehensive managed health care entity): (1) what population is eligible for enrollment; (2) what services is the contractor expected to furnish; (3) what triggers a duty on the part of the mental health or substance abuse carve-out contractor to provide services; and (4) how are services furnished by the managed behavioral health care contractor integrated with or coordinated with services furnished by a beneficiary's primary health care provider, with pharmaceutical benefits, and with other services that may be available to a beneficiary through a fee-for-service or other mechanism. However a purchaser chooses to resolve these four issues, it is essential that parallel clarifying clauses are also built into the contracts of primary health care providers and other entities providing needed services for persons whose mental health and substance abuse service needs are covered by the carve-out. Underlying all of these issues is the fact that ambiguity, vagueness, or failure to define terms and responsibilities can create unexpected and unwelcome clinical and financial liabilities to purchasers. PMID:12426706
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.
Status Report on the First Round of the Development of the Advanced Encryption Standard
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.
Security-enhanced chaos communication with time-delay signature suppression and phase encryption.
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
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.
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.
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.
NASA Astrophysics Data System (ADS)
Karabat, Cagatay; Kiraz, Mehmet Sabir; Erdogan, Hakan; Savas, Erkay
2015-12-01
In this paper, we introduce a new biometric verification and template protection system which we call THRIVE. The system includes novel enrollment and authentication protocols based on threshold homomorphic encryption where a private key is shared between a user and a verifier. In the THRIVE system, only encrypted binary biometric templates are stored in a database and verification is performed via homomorphically randomized templates, thus, original templates are never revealed during authentication. Due to the underlying threshold homomorphic encryption scheme, a malicious database owner cannot perform full decryption on encrypted templates of the users in the database. In addition, security of the THRIVE system is enhanced using a two-factor authentication scheme involving user's private key and biometric data. Using simulation-based techniques, the proposed system is proven secure in the malicious model. The proposed system is suitable for applications where the user does not want to reveal her biometrics to the verifier in plain form, but needs to prove her identity by using biometrics. The system can be used with any biometric modality where a feature extraction method yields a fixed size binary template and a query template is verified when its Hamming distance to the database template is less than a threshold. The overall connection time for the proposed THRIVE system is estimated to be 336 ms on average for 256-bit biometric templates on a desktop PC running with quad core 3.2 GHz CPUs at 10 Mbit/s up/down link connection speed. Consequently, the proposed system can be efficiently used in real-life applications.
Phase encryption of biometrics in diffractive optical elements.
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
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…
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...
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...
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...
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...
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.
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...
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.
Host-to-host encryption using commercial networking products
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.
Boivin, Antoine; Lehoux, Pascale; Burgers, Jako; Grol, Richard
2014-01-01
Context In the past 50 years, individual patient involvement at the clinical consultation level has received considerable attention. More recently, patients and the public have increasingly been involved in collective decisions concerning the improvement of health care and policymaking. However, rigorous evaluation guiding the development and implementation of effective public involvement interventions is lacking. This article describes those key ingredients likely to affect public members’ ability to deliberate productively with professionals and influence collective health care choices. Method We conducted a trial process evaluation of public involvement in setting priorities for health care improvement. In all, 172 participants (including 83 patients and public members and 89 professionals) from 6 Health and Social Services Centers in Canada participated in the trial. We videorecorded 14 one-day meetings, and 2 nonparticipant observers took structured notes. Using qualitative analysis, we show how public members influenced health care improvement priorities. Findings Legitimacy, credibility, and power explain the variations in the public members’ influence. Their credibility was supported by their personal experience as patients and caregivers, the provision of a structured preparation meeting, and access to population-based data from their community. Legitimacy was fostered by the recruitment of a balanced group of participants and by the public members’ opportunities to draw from one another's experience. The combination of small-group deliberations, wider public consultation, and a moderation style focused on effective group process helped level out the power differences between professionals and the public. The engagement of key stakeholders in the intervention design and implementation helped build policy support for public involvement. Conclusions A number of interacting active ingredients structure and foster the public's legitimacy, credibility
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.
A Selective Encryption Algorithm Based on AES for Medical Information
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
NASA Astrophysics Data System (ADS)
Lang, Jun
2015-03-01
In this paper, we propose a novel color image encryption method by using Color Blend (CB) and Chaos Permutation (CP) operations in the reality-preserving multiple-parameter fractional Fourier transform (RPMPFRFT) domain. The original color image is first exchanged and mixed randomly from the standard red-green-blue (RGB) color space to R‧G‧B‧ color space by rotating the color cube with a random angle matrix. Then RPMPFRFT is employed for changing the pixel values of color image, three components of the scrambled RGB color space are converted by RPMPFRFT with three different transform pairs, respectively. Comparing to the complex output transform, the RPMPFRFT transform ensures that the output is real which can save storage space of image and convenient for transmission in practical applications. To further enhance the security of the encryption system, the output of the former steps is scrambled by juxtaposition of sections of the image in the reality-preserving multiple-parameter fractional Fourier domains and the alignment of sections is determined by two coupled chaotic logistic maps. The parameters in the Color Blend, Chaos Permutation and the RPMPFRFT transform are regarded as the key in the encryption algorithm. The proposed color image encryption can also be applied to encrypt three gray images by transforming the gray images into three RGB color components of a specially constructed color image. Numerical simulations are performed to demonstrate that the proposed algorithm is feasible, secure, sensitive to keys and robust to noise attack and data loss.
SSEL1.0. Sandia Scalable Encryption Software
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.
A lossless encryption method for medical images using edge maps.
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
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.
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.
System for processing an encrypted instruction stream in hardware
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.
NASA Astrophysics Data System (ADS)
Soeffing, C.; Bartolone, L.; Nelson, A.; Paglierani, R.; Burck, L.; Klug-Boonstra, S.; Zimmerman-Brachman, R.; Davey, B.
2015-11-01
A national survey, conducted in 2012 by the NASA Science Mission Directorate Education and Public Outreach Forums, assessed who was using NASA resources, what educators were looking for when using NASA data, and what attracted them to NASA workshops. The key findings of the survey were distributed through NASA and national education networks.
2011-01-01
Background The principles and practice of Family Medicine that arose in developed Western countries have been imported and adopted in African countries without adequate consideration of their relevance and appropriateness to the African context. In this study we attempted to elicit a priori principles of generalist medical practice from the experience of long-serving medical officers in a variety of African counties, through which we explored emergent principles of Family Medicine in our own context. Methods A descriptive study design was utilized, using qualitative methods. 16 respondents who were clinically active medical practitioners, working as generalists in the public services or non-profit sector for at least 5 years, and who had had no previous formal training or involvement in academic Family Medicine, were purposively selected in 8 different countries in southern, western and east Africa, and interviewed. Results The respondents highlighted a number of key issues with respect to the external environment within which they work, their collective roles, activities and behaviours, as well as the personal values and beliefs that motivate their behaviour. The context is characterized by resource constraints, high workload, traditional health beliefs, and the difficulty of referring patients to the next level of care. Generalist clinicians in sub-Saharan Africa need to be competent across a wide range of clinical disciplines and procedural skills at the level of the district hospital and clinic, in both chronic and emergency care. They need to understand the patient's perspective and context, empowering the patient and building an effective doctor-patient relationship. They are also managers, focused on coordinating and improving the quality of clinical care through teamwork, training and mentoring other health workers in the generalist setting, while being life-long learners themselves. However, their role in the community, was found to be more aspirational
Sang, Jun; Zhao, Jun; Xiang, Zhili; Cai, Bin; Xiang, Hong
2015-01-01
Gyrator transform has been widely used for image encryption recently. For gyrator transform-based image encryption, the rotation angle used in the gyrator transform is one of the secret keys. In this paper, by analyzing the properties of the gyrator transform, an improved particle swarm optimization (PSO) algorithm was proposed to search the rotation angle in a single gyrator transform. Since the gyrator transform is continuous, it is time-consuming to exhaustedly search the rotation angle, even considering the data precision in a computer. Therefore, a computational intelligence-based search may be an alternative choice. Considering the properties of severe local convergence and obvious global fluctuations of the gyrator transform, an improved PSO algorithm was proposed to be suitable for such situations. The experimental results demonstrated that the proposed improved PSO algorithm can significantly improve the efficiency of searching the rotation angle in a single gyrator transform. Since gyrator transform is the foundation of image encryption in gyrator transform domains, the research on the method of searching the rotation angle in a single gyrator transform is useful for further study on the security of such image encryption algorithms. PMID:26251910
Li, Jianzhong
2014-04-21
In this paper, a novel secure optimal image watermarking scheme using an encrypted gyrator transform computer generated hologram (CGH) in the contourlet domain is presented. A new encrypted CGH technique, which is based on the gyrator transform, the random phase mask, the three-step phase-shifting interferometry and the Fibonacci transform, has been proposed to produce a hologram of a watermark first. With the huge key space of the encrypted CGH, the security strength of the watermarking system is enhanced. To achieve better imperceptibility, an improved quantization embedding algorithm is proposed to embed the encrypted CGH into the low frequency sub-band of the contourlet-transformed host image. In order to obtain the highest possible robustness without losing the imperceptibility, particle swarm optimization algorithm is employed to search the optimal embedding parameter of the watermarking system. In comparison with other method, the proposed watermarking scheme offers better performances for both imperceptibility and robustness. Experimental results demonstrate that the proposed image watermarking is not only secure and invisible, but also robust against a variety of attacks. PMID:24787882
Sang, Jun; Zhao, Jun; Xiang, Zhili; Cai, Bin; Xiang, Hong
2015-01-01
Gyrator transform has been widely used for image encryption recently. For gyrator transform-based image encryption, the rotation angle used in the gyrator transform is one of the secret keys. In this paper, by analyzing the properties of the gyrator transform, an improved particle swarm optimization (PSO) algorithm was proposed to search the rotation angle in a single gyrator transform. Since the gyrator transform is continuous, it is time-consuming to exhaustedly search the rotation angle, even considering the data precision in a computer. Therefore, a computational intelligence-based search may be an alternative choice. Considering the properties of severe local convergence and obvious global fluctuations of the gyrator transform, an improved PSO algorithm was proposed to be suitable for such situations. The experimental results demonstrated that the proposed improved PSO algorithm can significantly improve the efficiency of searching the rotation angle in a single gyrator transform. Since gyrator transform is the foundation of image encryption in gyrator transform domains, the research on the method of searching the rotation angle in a single gyrator transform is useful for further study on the security of such image encryption algorithms. PMID:26251910
NASA Astrophysics Data System (ADS)
Azoug, Seif Eddine; Bouguezel, Saad
2016-01-01
In this paper, a novel opto-digital image encryption technique is proposed by introducing a new non-linear preprocessing and using the multiple-parameter discrete fractional Fourier transform (MPDFrFT). The non-linear preprocessing is performed digitally on the input image in the spatial domain using a piecewise linear chaotic map (PLCM) coupled with the bitwise exclusive OR (XOR). The resulting image is multiplied by a random phase mask before applying the MPDFrFT to whiten the image. Then, a chaotic permutation is performed on the output of the MPDFrFT using another PLCM different from the one used in the spatial domain. Finally, another MPDFrFT is applied to obtain the encrypted image. The parameters of the PLCMs together with the multiple fractional orders of the MPDFrFTs constitute the secret key for the proposed cryptosystem. Computer simulation results and security analysis are presented to show the robustness of the proposed opto-digital image encryption technique and the great importance of the new non-linear preprocessing introduced to enhance the security of the cryptosystem and overcome the problem of linearity encountered in the existing permutation-based opto-digital image encryption schemes.
A Layered Searchable Encryption Scheme with Functional Components Independent of Encryption Methods
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
NASA Astrophysics Data System (ADS)
Min, Lequan; Yang, Xiuping; Chen, Guanrong; Wang, Danling
This study uses seven four-dimensional four-variable polynomial chaotic maps without equilibria in combination with generalized chaos synchronization (GCS) theorem to construct eight-dimensional bidirectional discrete generalized chaos synchronization (8DBDGCS) systems without equilibria. By combining the 8DBDGCS system with the GCS theorem, a 12-dimensional GCS system is designed. Numerical simulation verifies the chaotic dynamics of the 12-dimensional GCS system, which is used to design a 216-word chaotic pseudorandom number generator (CPRNG). The SP-8002 test suite is used to test the randomness of four 100-key streams consisting of 1 000 000 bits generated respectively by the CPRNG, a six-dimensional GCS-based CPRNG, the RC4 algorithm and the ZUC algorithm. The results show that the randomness performances of the two CPRNGs are promising, suggesting that there are no significant correlations between the key stream and the perturbed key streams generated via the 216-word CPRNG. In addition, theoretically the key space of the CPRNG is larger than 21195. The CPRNG is used with an avalanche-encryption scheme to encrypt an RGB balloon image, demonstrating that the CPRNG is able to generate the avalanche effects which are similar to those generated via ideal 216-word CPRNGs.
Greenaway, J R
1998-02-01
The Victorian temperance movement aimed to eliminate, not reform, public houses, but from 1870 interest began to be taken in promoting an "improved" public house which could promote counter-attractions to drink. Disinterested management, based upon public ownership or a trust company, was advocated as the best means of achieving this. There was, however, an ambiguity about the nature of the "improved" public house. Was the goal an austere establishment where the drinking could be controlled in the public interest, or was it a comfortable leisure centre which would promote civilized drinking? This ambiguity lay unresolved during the period of the Carlisle experiment in state control in the period after 1915. Increasingly during the inter-war years the policies of the state-run Carlisle scheme and the more go-ahead brewers converged. The issue was originally conceptualized as a moral one, then as one of national efficiency and finally as a commercial one. PMID:9624720
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.
Research on medical image encryption in telemedicine systems.
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
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.
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.
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.
Efficient hardware implementation of the lightweight block encryption algorithm LEA.
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
Efficient Hardware Implementation of the Lightweight Block Encryption Algorithm LEA
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
Experimental multiplexing of encrypted movies using a JTC architecture.
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
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.
A fingerprint encryption scheme based on irreversible function and secure authentication.
Yang, Yijun; Yu, Jianping; Zhang, Peng; Wang, Shulan
2015-01-01
A fingerprint encryption scheme based on irreversible function has been designed in this paper. Since the fingerprint template includes almost the entire information of users' fingerprints, the personal authentication can be determined only by the fingerprint features. This paper proposes an irreversible transforming function (using the improved SHA1 algorithm) to transform the original minutiae which are extracted from the thinned fingerprint image. Then, Chinese remainder theorem is used to obtain the biokey from the integration of the transformed minutiae and the private key. The result shows that the scheme has better performance on security and efficiency comparing with other irreversible function schemes. PMID:25873989
A Fingerprint Encryption Scheme Based on Irreversible Function and Secure Authentication
Yu, Jianping; Zhang, Peng; Wang, Shulan
2015-01-01
A fingerprint encryption scheme based on irreversible function has been designed in this paper. Since the fingerprint template includes almost the entire information of users' fingerprints, the personal authentication can be determined only by the fingerprint features. This paper proposes an irreversible transforming function (using the improved SHA1 algorithm) to transform the original minutiae which are extracted from the thinned fingerprint image. Then, Chinese remainder theorem is used to obtain the biokey from the integration of the transformed minutiae and the private key. The result shows that the scheme has better performance on security and efficiency comparing with other irreversible function schemes. PMID:25873989
Biometrics based key management of double random phase encoding scheme using error control codes
NASA Astrophysics Data System (ADS)
Saini, Nirmala; Sinha, Aloka
2013-08-01
In this paper, an optical security system has been proposed in which key of the double random phase encoding technique is linked to the biometrics of the user to make it user specific. The error in recognition due to the biometric variation is corrected by encoding the key using the BCH code. A user specific shuffling key is used to increase the separation between genuine and impostor Hamming distance distribution. This shuffling key is then further secured using the RSA public key encryption to enhance the security of the system. XOR operation is performed between the encoded key and the feature vector obtained from the biometrics. The RSA encoded shuffling key and the data obtained from the XOR operation are stored into a token. The main advantage of the present technique is that the key retrieval is possible only in the simultaneous presence of the token and the biometrics of the user which not only authenticates the presence of the original input but also secures the key of the system. Computational experiments showed the effectiveness of the proposed technique for key retrieval in the decryption process by using the live biometrics of the user.
NASA Astrophysics Data System (ADS)
Lin, Chao; Shen, Xueju; Hua, Binbin; Wang, Zhisong
2015-10-01
We demonstrate the feasibility of three dimensional (3D) polarization multiplexing by optimizing a single vectorial beam using a multiple-signal window multiple-plane (MSW-MP) phase retrieval algorithm. Original messages represented with multiple quick response (QR) codes are first partitioned into a series of subblocks. Then, each subblock is marked with a specific polarization state and randomly distributed in 3D space with both longitudinal and transversal adjustable freedoms. A generalized 3D polarization mapping protocol is established to generate a 3D polarization key. Finally, multiple-QR code is encrypted into one phase only mask and one polarization only mask based on the modified Gerchberg-Saxton (GS) algorithm. We take the polarization mask as the cyphertext and the phase only mask as additional dimension of key. Only when both the phase key and 3D polarization key are correct, original messages can be recovered. We verify our proposal with both simulation and experiment evidences.
Tashima, Hideaki; Takeda, Masafumi; Suzuki, Hiroyuki; Obi, Takashi; Yamaguchi, Masahiro; Ohyama, Nagaaki
2010-06-21
We have shown that the application of double random phase encoding (DRPE) to biometrics enables the use of biometrics as cipher keys for binary data encryption. However, DRPE is reported to be vulnerable to known-plaintext attacks (KPAs) using a phase recovery algorithm. In this study, we investigated the vulnerability of DRPE using fingerprints as cipher keys to the KPAs. By means of computational experiments, we estimated the encryption key and restored the fingerprint image using the estimated key. Further, we propose a method for avoiding the KPA on the DRPE that employs the phase retrieval algorithm. The proposed method makes the amplitude component of the encrypted image constant in order to prevent the amplitude component of the encrypted image from being used as a clue for phase retrieval. Computational experiments showed that the proposed method not only avoids revealing the cipher key and the fingerprint but also serves as a sufficiently accurate verification system. PMID:20588510
A New Quaternion-Based Encryption Method for DICOM Images.
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
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.
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.
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.
Fried, Linda P.; Begg, Melissa D.; Bayer, Ronald
2014-01-01
Public health is at a watershed moment. The world’s health needs are changing, and complex problems require interdisciplinary approaches and systems-based solutions. Our longer lives and changing environments necessitate life-course and structural approaches to prevention. This argues strongly for public health graduate education that adequately prepares trainees to tackle emerging challenges and to lead now and in the future. Nearly a century of scholarship and scientific advances may offer a blueprint for training the next generation of public health leaders. We articulate a case for change; discuss some of the foundational principles that should guide public health education; and discuss what such a change might look like building on prior scholarship, on the examples set by other disciplines, and on our own experience. PMID:24228646
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
Data Hiding a Key Management for Interoperable Urban Services
NASA Astrophysics Data System (ADS)
Balitanas, Maricel O.; Kim, Taihoon
Availability of a reliable urban services data is the key component for an industrialized area. Urban settings are challenging places for experimentation and deployment and along with its complexity insecurity also contributes a bigger challenge. To address such issues this paper has defined the implementation issues in integrating Geospatial services data and web services technologies and proposed a methodology of securing the systems. The proposition presented earlier is a symmetric encryption which is to share the common key for doing both encryption and decryption secretly, and periodically.
NASA Astrophysics Data System (ADS)
Zhang, Yushu; Xiao, Di; Wen, Wenying; Tian, Yuan
2013-12-01
In some special multimedia applications, only the regions with semantic information should be provided better protection whereas the other smooth regions can be free of encryption. However, most of the existing multimedia security schemes only consider bits and pixels rather than semantic information during their encryption. Motivated by this, we propose an edge-based lightweight image encryption scheme using chaos-based reversible hidden transform and multiple-order discrete fractional cosine transform. An image is first carried out by the edge detection based on advanced CNN structure with adaptive thresholds to assess data significance in the image. The detection output is a binary image, in which a “1” reflects the detected pixel whereas a “0” is opposite. Both the detected image and the original image are divided into non-overlapping pixel blocks in the same way, respectively. Whether each block is encrypted or not depends on the significance judged by the corresponding detected block. The significant block is performed by reversible hidden transform followed by multiple-order discrete fractional cosine transform parameters and orders of these two transforms are determined by a two dimensional cross chaotic map. Experiment results show the significant contour features of an image that have been largely hidden only by encrypting about half pixels in the average sense. The keys are extremely sensitive and the proposed scheme can resist noise attack to some extent.
Zaidan, A A; Zaidan, B B; Kadhem, Z; Larbani, M; Lakulu, M B; Hashim, M
2015-02-01
This paper discusses the possibility of promoting public health and implementing educational health services using Facebook. We discuss the challenges and strengths of using such a platform as a tool for public health care systems from two different perspectives, namely, the view of IT developers and that of physicians. We present a new way of evaluating user interactivity in health care systems from tools provided by Facebook that measure statistical traffic in the Internet. Findings show that Facebook is a very promising tool in promoting e-health services in Web 2.0. Results from statistical traffic show that a Facebook page is more efficient than other pages in promoting public health. PMID:25631841
NASA Astrophysics Data System (ADS)
da Silva, Eduardo; Dos Santos, Aldri Luiz; Lima, Michele N.; Albini, Luiz Carlos Pessoa
Among the key management schemes for MANETs, the Self-Organized Public-Key Management System (PGP-Like) is the main chaining-based key management scheme. It is fully self-organized and does not require any certificate authority. Two kinds of misbehavior attacks are considered to be great threats to PGP-Like: lack of cooperation and impersonation attacks. This work quantifies the impact of such attacks on the PGP-Like. Simulation results show that PGP-Like was able to maintain its effectiveness when submitted to the lack of cooperation attack, contradicting previously theoretical results. It correctly works even in the presence of more than 60% of misbehaving nodes, although the convergence time is affected with only 20% of misbehaving nodes. On the other hand, PGP-Like is completely vulnerable to the impersonation attack. Its functionality is affected with just 5% of misbehaving nodes, confirming previously theoretical results.
ERIC Educational Resources Information Center
Clapp, John D.; Hohman, Melinda M.
2002-01-01
Study examined administrators' perceptions of service adequacy, provision of services, and evaluation of services of publicly funded alcohol and other drug treatment systems in California. Administrators reported that systems adequately serve most populations; however some suggested that adolescents, elderly, and homeless were not as adequately…
NASA Astrophysics Data System (ADS)
Sui, Liansheng; Liu, Benqing; Wang, Qiang; Li, Ye; Liang, Junli
2015-11-01
A double-image encryption scheme is proposed based on Yang-Gu mixture amplitude-phase retrieval algorithm and high dimension chaotic system in gyrator transform domain, in which three chaotic random sequences are generated by using Chen system. First, an enlarged image constituted with two plaintext images is scrambled by using the first two sequences, and then separated into two new interim images. Second, one interim image is converted to the private phase key with the help of the third sequence, which is modulated by a random phase key generated based on logistic map. Based on this private phase key, another interim image is converted to the ciphertext with white noise distribution in the Yang-Gu amplitude-phase retrieval process. In the process of encryption and decryption, the images both in spatial domain and gyrator domain are nonlinear and disorder by using high dimension chaotic system. Moreover, the ciphertext image is only a real-valued function which is more convenient for storing and transmitting, and the security of the proposed encryption scheme is enhanced greatly because of high sensitivity of initial values of Chen system and rotation angle of gyrator transform. Extensive cryptanalysis and simulation results have demonstrated the security, validity and feasibility of the propose encryption scheme.
De Castro, Paola; Marsili, Daniela; Poltronieri, Elisabetta; Calderón, Carlos Agudelo
2012-01-01
Background Open Access (OA) to scientific information is an important step forward in communication patterns, yet we still need to reinforce OA principles to promote a cultural change of traditional publishing practices. The advantages of free access to scientific information are even more evident in public health where knowledge is directly associated with human wellbeing. Objectives An OA ‘consolidation’ initiative in public health is presented to show how the involvement of people and institutions is fundamental to create awareness on OA and promote a cultural change. This initiative is developed within the project NEtwork of COllaboration Between Europe and Latin American Caribbean countries (NECOBELAC), financed by the European Commission. Methods Three actions are envisaged: Capacity building through a flexible and sustainable training programme on scientific writing and OA publishing; creation of training tools based on semantic web technologies; development of a network of supporting institutions. Results In 2010–2011, 23 training initiatives were performed involving 856 participants from 15 countries; topic maps on scientific publication and OA were produced; 195 institutions are included in the network. Conclusions Cultural change in scientific dissemination practices is a long process requiring a flexible approach and strong commitment by all stakeholders. PMID:22630360
An improved quantum key distribution protocol
NASA Astrophysics Data System (ADS)
Wu, Ting-wan; Wu, Guo-hua
2008-08-01
This paper presented an improved quantum key distribution protocol of the quantum cryptology. Using the same measure polarizer as BB84 protocol, the improved protocol we designed with not any classical channel, but a new looped quantum channel instead, so the job of sending and receiving can be finished only by one same person. It brings several good points: the utilization ratio of photons 100% in perfect condition, at least twice over other protocols, or even higher; the public channel easy to be attacked is avoided. Further, the improved protocol authenticates the legal communicators with pre-share information, so that no attacker can jump over the progress of authentication. Be alien from the protocol of BB84, the improved protocol uses message summary to detect whether messages intercepted by attacker. Because the message summary is encrypted by one-time-pad method using pre-share information, attacker could not alter the message summary and that not to be discovered. Moreover, some theoretical analysis to the improved protocol given with information theory: we used the measure channel concept for quantum detection, and calculated the information quantity obtained by attacker in the quantum secrecy communication. The analysis results provide the theory criterion for the legal communicators and the attackers.
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.
Enhanced Usage of Keys Obtained by Physical, Unconditionally Secure Distributions
NASA Astrophysics Data System (ADS)
Kish, Laszlo B.; Granqvist, Claes-Göran
2015-04-01
Unconditionally secure physical key distribution schemes are very slow, and it is practically impossible to use a one-time-pad based cipher to guarantee unconditional security for the encryption of data because using the key bits more than once gives out statistical information, for example via the known-plain-text-attack or by utilizing known components of the protocol and language statistics. Here, we outline a protocol that reduces this speed problem and allows almost-one-time-pad based communication with an unconditionally secure physical key of finite length. The physical, unconditionally secure key is not used for data encryption but is employed in order to generate and share a new software-based key without any known-plain-text component. The software-only-based key distribution is then changed from computationally secure to unconditionally secure, because the communicated key-exchange data (algorithm parameters, one-way functions of random numbers, etc.) are encrypted in an unconditionally secure way with a one-time-pad. For practical applications, this combined physical/software key distribution based communication looks favorable compared to the software-only and physical-only key distribution based communication whenever the speed of the physical key distribution is much lower than that of the software-based key distribution. A mathematical security proof of this new scheme remains an open problem.
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.
Information about NCI publications including PDQ cancer information for patients and health professionals, patient-education publications, fact sheets, dictionaries, NCI blogs and newsletters and major reports.
Content-based image retrieval in homomorphic encryption domain.
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
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.
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.
Penev, Lyubomir; Hagedorn, Gregor; Mietchen, Daniel; Georgiev, Teodor; Stoev, Pavel; Sautter, Guido; Agosti, Donat; Plank, Andreas; Balke, Michael; Hendrich, Lars; Erwin, Terry
2011-01-01
Abstract Scholarly publishing and citation practices have developed largely in the absence of versioned documents. The digital age requires new practices to combine the old and the new. We describe how the original published source and a versioned wiki page based on it can be reconciled and combined into a single citation reference. We illustrate the citation mechanism by way of practical examples focusing on journal and wiki publishing of taxon treatments. Specifically, we discuss mechanisms for permanent cross-linking between the static original publication and the dynamic, versioned wiki, as well as for automated export of journal content to the wiki, to reduce the workload on authors, for combining the journal and the wiki citation and for integrating it with the attribution of wiki contributors. PMID:21594104
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.
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.
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.
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.
NASA Astrophysics Data System (ADS)
Usikov, Denis A.
2013-09-01
The 2007 Planetary Defense Conference recommends "to provide or enhance Internet sites to show how threats evolve and to illustrate possible action scenarios". Thereby, establishment of informational and communicational AsteroidAware web-site with the exact, authentic data about the past and the present of Earth's impact events will assist in achievement of positive results and progress in different directions on political, international, social and scientific levels. Expanded ICT's capabilities for popularization of planetary defense can help in resolving the problem of low public interest. The project's primary intent lies in popularizing the concept of planetary defenses and attracting attention to the potential dangers that threaten the Earth from outer space. The result of the efforts falling into the boundaries of this project would be an increased amount of social participation in the process of developing solutions for and increasing awareness of potential collisions between various astral bodies and the Earth. The project is also aimed at creating a foundation for the interaction between scientists and executives from around the world to facilitate international efforts of searching for fitting measures towards lowering threat levels and developing strategies revolving around united actions against potential threats.
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.
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.
The SECOQC quantum key distribution network in Vienna
NASA Astrophysics Data System (ADS)
Peev, M.; Pacher, C.; Alléaume, R.; Barreiro, C.; Bouda, J.; Boxleitner, W.; Debuisschert, T.; Diamanti, E.; Dianati, M.; Dynes, J. F.; Fasel, S.; Fossier, S.; Fürst, M.; Gautier, J.-D.; Gay, O.; Gisin, N.; Grangier, P.; Happe, A.; Hasani, Y.; Hentschel, M.; Hübel, H.; Humer, G.; Länger, T.; Legré, M.; Lieger, R.; Lodewyck, J.; Lorünser, T.; Lütkenhaus, N.; Marhold, A.; Matyus, T.; Maurhart, O.; Monat, L.; Nauerth, S.; Page, J.-B.; Poppe, A.; Querasser, E.; Ribordy, G.; Robyr, S.; Salvail, L.; Sharpe, A. W.; Shields, A. J.; Stucki, D.; Suda, M.; Tamas, C.; Themel, T.; Thew, R. T.; Thoma, Y.; Treiber, A.; Trinkler, P.; Tualle-Brouri, R.; Vannel, F.; Walenta, N.; Weier, H.; Weinfurter, H.; Wimberger, I.; Yuan, Z. L.; Zbinden, H.; Zeilinger, A.
2009-07-01
In this paper, we present the quantum key distribution (QKD) network designed and implemented by the European project SEcure COmmunication based on Quantum Cryptography (SECOQC) (2004-2008), unifying the efforts of 41 research and industrial organizations. The paper summarizes the SECOQC approach to QKD networks with a focus on the trusted repeater paradigm. It discusses the architecture and functionality of the SECOQC trusted repeater prototype, which has been put into operation in Vienna in 2008 and publicly demonstrated in the framework of a SECOQC QKD conference held from October 8 to 10, 2008. The demonstration involved one-time pad encrypted telephone communication, a secure (AES encryption protected) video-conference with all deployed nodes and a number of rerouting experiments, highlighting basic mechanisms of the SECOQC network functionality. The paper gives an overview of the eight point-to-point network links in the prototype and their underlying technology: three plug and play systems by id Quantique, a one way weak pulse system from Toshiba Research in the UK, a coherent one-way system by GAP Optique with the participation of id Quantique and the AIT Austrian Institute of Technology (formerly ARCAustrian Research Centers GmbH—ARC is now operating under the new name AIT Austrian Institute of Technology GmbH following a restructuring initiative.), an entangled photons system by the University of Vienna and the AIT, a continuous-variables system by Centre National de la Recherche Scientifique (CNRS) and THALES Research and Technology with the participation of Université Libre de Bruxelles, and a free space link by the Ludwig Maximillians University in Munich connecting two nodes situated in adjacent buildings (line of sight 80 m). The average link length is between 20 and 30 km, the longest link being 83 km. The paper presents the architecture and functionality of the principal networking agent—the SECOQC node module, which enables the authentic
Animal welfare: a complex domestic and international public-policy issue--who are the key players?
Bayvel, A C David; Cross, Nicki
2010-01-01
Animal-welfare issues are usually portrayed in the media in a black-and-white fashion, with simple, single-perspective solutions proposed for what are often, in fact, complex policy issues. In this article, we argue that animal welfare is a multifaceted international and domestic public-policy issue that must take account of not only scientific, ethical, and economic issues but also religious, cultural, and international trade policy considerations. Management of animal welfare at a government policy level also requires an approach based on incremental change. Such change must be both science based and ethically principled, and the rate of change must recognize both the expectations of society and the constraints on the animal user. Ideally, such change should involve full ownership and buy-in from the affected animal user group. The range of stakeholders involved in the animal-welfare debate includes industry and producer groups, science bodies, and animal-welfare non-governmental organizations and professional groups, including the veterinary and legal professions. The veterinary profession, in particular, is expected to play an animal-welfare leadership role, and we discuss expectation versus reality at both a national and an international level. This latter discussion includes specific reference to the role of the World Organisation for Animal Health (the OIE) as an intergovernmental organization representing 175 countries and details some of the major achievements since the OIE assumed its international animal-welfare standard-setting role in 2002. We also address the role of the veterinary profession at national, regional, and international levels. PMID:20378871
2014-01-01
Background Measures to improve the quality and sustainability of healthcare practice and provision have become a policy concern. In addition, the involvement of stakeholders in health policy decision-making has been advocated, as complex questions arise around the structure of funding arrangements in a context of limited resources. Using a case study of assisted reproductive technologies (ART), deliberative engagements with a range of stakeholder groups were held on the topic of how best to structure the distribution of Australian public funding in this domain. Methods Deliberative engagements were carried out with groups of ART consumers, clinicians and community members. The forums were informed by a systematic review of ART treatment safety and effectiveness (focusing, in particular, on maternal age and number of treatment cycles), as well as by international policy comparisons, and ethical and cost analyses. Forum discussions were transcribed and subject to thematic analysis. Results Each forum demonstrated stakeholders’ capacity to understand concepts of choice under resource scarcity and disinvestment, and to countenance options for ART funding not always aligned with their interests. Deliberations in each engagement identified concerns around ‘equity’ and ‘patient responsibility’, culminating in a broad preference for (potential) ART subsidy restrictions to be based upon individual factors rather than maternal age or number of treatment cycles. Community participants were open to restrictions based upon measures of body mass index (BMI) and smoking status, while consumers and clinicians saw support to improve these factors as part of an ART treatment program, as distinct from a funding criterion. All groups advocated continued patient co-payments, with measures in place to provide treatment access to those unable to pay (namely, equity of access). Conclusions Deliberations yielded qualitative, socially-negotiated evidence required to inform ethical
ERIC Educational Resources Information Center
Aviation/Space, 1980
1980-01-01
Presents a variety of publications available from government and nongovernment sources. The government publications are from the Federal Aviation Administration (FAA) and the National Aeronautics and Space Administration (NASA) and are designed for educators, students, and the public. (Author/SA)
Portable RSA encryption-decryption subprogram for protecting proprietary text
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.
Query-Biased Preview over Outsourced and Encrypted Data
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
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)...
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.
Lithographically Encrypted Inverse Opals for Anti-Counterfeiting Applications.
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
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.
NASA Astrophysics Data System (ADS)
Sui, Liansheng; Liu, Benqing; Wang, Qiang; Li, Ye; Liang, Junli
2015-12-01
A color image encryption scheme is proposed based on Yang-Gu mixture amplitude-phase retrieval algorithm and two-coupled logistic map in gyrator transform domain. First, the color plaintext image is decomposed into red, green and blue components, which are scrambled individually by three random sequences generated by using the two-dimensional Sine logistic modulation map. Second, each scrambled component is encrypted into a real-valued function with stationary white noise distribution in the iterative amplitude-phase retrieval process in the gyrator transform domain, and then three obtained functions are considered as red, green and blue channels to form the color ciphertext image. Obviously, the ciphertext image is real-valued function and more convenient for storing and transmitting. In the encryption and decryption processes, the chaotic random phase mask generated based on logistic map is employed as the phase key, which means that only the initial values are used as private key and the cryptosystem has high convenience on key management. Meanwhile, the security of the cryptosystem is enhanced greatly because of high sensitivity of the private keys. Simulation results are presented to prove the security and robustness of the proposed scheme.
All-optical cryptography of M-QAM formats by using two-dimensional spectrally sliced keys.
Abbade, Marcelo L F; Cvijetic, Milorad; Messani, Carlos A; Alves, Cleiton J; Tenenbaum, Stefan
2015-05-10
There has been an increased interest in enhancing the security of optical communications systems and networks. All-optical cryptography methods have been considered as an alternative to electronic data encryption. In this paper we propose and verify the use of a novel all-optical scheme based on cryptographic keys applied on the spectral signal for encryption of the M-QAM modulated data with bit rates of up to 200 gigabits per second. PMID:25967489
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.
Fast Video Encryption Using the H.264 Error Propagation Property for Smart Mobile Devices
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
Hilton, Shona; Wood, Karen; Patterson, Chris; Katikireddi, Srinivasa Vittal
2014-01-01
On May 24th 2012, Scotland passed the Alcohol (Minimum Pricing) Bill. Minimum unit pricing (MUP) is an intervention that raises the price of the cheapest alcohol to reduce alcohol consumption and related harms. There is a growing literature on industry's influence in policymaking and media representations of policies, but relatively little about frames used by key claim-makers in the public MUP policy debate. This study elucidates the dynamic interplay between key claim-makers to identify lessons for policy advocacy in the media in the UK and internationally. Content analysis was conducted on 262 articles from seven UK and three Scottish national newspapers between 1st May 2011 and 31st May 2012, retrieved from electronic databases. Advocates' and critics' constructions of the alcohol problem and MUP were examined. Advocates depicted the problem as primarily driven by cheap alcohol and marketing, while critics' constructions focused on youth binge drinkers and dependent drinkers. Advocates justified support by citing the intervention's targeted design, but critics denounced the policy as illegal, likely to encourage illicit trade, unsupported by evidence and likely to be ineffective, while harming the responsible majority, low-income consumers and businesses. Critics' arguments were consistent over time, and single statements often encompassed multiple rationales. This study presents advocates with several important lessons for promoting policies in the media. Firstly, it may be useful to shift focus away from young binge drinkers and heavy drinkers, towards population-level over-consumption. Secondly, advocates might focus on presenting the policy as part of a wider package of alcohol policies. Thirdly, emphasis on the success of recent public health policies could help portray the UK and Scotland as world leaders in tackling culturally embedded health and social problems through policy; highlighting past successes when presenting future policies may be a valuable
Hilton, Shona; Wood, Karen; Patterson, Chris; Katikireddi, Srinivasa Vittal
2014-02-01
On May 24th 2012, Scotland passed the Alcohol (Minimum Pricing) Bill. Minimum unit pricing (MUP) is an intervention that raises the price of the cheapest alcohol to reduce alcohol consumption and related harms. There is a growing literature on industry's influence in policymaking and media representations of policies, but relatively little about frames used by key claim-makers in the public MUP policy debate. This study elucidates the dynamic interplay between key claim-makers to identify lessons for policy advocacy in the media in the UK and internationally. Content analysis was conducted on 262 articles from seven UK and three Scottish national newspapers between 1st May 2011 and 31st May 2012, retrieved from electronic databases. Advocates' and critics' constructions of the alcohol problem and MUP were examined. Advocates depicted the problem as primarily driven by cheap alcohol and marketing, while critics' constructions focused on youth binge drinkers and dependent drinkers. Advocates justified support by citing the intervention's targeted design, but critics denounced the policy as illegal, likely to encourage illicit trade, unsupported by evidence and likely to be ineffective, while harming the responsible majority, low-income consumers and businesses. Critics' arguments were consistent over time, and single statements often encompassed multiple rationales. This study presents advocates with several important lessons for promoting policies in the media. Firstly, it may be useful to shift focus away from young binge drinkers and heavy drinkers, towards population-level over-consumption. Secondly, advocates might focus on presenting the policy as part of a wider package of alcohol policies. Thirdly, emphasis on the success of recent public health policies could help portray the UK and Scotland as world leaders in tackling culturally embedded health and social problems through policy; highlighting past successes when presenting future policies may be a valuable
NASA Astrophysics Data System (ADS)
Sheeja, M. K.; Ajith Kumar, P. T.; Nair, Achuthsankar S.
2008-03-01
In this work two liquid crystal spatial light modulators (LCSLMs) were applied to encode a reference beam and holographic storage of a set of encrypted data pages that formed the object beam. The SLMs were developed by converting two 84×48 pixels mobile phone displays and were set in transmissive mode. Fourier holograms were recorded in a red sensitive photopolymer emulsion (SM635C of POLYGRAMA, Brazil), coated on a glass substrate. While replay the reconstructed data page, recorded against a specific reference beam was captured by using a CCD camera and processed in a personal computer for decryption. The encoded reference beam forms a unique key to the individual hologram recorded through shift multiplexing. Diffraction efficiency of holograms was calculated and was found to be about 45%. The system offers a very cost effective solution for secure data storage and retrieval and can be used for storing valuable software, security documents etc.
Phase-to-amplitude data page conversion for holographic storage and optical encryption.
Koppa, Pál
2007-06-10
A new phase-to-amplitude data page conversion method is proposed for efficient recovery of the data encoded in phase-modulated data pages used in holographic storage and optical encryption. The method is based on the interference between the data page and its copy shifted by an integral number of pixels. Key properties such as Fourier plane homogeneity, bit error rate, and positioning tolerances are investigated by computer modeling, and a comparison is provided with amplitude-modulated data page holographic storage with and without static phase masks. The feasibility and the basic properties of the proposed method are experimentally demonstrated. The results show that phase-modulated data pages can be used efficiently with reduced system complexity. PMID:17514316
NASA Astrophysics Data System (ADS)
Wang, Xiaogang; Dai, Chaoqing; Chen, Junlang
2014-10-01
By reverse-engineering the modified amplitude-phase retrieval-based attack that has deciphered the phase-truncated double random phase encoding scheme, we proposed a new cryptosystem to encode a target image into a preselected fake image using a modified phase retrieval algorithm under the framework of phase-truncated double random phase encoding. With two private keys that are generated during the encryption, the decryption can be optically realized using a classical linear double random phase encoding method. The proposed cryptosystem has immunity against the recently proposed specific attack and the new attack based on a modified amplitude-phase retrieval algorithm. Numerical results are presented to demonstrate the validity and good performance of our proposed algorithm.
A novel image encryption algorithm using chaos and reversible cellular automata
NASA Astrophysics Data System (ADS)
Wang, Xingyuan; Luan, Dapeng
2013-11-01
In this paper, a novel image encryption scheme is proposed based on reversible cellular automata (RCA) combining chaos. In this algorithm, an intertwining logistic map with complex behavior and periodic boundary reversible cellular automata are used. We split each pixel of image into units of 4 bits, then adopt pseudorandom key stream generated by the intertwining logistic map to permute these units in confusion stage. And in diffusion stage, two-dimensional reversible cellular automata which are discrete dynamical systems are applied to iterate many rounds to achieve diffusion on bit-level, in which we only consider the higher 4 bits in a pixel because the higher 4 bits carry almost the information of an image. Theoretical analysis and experimental results demonstrate the proposed algorithm achieves a high security level and processes good performance against common attacks like differential attack and statistical attack. This algorithm belongs to the class of symmetric systems.
Regoui, Chaouki; Durand, Guillaume; Belliveau, Luc; Léger, Serge
2013-01-01
This paper presents a novel hybrid DNA encryption (HyDEn) approach that uses randomized assignments of unique error-correcting DNA Hamming code words for single characters in the extended ASCII set. HyDEn relies on custom-built quaternary codes and a private key used in the randomized assignment of code words and the cyclic permutations applied on the encoded message. Along with its ability to detect and correct errors, HyDEn equals or outperforms existing cryptographic methods and represents a promising in silico DNA steganographic approach. PMID:23984392
Tulpan, Dan; Regoui, Chaouki; Durand, Guillaume; Belliveau, Luc; Léger, Serge
2013-01-01
This paper presents a novel hybrid DNA encryption (HyDEn) approach that uses randomized assignments of unique error-correcting DNA Hamming code words for single characters in the extended ASCII set. HyDEn relies on custom-built quaternary codes and a private key used in the randomized assignment of code words and the cyclic permutations applied on the encoded message. Along with its ability to detect and correct errors, HyDEn equals or outperforms existing cryptographic methods and represents a promising in silico DNA steganographic approach. PMID:23984392
Tisinger, R.M.; Brumfield, T.
1988-01-01
Shipper/receiver confirmatory measurements will be performed at Y-12 using equipment designed by Y-12 and the Safeguards Assay Group at Los Alamos. Equipment consists of three stationary NaI(Tl) gamma-ray counter arrays and a Digital Equipment Corporation Micro-11 processor for processing data. In the case of outgoing shipments, the counter data will be incorporated in a shipping file with other necessary documentation and transmitted to the intended recipient. In the case of incoming shipments, this station will receive a similar file from the sending organization. Protection of all data at the S/RD level is required. Transmission of the data files can be made point-to-point over telephone lines with proper encryption. Two commercial devices used in conjunction with a personal computer are being evaluated to provide secure communication endorsed by the National Security Agency (NSA). One device is the Gillaroo from P. E. Systems, Inc., and the other is the STU-III, which is available as a PC board or a standalone unit, whereas the STU-III is a Secure Telephone Unit with an RS-232 port for connection to a computer. In both cases, file encryption is performed in hardware using keys supplied by NSA. The prime advantage of this approach is a simplicity. Aside from key management, the whole operation can be automatically controlled by command files on the computer without involving additional interfaces with secure networks or mail systems. Additional benefits are rapid response, immediate confirmation of receipt of message, a communication channel independent of the shipment itself, and low cost.
Novel secret key generation techniques using memristor devices
NASA Astrophysics Data System (ADS)
Abunahla, Heba; Shehada, Dina; Yeun, Chan Yeob; Mohammad, Baker; Jaoude, Maguy Abi
2016-02-01
This paper proposes novel secret key generation techniques using memristor devices. The approach depends on using the initial profile of a memristor as a master key. In addition, session keys are generated using the master key and other specified parameters. In contrast to existing memristor-based security approaches, the proposed development is cost effective and power efficient since the operation can be achieved with a single device rather than a crossbar structure. An algorithm is suggested and demonstrated using physics based Matlab model. It is shown that the generated keys can have dynamic size which provides perfect security. Moreover, the proposed encryption and decryption technique using the memristor based generated keys outperforms Triple Data Encryption Standard (3DES) and Advanced Encryption Standard (AES) in terms of processing time. This paper is enriched by providing characterization results of a fabricated microscale Al/TiO2/Al memristor prototype in order to prove the concept of the proposed approach and study the impacts of process variations. The work proposed in this paper is a milestone towards System On Chip (SOC) memristor based security.
Research on text encryption and hiding method with double-random phase-encoding
NASA Astrophysics Data System (ADS)
Xu, Hongsheng; Sang, Nong
2013-10-01
By using optical image processing techniques, a novel text encryption and hiding method applied by double-random phase-encoding technique is proposed in the paper. The first step is that the secret message is transformed into a 2- dimension array. The higher bits of the elements in the array are used to fill with the bit stream of the secret text, while the lower bits are stored specific values. Then, the transformed array is encoded by double random phase encoding technique. Last, the encoded array is embedded on a public host image to obtain the image embedded with hidden text. The performance of the proposed technique is tested via analytical modeling and test data stream. Experimental results show that the secret text can be recovered either accurately or almost accurately, while maintaining the quality of the host image embedded with hidden data by properly selecting the method of transforming the secret text into an array and the superimposition coefficient.
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.
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.
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.
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.
Color image encryption scheme using CML and DNA sequence operations.
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
Data encryption standard ASIC design and development report.
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.
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.
On applying molecular computation to the data encryption standard.
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
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.
Encryption and the Loss of Patient Data
ERIC Educational Resources Information Center
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…
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.
Experimental QR code optical encryption: noise-free data recovering.
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
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).
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.
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.
Encryption On Grayscale Image For Digital Image Confidentiality Using Shamir Secret Sharing Scheme
NASA Astrophysics Data System (ADS)
Rodiah; Anggraini, Dyah; Fitrianingsih; Kazhimi, Farizan
2016-04-01
The use of high-frequency internet in the process of exchanging information and digital transaction is often accompanied by transmitting digital image in the form of raster images. Secret sharing schemes are multiparty protocols that related to the key establishment which provides protection against any threats of losing cryptography key. The greater the key duplication, the higher the risk of losing the key and vice versa. In this study, Secret Sharing Method was used by employing Shamir Threshold Scheme Algorithm on grayscale digital image with the size of 256×256 pixel obtaining 128×128 pixels of shared image with threshold values (4, 8). The result number of shared images were 8 parts and the recovery process can be carried out by at least using 4 shares of the 8 parts. The result of encryption on grayscale image is capable of producing vague shared image (i.e., no perceptible information), therefore a message in the form of digital image can be kept confidential and secure.
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.
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)...
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)...
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)...
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...
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.
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...
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...
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...
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)...
Deas, L; Mattu, L; Gnich, W
2013-11-01
Increased political enthusiasm for evidence-based policy and action has re-ignited interest in the use of evidence within political and practitioner networks. Theories of evidence-based policy making and practice are being re-considered in an attempt to better understand the processes through which knowledge translation occurs. Understanding how policy develops, and practice results, has the potential to facilitate effective evidence use. Further knowledge of the factors which shape healthcare delivery and their influence in different contexts is needed. This paper explores the processes involved in the development of a complex intervention in Scotland's National Health Service (NHS). It uses a national oral health programme for children (Childsmile) as a case study, drawing upon key actors' perceptions of the influence of different drivers (research evidence, practitioner knowledge and values, policy, and political and local context) to programme development. Framework analysis is used to analyse stakeholder accounts from in-depth interviews. Documentary review is also undertaken. Findings suggest that Childsmile can be described as an 'evidence-informed' intervention, blending available research evidence with knowledge from practitioner experience and continual learning through evaluation, to plan delivery. The importance of context was underscored, in terms of the need to align with prevailing political ideology and in the facilitative strength of networks within the relatively small public health community in Scotland. Respondents' perceptions support several existing theoretical models of translation, however no single theory offered a comprehensive framework covering all aspects of the complex processes reported. Childsmile's use of best available evidence and on-going contribution to knowledge suggest that the programme is an example of intelligent policy making with international relevance. PMID:24034945
Counteractive functions are encrypted in the residues of CD154.
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
Encrypted imaging based on algebraic implementation of double random phase encoding.
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
The effect of algorithm-agile encryption on ATM quality of service
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.
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.
Wavelength multiplexing encryption using joint transform correlator architecture.
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
Multichanneled encryption via a joint transform correlator architecture.
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
Scalable end-to-end ATM encryption test results
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.
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.
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.