Conference Paper

A Competitive Study of Cryptography Techniques over Block Cipher

Inf. Technol. Dept., Univ. Utara Malaysia, Sintok, Malaysia
DOI: 10.1109/UKSIM.2011.85 Conference: Computer Modelling and Simulation (UKSim), 2011 UkSim 13th International Conference on
Source: IEEE Xplore


The complexity of cryptography does not allow many people to actually understand the motivations and therefore available for practicing security cryptography. Cryptography process seeks to distribute an estimation of basic cryptographic primitives across a number of confluences in order to reduce security assumptions on individual nodes, which establish a level of fault-tolerance opposing to the node alteration. In a progressively networked and distributed communications environment, there are more and more useful situations where the ability to distribute a computation between a number of unlike network intersections is needed. The reason back to the efficiency (separate nodes perform distinct tasks), fault-tolerance (if some nodes are unavailable then others can perform the task) and security (the trust required to perform the task is shared between nodes) that order differently. Hence, this paper aims to describe and review the different research that has done toward text encryption and description in the block cipher. Moreover, this paper suggests a cryptography model in the block cipher.

Download full-text


Available from: Ashwaq Mahmood Alabaichi, Feb 18, 2015
217 Reads
  • [Show abstract] [Hide abstract]
    ABSTRACT: A key management protocol has been described that will allow the Data Encryption Standard (DES) to be integrated into electronic data processing systems for the purpose of obtaining communication security and file security. Several cryptographic keys have been defined that allow the desired key management protocol to be achieved. They are: • Host master key (KMO) • First variant of the host master key (KM1) • Second variant of the host master key (KM2) • Terminal master key (KMT) • Secondary communication key (KNC) • Secondary file key (KNF) • Primary communication key, or session key (KS) • Primary file key, or file key (KF).
    Ibm Systems Journal 02/1978; 17(2-17):106 - 125. DOI:10.1147/sj.172.0106 · 1.79 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In this Letter we address some basic questions about chaotic cryptography, not least the very definition of chaos in discrete systems. We propose a conceptual framework and illustrate it with different examples from private and public key cryptography. We elaborate also on possible limits of chaotic cryptography.
    Physics Letters A 06/2007; 366(3-366):211-216. DOI:10.1016/j.physleta.2007.02.021 · 1.68 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: We present a new private key cryptosystem based on the finite-field wavelet. The encryption and decryption are performed by the synthesis and analysis banks of the nonlinear finite-field wavelet transform, whose filter coefficients are determined by the keys of the users. We exploit the polyphase representation of the wavelets to introduce a shared key mechanism for the wavelet cryptosystem. We propose to use wavelets that operate over GF(256) and a nonlinear device that performs a mapping on the field elements to their inverse in the field. The introduced cryptographic system can operate in either stream-cipher or block-cipher modes depending on whether the filterbanks perform linear or circular convolution. The block cipher system has a key length of 16 symbols (128 bits) and an input block size of 30 symbols (240 bits). To evaluate the efficiency of the developed two-round wavelet cryptographic scheme, we compare it with DES and AES. Our results suggest that the wavelet cryptosystem has comparable computational complexity to AES and approximately half the complexity of DES. The security is tied to the length of the wavelet basis function and to the nonlinearity within the wavelet transform. We study the security of the block-cipher wavelet cryptosystem in response to classical attacks and those specific to this algorithm, particularly those which use variations of the divide and conquer, interpolation attack, and discrete Fourier transform techniques. We show that chosen ciphertext attacks of the wavelet encryption system can reduce to the problem of solving a set of nonlinear equations over finite fields. By considering existing classical and structure-specific attacks, we conclude that the lowest complexity of any of these attacks is greater than an exhaustive key search.
    IEEE Transactions on Signal Processing 11/2004; 52(10-52):2975 - 2991. DOI:10.1109/TSP.2004.833864 · 2.79 Impact Factor
Show more