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 In proceeding of: Computer Modelling and Simulation (UKSim), 2011 UkSim 13th International Conference on
Source: IEEE Xplore

ABSTRACT 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.

2 Bookmarks
 · 
251 Views
  • [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; · 1.29 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. 01/2007;
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper addresses various approaches for efficient hardware implementation of the Advanced Encryption Standard algorithm. The optimization methods can be divided into two classes: architectural optimization and algorithmic optimization. Architectural optimization exploits the strength of pipelining, loop unrolling and sub-pipelining. Speed is increased by processing multiple rounds simultaneously at the cost of increased area. Architectural optimization is not an effective solution infeed-back mode. Loop unrolling is the only architecture that can achieve a slight speedup with significantly increased area. In non-feedback mode, subpipelining can achieve maximum speedup and the best speed/area ratio. Algorithmic optimization exploits algorithmic strength inside each round unit. Various methods to reduce the critical path and area of each round unit are presented. Resource sharing issues between encryptor and decryptor are also discussed. They become important issues when both encryptor and decryptor need to be implemented in a small area.
    IEEE Circuits and Systems Magazine 03/2003; · 1.67 Impact Factor

Full-text (2 Sources)

View
21 Downloads
Available from
Jun 2, 2014