5 research outputs found

    An More effective Approach of ECC Encryption Algorithm using DNA Computing

    Get PDF
    Now a day’s Cryptography is one of the broad areas for researchers. Encryption is most effective way to achieve data security. Cryptographic system entails the study of mathematical techniques of encryption and decryption to solve security problems in communication. Elliptic Curve Cryptography (ECC) is one of the most efficient techniques that are used for this issue. Many researchers have tried to exploit the features of ECC field for security applications. This paper describes an efficient approach based elliptic curve and DNA computing. The security of the scheme is based on Elliptic Curve Discrete Logarithm Problem (ECDLP). Existing DNA based cryptography technique need more computational power and more processing time with larger key sizes to provide higher level of security. The main goal of our construction is to enhance the security of elliptic curve cryptosystem using DNA Computing. Both image and text data are encrypted successfully

    An Innovative Approach for Enhancing Cloud Data Security using Attribute based Encryption and ECC

    Get PDF
    Cloud computing is future for upcoming generations. Nowadays various companies are looking to use Cloud computing services, as it may benefit them in terms of price, reliability and unlimited storage capacity. Providing security and privacy protection for the cloud data is one of the most difficult task in recent days. One of the measures which customers can take care of is to encrypt their data before it is stored on the cloud. Recently, the attribute-based encryption (ABE) is a popular solution to achieve secure data transmission and storage in the cloud computing. In this paper, an efficient hybrid approach using attribute-based encryption scheme and ECC is proposed to enhance the security and privacy issues in cloud. Here, the proposed scheme is based on Cipher text-Policy Attribute Based Encryption (CP-ABE) without bilinear pairing operations. In this approach, the computation-intensive bilinear pairing operation is replaced by the scalar multiplication on elliptic curves. Experimental results show that the proposed scheme has good cryptographic properties, and high security level which depends in the difficulty to solve the discrete logarithm problem on elliptic curves (ECDLP)

    Optimal Cluster Head in DTN Routing Hierarchical Topology (DRHT)

    Get PDF
    In delay tolerant networking (DTN), nodes are autonomous and behave in an unpredictable way. Consequently, a control mechanism of topology is necessary. This mechanism should ensure the overall connectivity of the network taking into account nodes’ mobility. In this paper, we study the problem of data routing with an optimal delay in the bundle layer, by exploiting: the clustering, the messages ferries and the optimal election of cluster head (CH). We first introduce the DTN routing hierarchical topology (DRHT) which incorporates these three factors into the routing metric. We propose an optimal approach to elect a CH based on four criteria: the residual energy, the intra-cluster distance, the node degree and the head count of probable CHs. We proceed then to model a Markov decision process (MDP) to decide the optimal moment for sending data in order to ensure a higher delivery rate within a reasonable delay. At the end, we present the simulation results demonstrating the effectiveness of the DRHT. Our simulation shows that while using the DRHT which is based on the optimal election of CH, the traffic control during the TTL interval (Time To Live) is balanced, which greatly increases the delivery rate of bundles and decreases the loss rate

    Stochastic Analysis of Mobile Ad-hoc Networks

    Get PDF
    Abstract The MANET networks (Mobile Ad-hoc Networks) are known by their dynamicity of nodes and they are without pre-existing infrastructure. To study this kind of networks, we modelled them by a Random Geometric Graphs (RGG). We show that this type of graph is the best adapted to represent such networks, and this shows that the RGG are able to catch the dynamicity properties. We study then the evolution of the network by a continuous-time birth-death Markov process

    Equations d'evolution et bilans energetiques en viscoelasticite lineaire : etude dans le cadre de la thermodynamique des materiaux a memoire evanescente

    No full text
    CNRS T Bordereau / INIST-CNRS - Institut de l'Information Scientifique et TechniqueSIGLEFRFranc
    corecore