Encryption Methodology Research Articles

Implementation of RSA Cryptography Algorithm in Language C in Exchange of Text Messages

The encryption approach is widely used in mobile applications where there is message exchange and in banking transactions or financial pointers tools. The present research has as a proposal to approach an algorithm developed in C language and based on the RSA encryption methodology using the symmetric and asymmetric key concepts in order to demonstrate its use in the exchange of messages where there is secrecy of information, thus the importance of information security, its use has obtained interesting results with the manipulation of large scale vectors where the number of characters is a factor the process of letter inversion for encryption and decryption.

Nodal Level Adaptive Security for IOT-Enabled Sensors through Dynamic Reconfigurable Encryption

IOT-enabled sensors have been deployed in the wide area to perform various applications. Information security is an important aspect in wireless sensor networks. Since the attackers can be able to hack the information even at the node level, improved security mechanism have to be implemented. In this paper, nodal level security is done through dynamic encryption technique. The advantage of dynamic encryption is achieved by adaptive security. The proposed method involves a system-on-chip (SoC) design to provide a dynamically reconfigurable encryption methodology which leads to improved security level and also the energy efficiency. Dynamic encryption creates the confusion among the hackers about the tracking of security keys. The results shows that by dynamically selecting the encryption module through soft-core processor based on the available power budget, an energy efficient security solution is obtained for sensor nodes with reduced resources utilization.

Design and Implementation of AES Algorithm

In this paper the Advanced Encryption Standard (AES) was endorsed by the National Institute of Standards and Technology in 2001. It was intended to supplant the maturing Data Encryption Standard (DES) and be valuable for a wide scope of utilizations with differing throughput, zone, control dissemination and vitality utilization necessities .Though they are very adaptable, FPGAs are regularly less effective than Application Specific Integrated Circuits (ASICs); There have been numerous AES executions that attention on acquiring high throughput or low region use, however almost no examination done in the territory of low power or vitality productive based AES; actually, it is uncommon for assessments on power dispersal to be made by any means. This postulation introduces new effective equipment usage to those propelled encryption standard (AES) calculation. Two primary commitments are introduced in this thesis, the initial you quit offering on that one will be a secondary speed 128 odds AES encrypted, and the second person is another 32 odds AES configuration. In 1st commitment An 128 odds circle unrolled sub-pipelined AES encrypted is exhibited. In this encrypted a effective blending to those encryption methodology sub-steps will be executed following relocating them. Those second commitment displays An 32 odds AES plan. In this design, the S-BOX is actualized for inward pipelining Furthermore it is imparted the middle of those principle round and the enter development units. Also, the way development unit is actualized will fill in on the fly What's more previously, parallel with the fundamental round unit. These outlines bring attained higher FPGA (Throughput/Area) effectiveness analyzing to past AES outlines.

Class Based Multi Stage Encryption for Efficient Data Security in Cloud Environment Using Profile Data

The security issues in the cloud have been well studied. The data security has much importance in point of data owner. There are number of approaches presented earlier towards performance in data security in cloud. To overcome the issues, a class based multi stage encryption algorithm is presented in this paper. The method classifies the data into number of classes and different encryption scheme is used for different classes in different levels. Similarly, the user has been authenticated for their access and they have been classified into different categories. According to the user profile, the method restricts the access of user and based on the same, the method defines security measures. A system defined encryption methodology is used for encrypting the data. Moreover, the user has been returned with other encryption methods which can be decrypted by the user using their own key provided by the system. The proposed algorithm improves the performance of security and improves the data security.

An Encryption Methodology for Enabling the Use of Data Warehouses on the Cloud

A cloud data warehouse (cloud DW) is a subject-oriented, integrated, time-variant, voluminous, nonvolatile and multidimensional distributed database that is hosted in a cloud. A solution to ensure data confidentiality for a cloud DW is cryptography. In this article, the authors propose an encryption methodology for a cloud DW stored according to the star schema, considering both the data confidentiality maintenance of the DW and the capability of processing analytical queries directly over the encrypted DW. The proposed encryption methodology comprises an encryption strategy for DW called MV-HO (MultiValued and HOmomorphic) for the definition of how the different types of DW's attributes must be encrypted. The proposed MV-HO encryption strategy was compared with encryption strategies based on symmetric encryption, order preserving symmetric encryption and homomorphic encryption. Results indicated that MV-HO is the best solution found, as MV-HO is pareto-optimal with respect to other strategies investigated.

