Search

Cyber Security has become rising issue in recent years where encryption is one of solution and has an important role in data protection. Encryption algorithms that widely used in information security are asymmetric and symmetric. Advanced Encryption Standard (AES) is one of symmetric encryption that most used often and the most secure encryption today. However, AES encryption has slow computation. Our experiment show that both of algorithms combination needs 3.045 milliseconds for 1024 bytes of data and increase 3-4 milliseconds for 2048 bytes of data and so on. This paper proposes a novelty method to improve AES algorithm with Shift Row and S.Box modification for Mix Column transformation. The result show that our optimization has reduced 3 milliseconds and continue to increase as the number of bytes increases. Percentage average of the optimization is 86.143%.

Confidentiality is among the most important obstacles for widespread adoption of cloud services. In fact, researchers have invented a new promising form of encryption, homomorphic encryption, that can be considered as an effective way to overcome these obstacles. Since cloud computing environment is more threatened by attacks and since cloud consumers often use resource-constrained devices to access to cloud computing services, the homomorphic encryption schemes must be promoted, in terms of security level and running time, to work efficiently. At EMENA-TSSL’16, we boosted the standard RSA encryption scheme at security level, Cloud-RSA. In this paper, we propose a new fast variant of the Cloud-RSA scheme to speed up its algorithms. The proposed variant uses a modulus of the form N = prqs for r, s ≥ 2 and employs Hensel lifting and Chinese remaindering to decrypt. Simulation results show that the proposed variant gives a large speed up over the Cloud-RSA scheme while preserving a prescribed security level.

With the growth in technology, there is always a need of good encryption method which may provide better security and authenticity with lesser computational complexities. Although there are a lot of symmetric key algorithms which are already been proposed, yet we are going to propose a content based symmetric key algorithm. This algorithm has two rounds and each round uses the ASCII code of characters, round two serves as the heart of this algorithm as XOR operation is performed here. It uses only two operation addition and XOR for encryption process and to generate two sub key, it uses two operation addition and subtraction. The goal of the algorithm is to reduce the correlation between plain text and cipher.

Attribute Based Encryption (ABE) is a type of public encryption in decryptor can only decrypt the ciphertext if its attributes of secret key matches the attributes of ciphertext but functionality comes at higher cost. The main idea of this paper is to provide multi authority in attribute based encryption which also allows fast decryption. Multi authority concept allows any polynomial number of independent authorities to monitor attributes, distribute secret keys and decrypt the message. In this paper, a secure multi authority attribute based encryption with fast decryption scheme is design.

In this fast world of networking, secure image transmission of data whether the image having some information or some text, is one of the area focus for security. Here we had tried to implement the proposed technique fuzzy logic based image encryption for confidential data transfer using (2, 2) secret sharing scheme. Using fuzzy logic makes encryption and decryption complex. The (2, 2) secret sharing scheme provides secured and confidential authentication. For image encryption AES algorithm is used for encryption and decryption. The implementation of encryption algorithms can be very complex when we are focusing on rule based share generation.

There are important concerns when trusting sensitive information to the cloud. Health and financial records, for instance, suffer strict legal restrictions to data escrow. Organizations holding such information need to assure end-users and authorities that a third party will never access restricted data. Client-side encryption is a common solution in literature. Most works fail, however, to reason the impact of security solutions on performance and usability. Homomorphic and order preserving encryption systems can mitigate such negative impacts, as they allow the computation of regular searches over encrypted records on the cloud, while preserving information confidentiality and the privacy if end-users.

Disk encryption is frequently used to secure confidential data on mobile devices. However, the high energy cost of disk encryption poses a heavy burden on those devices with limited battery capacity especially when a large amount of data needs to be protected by disk encryption. To address the challenge, we develop a new kernel-level disk encryption software, Populus. Almost 98% of Populus's encryption/decryption computation is not related with the input plaintext/ciphertext, so we accomplish the computation in advance during initialization when a consistent power supply is available. We conduct cryptanalysis on Populus and finally conclude that state-of-the-art cryptanalysis techniques fail to break Populus in reasonable computational complexity. We also conduct energy consumption experiments on Populus and dm-crypt, a famous disk encryption software for Android and Linux mobile devices. The experimental results demonstrate that Populus consumes 50%-70% less energy than dm-crypt.

