Anda di halaman 1dari 5

SINERGI Vol. xx, No.

x, October 20xx: xxx-xxx


DOAJ: doaj.org/toc/2460-1217
DOI: doi.org/10.22441/sinergi.xxxx.xx.xxx .

COMPARISON ANALYSIS BETWEEN AES, DES, AND DSS


CRYPTOGRAPHY ALGORITHM
Fernando Setiawan, Linna Oktaviana Sari, ST., MT
Informatics Engineering Study Program, Electrical Engineering Department, Faculty of Engineering,
University of Riau
Jl. HR. Soebrantas KM 12.5, Simpang Baru, Panam, Pekanbaru, Riau 28293
Email: Fernando.setiawan5863@student.unri.ac.id, Linnaoasari@lecturer.unri.ac.id

Abstract - Reviewing the rapid development of various multimedia technologies, there will be more
multimedia data which will be generated and transmitted, the internet also allows extensive distribution
of digital media data. Now it is much easier to edit, modify and duplicate digital information. Besides
that, digital documents are also easy to distribute. Therefore, there will be many threats that will be
faced. Therefore, to find the right data protection data that includes sensitive information that should
not be accessible to the public or can only be a user who can use it, so now, security is an alternative
way best to guarantee security. What's more, many image encryption schemes have been proposed,
each algorithm has its own strengths and weaknesses. Many methods can be done in improving data
security including Advance Encryption Standard, Data Encryption Standard and Decision Support
System. This study will compare the method. From the results of Comparison 3, this method is better
to use the AES algorithm, because the AES algorithm requires less encryption time and description
than the DES and DSS algorithms.

Keywords: Data Security; Advance Encryption Standard; Data Encryption Standard; Decision Support
System.

INTRODUCTION techniques used to improve the security aspects


Digital imagery is often used in presenting of information. Cryptography is the study of
various information in it, therefore digital image science and art to maintain a message or data
can be important if the digital image has valuable information so that the data is safe. Cryptography
information, and can be personal, because supports the needs of two information security
basically the information data in the form of digital aspects, namely secrecy (protection of the
images is needed compared to the data of the confidentiality of information data) and
nature text and used in various fields such as authenticity (protection against counterfeiting and
security, medical, science, engineering, arts, changing unwanted information).
entertainment, education and training A good cryptographic algorithm will take a
advertisements. With the increasing use of digital long time to decode data that has been encoded.
techniques for the transmission and storage of Along with the development of computer
digital images, it does need to be considered. technology, the world of information technology
This is because the confidentiality of information requires a stronger and safer cryptographic
is very important and personal, because of data algorithm.
theft, and attacks on data in the form of digital Cryptography is the art and science of
images that can directly or indirectly cause protecting unwanted individual information by
various problems that can have a serious impact turning it into a form that is not recognized by the
on illegal, social and economic issues, because attacker as long as the data is stored and
not all existing information is made for transmitted.
consumption in general. Cases that often occur Cryptographic data mainly changes the contents
are photo engineering or photo distribution of data, such as text, images, audio, video and so
illegally, of course this is detrimental to the on to be used as unreadable, invisible or
owner, so that a security from interested sources incomprehensible data during transmission or
is needed which certainly produces a product in storage called Encryption. The main purpose of
the form of digital image. cryptography is to maintain the security of the
Cryptography is basically the science of form of data from invalid attackers. The opposite
applying mathematics to encrypt data and of data encryption is Decryption data.
decrypt data. Cryptography is one of the

Fernando Setiawan, Comparative Analysis of AES, DES andDSS Cryptography 1


ISSN: 1410-2331

