The Implementation of a Brute Force Attack System using a Client / Server Model


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 6, No. 6, pp. 1622-1634, Jun. 1999
10.3745/KIPSTE.1999.6.6.1622,   PDF Download:

Abstract

We use an encryption algorithm to protect our sensitive information. But most encryption algorithms are open, so the level of security depends on the length of key. Therefore, there is an attack called "Brute force attack" which checks all possible keys. Nowadays, the technology of hardware and distributed system has progressed. So, many people try to recover the ciphertext without key information using several computers connecting each other via network. In this paper, In order to checks all possible key of conventional algorithms using a various key length that generally encrypts messages, we designed an algorithm which assigned key block to each computer and implemented a client/server system which is able to search a key used in encryption algorithm. Moreover we analyzed the system performance factors including time and cost for finding 40 bits length of key of RC4 algorithm.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
S. S. Heon, P. H. Dong, K. C. Kill, P. J. Gil, K. Y. Jin, R. J. Cheol, "The Implementation of a Brute Force Attack System using a Client / Server Model," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 6, no. 6, pp. 1622-1634, 1999. DOI: 10.3745/KIPSTE.1999.6.6.1622.

[ACM Style]
Song Sang Heon, Park Hyun Dong, Kim Chung Kill, Park Jung Gil, Kim Young Jin, and Ryou Jae Cheol. 1999. The Implementation of a Brute Force Attack System using a Client / Server Model. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 6, 6, (1999), 1622-1634. DOI: 10.3745/KIPSTE.1999.6.6.1622.