Data security has a major role in the development of communication system, where more randomization in the secret keys increases the security as well as the complexity of the cryptography algorithms. In the recent years network security has become an important concern. Cryptography plays a vital role in the information security system against various attacks. Efficient and newer versions of cryptography techniques can help to reduce this security threat. The Advanced Encryption Standard is a strong symmetric key cryptographic algorithm which uses a number of table look ups to increase its performance. The Cache Timing Attack correlates the timing details for encryption under a known key with an unknown key to infer the unknown key. This paper proposes an extension of a public-key cryptosystem to support a private key cryptosystem which is a combination of Advanced Encryption Standard and ECC. The past results have been computed on the basis of AES key length as 128 bit and no. of iterations as 10.To increase competency and to minimize drawbacks this paper proposes a hybrid encryption scheme. The parameters to be studied will primarily focus on the key length, no. of iterations and the type of side channel attack to be implemented. The key length for this work has been increased to 192 bit and the no. of iterations taken will be 12.

Cloud computing is emerging paradigm provides various IT related services. The security and privacy are two major factors that inhibits the growth of cloud computing. Security factors are reasons behind lesser number of real times and business related cloud applications compared to consumer related cloud application. Firstly, the pros and cons of different Attribute Based encryption methods are analysed. Secondly, a new encryption method based on Attribute Based Encryption (ABE) using hash functions, digital signature and asymmetric encryptions scheme has been proposed. Our proposed algorithm is simplified yet efficient algorithm that can implemented for cloud critical application.

The enlarged size of the internet and vast communication across it and also medical needs digital images require of security plays vital role. So different techniques are used to protect confidential image data from unauthorized access. In this paper, we propose a New encryption technique Using elliptic curve cryptography with a magic matrix operations for securing images that transmits over a public unsecured channel. There are two most important groups of image encryption algorithms: some are non chaos-based selective methods and chaos- based selective methods. The majority of these algorithms is planned for a specific image format, compressed or uncompressed.

This paper presents a simple Encryption/Decryption technique which enables all kinds of file for encryption and decryption. The method of encryption is not only simple, but also secured enough for transmission. The technique uses simple key generation using an arbitrary matrix. The final encryption is performed through a set of operations using the generated key and original data block and vice-versa in decryption. The generation of keys along with encryption and decryption is performed by the algorithm by putting in the data block and arbitrary matrix. The encryption process can be done by modifying the arbitrary matrix and multiple key can be generated for a single data block.

In current Internet, data owners can provide integrity and authentication when data is generated. However confidentiality is usually implemented by symmetric keys between two corresponding programs in an end-to-end manner. A symmetric key for confidentiality is not suitable for Internet of Things (IoT) environment where there are one producer of data and multiple consumers of data. Further the consumers differ in their qualification about what part of the data is allowed to access under which context. In the paper we describe our work in progress of confidentiality scheme in which the producer encrypts data along with context. We improve Key Policy Attribute Based Encryption (KP-ABE) and Ciphertext Policy Attribute Based Encryption (CP-ABE) to allow consumers to decrypt data as their contexts dictate. We describe briefly our scheme to implement the idea.

In 2006, Hwang et al. presented a forgery attack against Tseng et al. ’s efficient authenticated encryption schemes with message linkages for message flows. Moreover, they proposed some modified schemes to repair these flaws. In this paper, we show that the improved authenticated encryption schemes proposed by Hwang et al. are insecure by presenting another attack that allows a dishonest referee, dealing with a dispute, to decrypt all the future and past authenticated ciphertext between the contending parties. This attack proves that Hwang et al. ’s schemes contradict the forward and backward confidentiality requirements of authenticated encryption schemes.