Original data that will be sent or stored is AESAlgorithm Method (Advanced Encryption
called plaintext, which is data that can be read Standard)
and understood by people or computers.
Whereas unreadable data, whether by humans or a. Data Representation The
machines is called a cipher text. A system or input and output of the AES algorithm
product that provides encryption and decryption consists of a data sequence of 128 bits. The
is called cryptography. Cryptosystems use sequence of data that has been formed in one
encryption algorithms that determine how simple 128-bit group is also called a data block
or complex the encryption process is, the orplaintext which will be encrypted into ciphertext.
required software components, and keys (usually Thecipher key AESconsists of a key with 128
bit string lengths), which work with algorithms to bits, 192 bits, or 256 bits. The sequence of bits is
encrypt and decrypt data. numbered from 0 to n-1 where n is the sequence
The security level of an encryption number. The sequence of 8 bits of data in
algorithm depends on the size of the key length. sequence is called a byte where this byte is the
The larger the length of the main key, the more basic unit of the operation to be performed on the
time it takes the attacker to do a complete search data block.
of the length of the main key, and thus the higher b. Encryption
the level of security. In the encryption process, a The encryption process in the AES
key is a piece of information (a value consisting algorithm consists of 4 types of bytes
of a large sequence of random bits) that transformation, namely SubBytes, ShiftRows,
determines certain changes from the plaintext to Mixcolumns, and AddRoundKey.
ciphertext, or vice versa during the decryption At the beginning of the encryption process, the
process, which is a range of values that can be input that has been copied into the state will
used to assemble keys. Larger key lengths can undergo a byte transformation AddRoundKey.
be built (for example this time using key sizes of After that, the state will undergo repeated
128,192, or 256 bits. The strength of the SubBytes,
encryption algorithm depends on the secrecy of ShiftRows, MixColumns, and AddRoundKey
keys, key lengths, initialization vectors, and how transformations as much as Nr. This process in
they are all shared. Symmetrical cryptography the AES algorithm is called a round function.
algorithms use symmetrical keys (also called The lastsomewhat different from round
secret key) or asymmetric algorithms use istheround-round previouswhere in the round
asymmetric keys (also called public key and a last, the state does not undergo MixColumns
private key.) transformation.
and along with advances in information
technology, software (software) is also The Data EncryptionAlgorithm method is
experiencing rapid growth as their decision Standard (DES)
support systems is one example of algorithm DESincluded in the symmetry
programming Knowledge-based With the cryptography system and belongs to thetype
advancement of information technology from year cipher block. DES operates on a block size of 64
to year the world of banking has also bits. DES encrypts 64 bit plaintext into 64 bit
experienced very rapid progress from year to ciphertext by using 56internal keysor up-keys
year, according to Gorry and Scoot Morton (subkeys). The internal key is generated from
(1997) decision support systems are "Interactive an(external keyexternal key) that is 64 bits long.
computer based system, which help decision The global scheme of the DES algorithm is as
makers utilize data and model to solve follows:
unstructured problems ". While Keen and Scoot
Morton (1998) provide another definition, namely 1. The plaintext block is mutated with thematrix
"decision support systems that are capable of initial permutation(initial permutation or IP).
improving the quality of decision. It is a computer 2. The initial permutation results areenciphered
based support system of management decision 16 times (16 rounds). Each round uses a
makers who deal with semi structured. different internal key.
3. The enciphering results are then mutated with
METHODS a reverse permutation matrix (inverse initial
In this study, there are several methods permutation or IP-1) into a block of ciphertext.
that will be compared, along with the explanation. In theprocess enciphering, the plaintext block is
divided into two parts, left (L) and right (R), each

Fernando Setiawan, Comparative Analysis of AES, DES andDSS Cryptography 2


ISSN: 1410-2331

of which is 32 bits long. These two parts enter K16 can be generated from (C0, D0) without the
into 16 rounds of DES. need to shift bits. Note that (C0, D0) is the bits of
At each round i, block R is the the external key K given by the user at the time of
input for the transformation function called f. At decryption. Next, K15 is generated from (C15, D15)
function f, block R is combined withinternal key which (C15, D15) is obtained by shifting C16 (which
Ki's. The output from the function f is XORed with is equal to C0) and D16 (which is equal to C0) one
block L to getblock R. the newWhileblock L the bit to the right. The rest, K14 to K1 are produced
newis taken directly from theblock R. from (C14, D14) to (C1, D1). Note that (Ci - 1,Di - 1)
previousThis is a round of DES. is obtained by shifting Ci and Di in the same way,
but theleft shift ischanged to theright shift.
a. Enciphering
The process of enciphering the plaintext Method Decision Support System
block is carried out after initial permutation. Each In 1970, Scoot Morton conveyed the main
plaintext block experiences 16 timesrounds concepts of decision support systems. He
enciphering. Eachround enciphering is a Feistel defined Decision Support Systems as:
network that is mathematically expressed as: "Interactive computers based on systems that
Li = Ri - 1 can assist in decision making using data and
Ri = Li - 1 f(Ri - 1, Ki) models for problem solving" (Gorry and Scoot
E is an expansion function that Morton, 1971).
extends the Ri - 1 32-bitblock to a 48-bit block . Another definition of decision support
The expansion function is realized by systems according to Keen and Scoot Morton
permutation matrix expansion. Next, the output of (1978) is: "Decision Making System uses
expansion, which is E(Ri - 1), whose length is 48 intellectual individual resources with the ability of
bits XORed with Ki whose 48-bit length produces computers to improve the quality of decisions.
vector A with a 48-bit length: This is the use of computers based on a support
E(Ri - 1) Ki = A system for management of decision makers
Vector A grouped into 8 groups, 6 each bits, and dealing with problems. half structured. "
become input to the process substitution. The Each part of this definition has a key concept that
substitution process is done by using eight pieces contributes to the unique character of the
(S-boxS-box), S1 to S8. Every the S-box accepts decision support system. Decision support
6 bits and produces 4 bit output. Group The first system is a computer-based system that adds
6-bit uses S1, the second 6-bit group uses S2, technology in it, so that it can assist in decision
etc. making.
b. Decryption
The decryption process of ciphertext is
the opposite of the encryption process. DES uses
the same algorithm for the encryption and Components of Decision Support Systems
decryption process. If in the encryption process
the order of internal keys used is K1, K2, ..., K16, A decision support system has three main
then in the decryption process the key sequence subsystems that determine the technical
used is K16, K15, ..., K1. For each round of 16, 15, capability of the decision support system, namely
..., 1, output in the database management subsystem, the model
each round deciphering is: base management subsystem, and the dialogue
Li = Ri - 1 organizer software subsystem.
Ri = Li - 1 f(Ri - 1, Ki)
In this case,(R16, L16)is block initial input for
deciphering. The block (R16, L16) is obtained by
mutating the ciphertext with the permutation
matrix IP-1. The pre-output of
deciphering is (L0, R0). With initial IP permutation
the original plaintext block will be recovered.
Review the internal key generation process.
During deciphering, K16 is generated from (C16,
D16) with PC-2 permutations. Of course (C16, D16)
cannot be obtained directly at the beginning of
deciphering. But because (C16, D16) = (C0, D0),

Fernando Setiawan, Comparative Analysis of AES, DES andDSS Cryptography 3


ISSN: 1410-2331

1. AES algorithm requires less encryption


and decryption time than the DES
algorithm. so a more efficient comparative
study of the AESalgorithm

REFERENCE
Ariyus, D. (2008). Introduction to
Cryptography, Theory, Analysis
and Implementation.
Yogyakarta: Andi Offset.

Johansson, K. (2001). A short


summary of Blowfish
Algorithm: Descryption of a
New Variable Lenght Key,
Figure 1. Components ofDecision Support 64/128-Bit Block Cipher
Systems between (Blowfish) by Bruce Schneier.
Retrieved from
COMPARISONAES AND DES http://www.finecrypt.net/bloe
In the table below a comparative study fish encryption algorithm.html
between DES and AES is presented in nine
factors, namely key length, ciphertext type, block Kurniawan, Y. (2004). Cryptography
size, development, resistance to cryptanalysis, Internet Securityand Telecommunication
security, possible keys, possible ACSII character Network.
keys that can be displayed, time taken to check Bandung: Informatics.
all possible key.
Rhee, MY (1994). Cruptography and Secure
Communications.Singapore: MCGraw-Hill
Book Co.

Rinaldi, M. (2006). Retrieved from


www.informatika.org/~rinaldi/Kriptografi/2010
... / crypto10-11.htm

Schneier, B. (1996). Applied Cryptoghraphy:


Protocols, Algorithms, and Source Code in C.
USA: John Willey & Sons, Inc.

Singh, SP, & Maini, R. (2011).


Comparison of Data Encryption Algorithm.
International Journal of Computer Science
and Communication, 2 (1), 125-127.

Kurniawan. Cryptography: Internet Security and


Communication Networks. April 2004.
Informatics Bandung.

Muhammad Fairuzabadi, Classic Cryptographic


CONCLUSIONS Implementation Using Borland Delphi.
In this journal presented a Comparative University of PGRI Jogjakarta. 2010.
study between DES and AES and DSS. With a
theoretical comparison, experimental analysis Dony Ariyus, Introduction to Cryptography in
and comparison of DES and AES algorithms. Theory of Analysis and Implementation.
Based on the text file used and the experimental STMIK AMIKOM Jogjakarta. 2008
results it can be concluded that: Materials for Socialization of PT. Bank Rakyat
Indonesia (Persero),Credit Guidelines (PKK)

Fernando Setiawan, Comparative Analysis of AES, DES andDSS Cryptography 4


ISSN: 1410-2331

Credit Risk Rating and Color Classification


Decision of Credit Authority Delegation: BRI
Head Office Jakarta, 2001.

Fikri, Rijalul, et al,Java Programming.


Yogyakarta: Andi, 2005.

Kadarsah, Suryadi and M. Ali Ramdhani ....


Decision Support SystemsContents: PT
Remaja Rosda Karya, 2000

Kusrini, M. Kom ... Concept and Application of


Decision Support Systems. STMIK AMIKOM
Yogyakarta: Andi., 2007

Fernando Setiawan, Comparative Analysis of AES, DES andDSS Cryptography 5

Anda mungkin juga menyukai