Abstract
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.
Foundation item: This work was supported by the National Natural Science Key Foundation of China with the Grant No.60133010 and the National Research Foundation for the Doctoral Program of Higher Education of China with the Grant No.20030486049.
Biography: Li Kangshun (1962-), male, Ph. D candidate, senior engineer, research direction: Evolutionary computation, computer security.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Wang Xingmei, Zhang Huanguo, Ma Jianfeng, Tan Zhongping, 1999. “Error-Correction Code Technology in Computer”. People’s Post Press.
Pan Zhengjun. Kang Lishan, Chen Yuping, Evolutionary Computation, Tsinghua University Press, 1998.
Ye Dacheng, 1996, 24(12). “The solution to genetic algorithm of route selection and volume allocation problem in computer communication network”. Electronic Journal.
Wang Xinmei, 1991, 280 ∼ 284. “Error-Correcting Code—Theory and Method”. Xian: Xidian University Press.
Holland J H. 1975, “Adaption in Natural and Artificial Systems”. Ann Arbor: University of Michigan Press.
Spillman R. 1993, 17(4), “Cryptanalysis of Knapsack Chipers Using Genetic Algorithms”. Cryptologyia
Zhang Muxiang, 1994, 76(3), “Simulated Annealing Approach to the Minimum Distance of Error-Correcting Codes”. Int J Electronics.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag/Wien
About this paper
Cite this paper
Li, K., Li, Y., Mo, H. (2005). Recovering the Cyclic-Code of Generated Polynomial by Using Evolutionary Computation. In: Ribeiro, B., Albrecht, R.F., Dobnikar, A., Pearson, D.W., Steele, N.C. (eds) Adaptive and Natural Computing Algorithms. Springer, Vienna. https://doi.org/10.1007/3-211-27389-1_108
Download citation
DOI: https://doi.org/10.1007/3-211-27389-1_108
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-24934-5
Online ISBN: 978-3-211-27389-0
eBook Packages: Computer ScienceComputer Science (R0)