In today's era, security is getting important day by day. But security constraints for the text data which is sent over the network is also fetching confront with the attractiveness. This paper introduces a selective encryption method named Selective significant data encryption (SSDE) for text data encryption. The SSDE provides sufficient uncertainty to the data encryption process as it selects only significant data out of the whole message. This in turn reduces the encryption time overhead and enhances the performance. The encryption part is performed by the help of symmetric key algorithm. For this purpose BLOWFISH algorithm is used. First, I introduce the concept of cryptography, and symmetric and asymmetric types of encryption methods. Then the overview of selective encryption is given which is followed by the introduction of SSDE. In this research, I proposed a method SSDE which is compared with existing methods, that is, full data encryption and Toss-A-Coin method with the simulation experimental setup based on NS 2.35.

It is a well-known fact that the Internet traffic travels through public networks. These networks lack security and are vulnerable. Encryption and public key cryptography are important technologies that are used to preserve data security and integrity, and to reduce information theft on the public networks. However, the existing routing protocols are incapable of providing secure data transmission on public networks. To this end, our laboratory introduced the Service-oriented Router (SoR) to maintain rich information for the next-generation networks by shifting the current Internet infrastructure to an information-based and an open-innovation platform. An SoR can analyze all packet stream transactions on its interfaces and store them in high throughput databases. Using the features of the SoR, in this paper, we propose a hop-by-hop routing protocol that provides per-hop data encryption. This infrastructure is proposing to preserve both the security and the privacy of data that traverses through public networks. We implemented a prototype of per-hop data encryption protocol on the ns-3 simulator and the results obtained are discussed in this paper.

Today various numbers of diverse applications that include e- payments in secure commerce and payment applications to provide security for their communications and transactions by protecting passwords. Encryption is a fundamental tool for the protection of sensitive information. The purpose is to use encryption is privacy for preventing disclosure or confidentiality in during communications. In this paper, we proposed a new method which is based on the Euler's Totient theorem to produce a set of numbers that encrypt the data stream and then we used our proposed method using an ECC approach to generate the signature key which is added to encrypt data before transmission and decryption operation and a signature can verify at the receiver site.

Cloud computing is an emerging paradigm that affects a large part of the IT industry by offering dynamically scalable resources (e.g., hardware and software) that are provisioned as a service over the Internet. Cloud computing provides numerous advantages to organizations in terms of improved scalability, lower cost, and flexibility, to name a few. Despite these technical and economical advantages, many potential cloud consumers are still hesitant to adopt cloud computing due to security and privacy concerns. In particular, one of the main factors for the reluctance of organizations to adopt cloud computing is the lack of strong encryption scheme that can ensure the confidentiality of client's data while store in cloud service provider's (CSPs) data centers. With the existing encryption schemes adopted by the CSPs, there is always a possibility that the client's data can be compromised due to insider threats. In this paper, we propose a new scheme capable to secure client information from both insider and outsider threats. In particular, we develop an encryption scheme by combining both symmetric and asymmetric cryptographic algorithms, which provide strong data confidentiality preserving secret key encryption functionalities, including periodically renewable public key certificates through trusted third parties. Due to these functionalities, the data owner can utilize the best secret key encryption schemes while the trusted third party will hold and communicate the secret keys to CSPs on behalf of cloud service users (CSUs).

Data security is of utmost importance in today's world. Especially when the data is travelling through an insecure communication network. There are symmetric key encryption techniques which use only one key for both encryption and decryption of the data. They are simple in design but can be easily cracked using brute force attacks. The entire security of such a cipher could be compromised if the attacker anyhow gets access to the keys. On the other hand, there are asymmetric key based algorithms which use a pair of keys, one for encryption, and the other for decryption, whose security is higher as compared to the symmetric ones but lack in time efficiency. It is also difficult to manage such a huge base of key-pairs efficiently and safely. This paper mainly focusses on the implementation of a system capable of encryption and decryption of multimedia data (Text, Images, Videos, Audio etc.) using a hybrid model based on the amalgamation of symmetric encryption techniques such as AES and asymmetric techniques such as ECC. ECC is based on the toughness of the discrete logarithm problem (DLP), whose public key is short, network bandwidth is little and ability to resist to attack is strong which makes it really difficult to guess the keys. Even if the attacker gets access to any of the keys, he or she won’t be in a position to decipher it in a relatively finite amount of man-years.