Energy Efficient QoS Aware SOCCOR Protocol for Improving Throughput in Wireless Mesh Networks

In a wireless mesh network (WMN), the network link detached among dozens or thousands of wireless meshes that “talk” to each alternative node to distribute the network association over the big space. The numerous downsides in a WMN are the energy consumption and throughput improvement. Even though, many techniques to resolve the concern of power consumption and performance improvement, this type of techniques do not give higher efficiency. In our proposed methodology we introduce a protocol known as swarm optimization clustering and colony optimization routing (SOCCOR). It is the combined technique of energy consumption based improved swarm optimization (EISO) and colony optimization routing (COR). The EISO uses chaotic sequences for weight parameter to improve the global searching ability and escape from local minima. During this EISO clustering fitness is evaluated for multiple iterations and this process continues until getting the optimum value. During the routing process, security also improved with different sparse matrix encryption methodology. COR is mainly used to find out the shortest path among the overall transmission. During this strategy, pheromone values updated by all the ants have reached the destination with the continuous manner and achieve an optimum resolution. Finally, the simulation was carried on the platform of NS-2 simulation tool. SOCCOR protocol can give economic transmission by reducing the consumption of energy and enhancing throughput.

Unbounded and revocable hierarchical identity-based encryption with adaptive security, decryption key exposure resistant, and short public parameters.

Revocation functionality and hierarchy key delegation are two necessary and crucial requirements to identity-based cryptosystems. Revocable hierarchical identity-based encryption (RHIBE) has attracted a lot of attention in recent years, many RHIBE schemes have been proposed but shown to be either insecure or bounded where they have to fix the maximum hierarchical depth of RHIBE at setup. In this paper, we propose a new unbounded RHIBE scheme with decryption key exposure resilience and with short public system parameters, and prove our RHIBE scheme to be adaptively secure. Our system model is scalable inherently to accommodate more levels of user adaptively with no adding workload or restarting the system. By carefully designing the hybrid games, we overcome the subtle obstacle in applying the dual system encryption methodology for the unbounded and revocable HIBE. To the best of our knowledge, this is the first construction of adaptively secure unbounded RHIBE scheme.

Improving Privacy and Security in Decentralizing Multi-Authority Attribute-Based Encryption in Cloud Computing

Decentralizing multi-authority attribute-based encryption (ABE) has been adopted for solving problems arising from sharing confidential corporate data in cloud computing. For decentralizing multi-authority ABE systems that do not rely on a central authority, collusion resistance can be achieved using a global identifier. Therefore, identity needs to be managed globally, which results in the crucial problems of privacy and security. A scheme is developed that does not use a central authority to manage users and keys, and only simple trust relations need to be formed by sharing the public key between each attribute authority (AA). User identities are unique by combining a user’s identity with the identity of the AA where the user is located. Once a key request needs to be made to an authority outside the domain, the request needs to be performed by the authority in the current domain rather than by the users, so, user identities remain private to the AA outside the domain, which will enhance privacy and security. In addition, the key issuing protocol between AA is simple as the result of the trust relationship of AA. Moreover, extensibility for authorities is also supported by the scheme presented in this paper. The scheme is based on composite order bilinear groups. A proof of security is presented that uses the dual system encryption methodology.

Sequential mathematical solution for authentication and authorization technique implementing encryption methodology creating secure transaction using various methods also at quantum level

We see challenges in authenticating each aspect of electronic usage, starting from transaction to social interaction the authenticity and availability of correct information is guided in various ways. Authentication and authorization follow one another; a process of authentication is calculated on multiple layers of steps. In this paper we discuss various possibilities of modifying and using ways to deal with authentication and authorization mechanism. Idea is to work through authentication with mathematical calculations. We will go through various scenarios and find out the system of information that fits best at the moment of need. We will take account of new approaches of authentication and authorization while working on mathematical paradigm of information. The paper also takes an eye on quantum cryptography and discusses on how it could help one in the present scenario. This paper is divided into sections discussing on various paradigm of authentication and how one can achieve it in secure way, this paper is part of research work where analysis of various constraints are to be followed in the extended research work.

A Highly Secure Secret Key Encryption Methodology Using Dual Permutation

