TITLE

A Rapid Cryptography Algorithm Based on Chaos and Public Key

AUTHOR(S)
Yun-peng Zhang; Xia Lin; Qiang Wang; Sinnott, Richard O.
PUB. DATE
April 2012
SOURCE
Journal of Software (1796217X);Apr2012, Vol. 7 Issue 4, p856
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
This paper is based on the combined application of chaotic and public key cryptosystems to support rapid cryptography algorithms, leveraging their individual advantages. To demonstrate this we designed a rapid knapsack public key algorithm [1] utilizing double sequences, which themselves use a sequence of random numbers generated from interference of Logistic [2] and Chebychev [3] chaotic mapping. We also designed a chaotic pseudo-random number generator while analyzing its characteristics and used it for the implementation of the algorithm. Through simulation and comparisons with related algorithms transversely and longitudinally, we have developed a cryptographic algorithm with higher efficiency and better security.
ACCESSION #
76109694

 

Related Articles

  • A Fast Chaos-Based Pseudo-Random Bit Generator Using Binary64 Floating-Point Arithmetic. Fran├žois, Michael; Defour, David; Negre, Christophe // Informatica (03505596);Jun2014, Vol. 38 Issue 2, p115 

    Chaos-based cryptography is widely investigated in recent years, especially in the field of random number generators. The paper describes a novel pseudo-random bit generator (PRBG) based on chaotic logistic maps. Three logistic maps are combined in the algorithmic process, and a block of 32...

  • Cryptanalysis of the Chor--Rivest Cryptosystem. Vaudenay, Serge // Journal of Cryptology;2001, Vol. 14 Issue 2, p87 

    Knapsack-based cryptosystems used to be popular in the beginning of public key cryptography before all but the Chor-Rivest cryptosystem being broken. In this paper we show how to break this one with its suggested parameters: GF(p[sup24]) and GF(256[sup25]). We also give direction on possible...

  • Greedy Estimation of Distributed Algorithm to Solve Bounded knapsack Problem. Gupta, Shweta; Batra, Devesh; Verma, Pragya // International Journal of Computer Science & Information Technolo;2014, Vol. 5 Issue 3, p4313 

    This paper develops a new approach to find solution to the Bounded Knapsack problem (BKP). The Knapsack problem is a combinatorial optimization problem where the aim is to maximize the profits of objects in a knapsack without exceeding its capacity. BKP is a generalization of 0/1 knapsack...

  • 6 X 6 Playfair Cipher using LFSR based Unique Random Number Generator. Kaur, Armandeep; Verma, Harsh Kumar; Singh, Ravindra Kumar // International Journal of Computer Applications;8/1/2012, Vol. 51, p30 

    Playfair cipher is the well-known multiple letter encryption cipher. Here the digraphs in the plaintext are treated as single units and converted into corresponding cipher text digraphs. However because of the drawbacks inherent in the 5 X 5 Playfair cipher which adversely affects the security...

  • Comparison among different Cryptographic Algorithms using Neighborhood-Generated Keys. Singh, Lalit; Bharti, R. K. // International Journal of Computer Applications;Jul2013, Vol. 73 Issue 1-22, p39 

    The prevention of information from unauthorized access is the main concern in the area of cryptography. There are various algorithms i.e. Elgamal, RSA, diffie Hellman, Knapsack are proposed with varying key length and key management methods. The size of encrypted message, key management method...

  • A BRANCH-AND-PRICE ALGORITHM FOR THE MULTIPERIOD SINGLE-SOURCING PROBLEM. Freling, Richard; Romeijn, H. Edwin; Morales, Dolores Romero; Wagelmans, Albert P. M. // Operations Research;Nov/Dec2003, Vol. 51 Issue 6, p922 

    In this paper, we propose a multiperiod single-sourcing problem (MPSSP), which takes both transportation and inventory into consideration, suitable for evaluating the performance of a logistics distribution network in a dynamic environment. We reformulate the MPSSP as a Generalized Assignment...

  • True Random Bit Generator Using ZCDPLL Based on TMS320C6416. Nasir, Qassim // International Journal of Communications, Network & System Scienc;Jul2009, Vol. 2 Issue 4, p258 

    A True Random Binary Generator (TRBG) based on a zero crossing digital phase-locked loop (ZCDPLL) is proposed. In order to face the challenges of using the proposed TRBG in cryptography, the proposed TRBG is subjected to the AIS 31 test suite. The ZCDPLL operate as chaotic generator for certain...

  • A Novel Pseudo Random Number Generator Based on Two Plasmonic Maps. Fran├žois, Michael; Grosges, Thomas; Barchiesi, Dominique; Erra, Robert // Applied Mathematics;Nov2012, Vol. 3 Issue 11, p1664 

    In plasmonic systems, the response of nanoobjects under light illumination can produce complex optical maps. Such plasmonic or resonant systems have interesting characteristics such as sensitivity on parameters and initial conditions. In this paper, we show how these complex maps can be...

  • Measuring the Insertion Attack Effect on Randomness Property of AES-based Pseudorandom Generator. Indarjani, Santi; Widjaja, Belawati // International Proceedings of Computer Science & Information Tech;2012, Vol. 40, p118 

    Random (pseudorandom) number generator (RNG/PRNG) as the heart of a cryptographic system could be a potential target for adversary to defect the security. The attack can be performed actively through insertion attack on the random outputs to reduce or even omit the randomness property. In this...

Share

Read the Article

Courtesy of VIRGINIA BEACH PUBLIC LIBRARY AND SYSTEM

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics