Recovering the Cyclic-Code of Generated Polynomial by Using Evolutionary Computation
The data integrity in computer security is a key component of what we call trustworthy computing, and one of the most important issues in data integrity is to detect and correct error codes, which is also a crucial step in software and hardware design. Numerous methods have been recently proposed to solve legal-codes of the cyclic-code generated polynomial g(x). We think that a better approach for this purpose is to solve the legal-codes by finding the roots of the cyclic-code generated polynomial. However, as it is well known, finding roots of polynomials of high degree in the modulo-q space GF(q) is very difficult. In this paper we propose a method to solve the roots of cyclic-code generated polynomial by using evolutionary computation, which makes use of randomized searching method from biological natural selection and natural genetic system.
KeywordsEvolutionary Computation Cyclic Code Computer Security Generate Polynomial Legal Code
Unable to display preview. Download preview PDF.
- Wang Xingmei, Zhang Huanguo, Ma Jianfeng, Tan Zhongping, 1999. “Error-Correction Code Technology in Computer”. People’s Post Press.Google Scholar
- .Pan Zhengjun. Kang Lishan, Chen Yuping, Evolutionary Computation, Tsinghua University Press, 1998.Google Scholar
- Ye Dacheng, 1996, 24(12). “The solution to genetic algorithm of route selection and volume allocation problem in computer communication network”. Electronic Journal.Google Scholar
- Wang Xinmei, 1991, 280 ∼ 284. “Error-Correcting Code—Theory and Method”. Xian: Xidian University Press.Google Scholar
- Holland J H. 1975, “Adaption in Natural and Artificial Systems”. Ann Arbor: University of Michigan Press.Google Scholar
- Spillman R. 1993, 17(4), “Cryptanalysis of Knapsack Chipers Using Genetic Algorithms”. CryptologyiaGoogle Scholar
- Zhang Muxiang, 1994, 76(3), “Simulated Annealing Approach to the Minimum Distance of Error-Correcting Codes”. Int J Electronics.Google Scholar