This paper describes a novel secret key cryptography algorithm where a dual encryption methodology has been incorporated. The first level is a block level encryption, where the original text message is divided into several fixed sizeblocks. An initial permutation has been applied on that n number of block sets and by using a secret key, a particular sequence of blockshas been chosen. The second level is a bit level encryption, where the same permutation has been applied within each block and a particular bit sequence within a block has been chosen.XOR and bit shifting are some intermediate operation has been applied for security purpose.Asecret key is being prepared by storing the block level as well as the bit level random values.The block size of this proposed method is 16bits. The main key advantage of the proposed method is that by using this bit level and block level encryption the securityis increasedof the algorithm in a higher semantic level.

Secure and Efficient Data Contribution Using Extended Identity Based Encryption In Cloud Computing

Cloud computing is used to share computing resources and data over internet. When sensitive data is shared over Internet, it should be transferred in secured manner. Data security is ensured using Identity Based Encryption mechanism. In the existing Cloud Computing system which is implemented using Identity Based Encryption mechanism, authorized user can share their credential to unauthorized user and data can be accessed by unauthorized user who hasn’t subscribed to Cloud Computing System. To overcome this issue, we propose a notion called Extended Identity Based Encryption(E-IBE) system, which ensures authentication and confidentiality. In this approach, we use Kerberos authentication protocol along with Identity Based Encryption methodology to ensure authentication and confidentiality.

Secure Multicast Communication using RSA and DNA Cryptography

Security in communications especially in group communication plays a major role in today’s world and it has to be implemented properly with the help of an efficient and robust encryption and decryption methodology. In a Multicast communication the media used is wireless and it is difficult to communicate the message secure and secretly to the group members in the normal form of message, thus we go in search of an efficient cryptographic scheme for encrypting that plain text into a cipher text. In this paper, we propose a cryptographic scheme based on RSA and the primer concept used in PCR technology. The proposed scheme yields better result than the existing schemes.

A View on LSB Based Audio Steganography

In this paper the concept of cryptography and steganography are combined to perform a powerful encryption. Here we propose a novel approach where a duel encryption methodology has been implemented. In the first level of encryption a pattern matching algorithm has been employed to encrypt the text message in terms of their positional value. In second level, the conventional LSB method has been used to embed the positional value in the cover file. Such a duel encryption method will ensure data security in an efficient manner. Finally the performance of the proposed method is evaluated in terms of means square error (MSE) and signal to noise ratio (SNR). A comparison has been carried out with conventional LSB method. The experimental results and the comparisons demonstrated that our algorithm is highly efficient in terms of encryption and the capacity size of the text.

Higher security of ASIC fabrication process against reverse engineering attack using automatic netlist encryption methodology

Reverse engineering is a great peril for hardware security especially when functional behavior extraction is required. In this paper a new automated mechanism is proposed to encrypt routing topology of the design which leads to hinder reverse engineering during the foundry/fabrication process. Moreover, new special standard cells (Wire Scrambling cells) are proposed corresponding with an automatic design flow to insert the WS-cells inside the netlist with the aim of maximum effectiveness of obfuscation and minimum overhead. The highlight feature of this mechanism is that it can be performed without detailed information about the functionality and structure of the design and hence, it can be automated easily. This methodology is implemented using an academic physical design framework (EduCAD). Experimental results show that reverse engineering can be hindered considerably in cost of negligible overheads in area, power consumption and total wire length.

An efficient and provable secure revocable identity-based encryption scheme.

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.

LR-FEAD: leakage-tolerating and attribute-hiding functional encryption mechanism with delegation in affine subspaces

In large-scale networks, such as cloud computing and Internet of Things, functional encryption mechanism provides a flexible and powerful cryptographic primitive in constructing the secure transmission and communication protocols. However, as the side-channel attacks in open environments, the attacker can gain partial sensitive information from the pre-defined system by virtue of the time, power analysis, cold-boot attacks, etc. In this work, we design a leakage-resilient functional encryption scheme, which tolerates amount of bounded master-key leakage and user private-key leakage. In our scheme, encryption policies are specified as point vectors and decryption roles are defined as affine subspaces. Role delegation is implemented by specifying the affine transformation over subspaces. Our scheme achieves payload hiding and attribute hiding in the sense that the attacker is able to specify any efficiently computable leakage functions and learns the function outputs taking the master/private keys as inputs. Also, our scheme can tolerate the continual leakage for master key and private key, since we can periodically update the master key and the private key to generate a new and re-randomized key with the same distribution to the previous keys. We construct the scheme in composite-order bilinear groups and prove the security with dual system encryption methodology. We also analyze and discuss the performance of allowable leakage bound, leakage ratio and possible leakage probability. Our scheme has flexible applications in secure data communication and authorization delegation in open cloud computing systems.

