Since last three decades there are close relationships between chaotic theory and cryptographic theory. Chaotic system behaviors like; highly sensitive to initial states, mix up attribute, deterministic nature and also cannot predict the long term returns, these characteristics help the researchers to enhance security of a cryptography systems, therefore growing number of random numbers generators based on chaotic have been proposed. These proposed generators suffer from limited key space and those based on 1D chaotic map have limited entropy generation capability due to their finite number of Lyapunov exponent(s). In this paper, we propose a random binary sequences generator that produces sequence of bits.General structure of proposed model consists of two parts, first part is mouse device as the nondeterministic source and second part is 3D chaotic system with the coordinates of mouse cursor when movement as the initial seeds, and combines the produced values in algorithmic process. The coordinates of mouse cursor are treated as initial random number with post processing with 3D chaotic maps to increase the randomness and security of the keys. The proposed work has high key space and very long period. Also make obvious that the generated keys possess successful statistical characteristics which is expected of true random binary sequences that are suitable to use in critical cryptography systems, these made by evaluating the results by hardness of 16 tests of NIST(National Institute of Standards and Technology).
More and more data is available on database every day. The greater the amount of data in database led to create a problem in process and retrieving the required data. Security is one of the significant challenges that people are faced over the entire world in every aspect of their lives. Databases are vulnerable to attack from internal and external threats. One of security dialogues is data encryption/decryption whenever data being transmitted over communication lines may be protected by encrypting the data, which can be decrypted only by the authorized person. The retrieval from big encrypted database stills a big problem. The proposed system presents a new method used to retrieve data from (encrypted database; encrypted compressed database or encrypted dynamic clusters). These data retrieved represents the answers to the user query. In this research the retrieving from big encrypted database was processed by matching cipher query with encrypted database. The proposed system uses clustering technique to build block of data according to the encrypted user query (entries or requirements). The comparison includes the retrieving time that was required from matching plain query with plain data and cipher query with cipher data. In traditional system the retrieving was done by decrypting the entire database or decrypting part of it to find the data that matched the user query.This would be consumed too large time. The work of this paper allows to the users to query over encrypted database without decrypting the database, instead of that, it work on comparing cipher query with encrypted database and retrieving the results in cipher form. The data retrieval process is considered the main objective of this research and not the encryption process. So, the simple encryption operation was used to measure the performance of the data retrieving method (by matching encrypted query with encrypted data).
Retrieving Encrypted Query from Encrypted
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.