A Survey: Importance of ANN based NIDS in Detection of DoS Attacks

Today’s world i.e. either private or public (government) sector totally influenced by Internet and networking for their business, entertainment purpose. But black side of an internet cannot be ignored .Internet makes the door open to the intruders and hackers. Any successful attempt made by intruders in capturing data causes a big loss of confidential data or digital money. This forces organizations to adopt serious security policy. It may include either use of an encryption methodology or firewall .Now a days as preventive security organization may use an Intrusion detection system. An Intrusion detection system classifies incoming data as normal data and attack data and if attack pattern is recognized it gives alarm to the network administrator .There are various algorithms and methods are proposed for IDS. In this paper we proposed the importance of ANN in developing NIDS for detecting denial of service attacks. The proposed ANN based NIDS will make classification of input packets into 4 categories DoS, U2R,R2L, PROBING in the first step .In the second step NIDS system can be enhanced to detect the DoS attack as Smruf, Teardrop, Neptune, Land, Pod, Back. This developed NIDS can minimize false positive and false negative rate by increasing number of hidden layers in the construction of ANN. General Terms Network Security, Artificial Neural Network .Network Intrusion Detection System, Intrusion Detection System. Denial of service .

Security of PHR Model on Public Cloud using MultiAuthority and Key Policy Attribute based Encryption

Personal Health Record (PHR) is a web based set of tools that provides the facility to exchange and maintain a complete electronic health record of a patient. Third-party service providers are available to maintain PHRs like HealthVault1, Google Health or Web MD. These applications allow individuals to enter, store and share their own health data, upload health measurements from their devices or from hospital EHR systems. Another alternative is to outsource PHR to the third party cloud service providers or on semi trusted servers. It helps to increase PHR efficiency and to overcome problems associated with maintaining own specialized data centers. However, serious privacy concern arises as data are exposed to unauthorized users. The potential solution to this problem is to encrypt the data before outsourcing, however while encrypting data the issue of key management, data privacy and fine grained access remains a major concern. Taking these issues into consideration the paper proposes a model for securing PHR stored in semitrusted third party servers by adopting attribute-based encryption (ABE). The advantage of ABE is, the complexity of encryption and decryption linearly increases with the increase number of attributes which are desired for large systems, although the challenge to make system collusion resistant need to be handled efficiently. To overcome these challenges the model proposes the use of dual system encryption methodology. The encryption techniques from Multi-authority ABE and Key-Policy ABE are combined. Use of MA-ABE technique proves beneficial for key management and flexible access and potential security threat of colluding users is handled by KP-ABE. To this end, proposed framework has attempted to achieve data security by MAABE and data privacy by KP-ABE scheme thus improving overall security of the system.

Anonymous HIBE with short ciphertexts: full security in prime order groups

Anonymous Hierarchical Identity-Based Encryption (HIBE) is an extension of Identity-Based Encryption (IBE), and it provides not only a message hiding property but also an identity hiding property. Anonymous HIBE schemes can be applicable to anonymous communication systems and public key encryption systems with keyword searching. However, previous anonymous HIBE schemes have some disadvantages that the security was proven in the weaker model, the size of ciphertexts is not short, or the construction was based on composite order bilinear groups. In this paper, we propose the first efficient anonymous HIBE scheme with short ciphertexts in prime order (asymmetric) bilinear groups, and prove its security in the full model with an efficient reduction. To achieve this, we use the dual system encryption methodology of Waters. We also present the benchmark results of our scheme by measuring the performance of our implementation.

깊이정보 콘텐츠 보안을 위한 이산 웨이블릿 변환 영역에서의 암호화 기술

As the usage of digital image contents increase, a security problem for the payed image data or the ones requiring confidentiality is raised. This paper propose a depth-map image contents encryption methodology to hide the depth information. This method is performed on the frequency coefficients in the Wavelet domain. This method, by selecting the level and threshold value for the wavelet transform, encryption at various strengths are possible. The experimental results showed that encrypting only 0.048% of the entire data was enough to hide the constants of the depth-map. The encryption algorithm expected to be used effectively on the researches on encryption and others for image processing.